Greetings
Day 1
László Lovász - Spectra of graphs and geometric representationsYuval Peres - Pinpointing mixing time and distance profiles in expanders
Gil Kalai - Polymath
Tamar Ziegler - Concatenating cubic structures
Greetings
Day 2
Vojtěch Rödl - Extremal problems for uniformly dense hypergraphsTerence Tao - The Erdos discrepancy problem
Endre Szemerédi - The Shifting Method
Alexander Schrijver - The partially disjoint paths problem
Day 3
Joel Spencer - The Strange Logic of Galton-Watson TreesJaroslav Nešetřil - All the Ramsey Classes
Nati Linial - High-dimensional permutations
Assaf Naor - Lipschitz extension from finite subsets
Day 4
Avi Wigderson - Disguised lower bound problemsJennifer Chayes - Graphons and Machine Learning: Estimation of Sparse Massive Networks
János Pach - The Good, The Bad, and the Ugly: Transversals
Jacob Fox - Combinatorics of Permutations
Zoltán Füredi - Turan type problems and algebraic constructions
Day 5
Vitali Milman - Algebraic Related Structures and the Reason behind Some Classical Constructions in Convex Geometry (and Analysis)Micha Sharir - Eliminating cycles, cutting lenses, and bounding incidences
Uriel Feige - On the effect of randomness on planted 3-coloring models
Moshe Tennenholtz - Sequential Commitment Games
Saharon Shelah - Random graph: stronger logic but with the zero one law
Conference supported by the European
Research Council (ERC) and by the Israel
Science Foundation (ISF) and by the I-CORE Program of the planning and budgeting committee and The Israel Science Foundation (grant number 4/11).and by MINT -
Mathematical Institute @ Tel Aviv and by Tel Aviv University
