Recent Comments

Recent Posts
 AlexFest: 60 Faces of Groups
 Postoctoral Positions with Karim and Other Announcements!
 Jirka
 AviFest, AviStories and Amazing Cash Prizes.
 Polymath 10 post 6: The ErdosRado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
 Polymath 10 Emergency Post 5: The ErdosSzemeredi Sunflower Conjecture is Now Proven.
 Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
 More Math from Facebook
 The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
Top Posts & Pages
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Extremal Combinatorics IV: Shifting
 The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
 When It Rains It Pours
 AviFest, AviStories and Amazing Cash Prizes.
 Polymath10: The Erdos Rado Delta System Conjecture
 Impagliazzo's Multiverse
 Believing that the Earth is Round When it Matters
RSS
Author Archives: Gil Kalai
Convex Polytopes: Seperation, Expansion, Chordality, and Approximations of Smooth Bodies
I am happy to report on two beautiful results on convex polytopes. One disproves an old conjecture of mine and one proves an old conjecture of mine. Loiskekoski and Ziegler: Simple polytopes without small separators. Does LiptonTarjan’s theorem extends to high … Continue reading
Igor Pak’s collection of combinatorics videos
The purpose of this short but valuable post is to bring to your attention Igor Pak’s Collection of Combinatorics Videos
EDP Reflections and Celebrations
The Problem In 1932, Erdős conjectured: Erdős Discrepancy Conjecture (EDC) [Problem 9 here] For any constant , there is an such that the following holds. For any function , there exists an and a such that For any , … Continue reading
Séminaire N. Bourbaki – Designs Exist (after Peter Keevash) – the paper
Update: Nov 4, 2015: Here is the final version of the paper: Design exists (after P. Keevash). On June I gave a lecture on Bourbaki’s seminare devoted to Keevash’s breakthrough result on the existence of designs. Here is a draft of the … Continue reading
Important formulas in Combinatorics
Another spinoff of the Nogaposterformulacompetition is a MathOverflow question: Important formulas in combinatorics. The question collects important formulas representing major progress in combinatorics. So far there are 31 formulas and quite a few were new to me. There are several areas … Continue reading
Updates and plans III.
Update on the great Noga’s Formulas competition. (Link to the original post, many cash prizes are still for grab!) This is the third “Updates and plans post”. The first one was from 2008 and the second one from 2011. Updates: Combinatorics and … Continue reading
Posted in Combinatorics, Conferences, Updates
6 Comments
NogaFest, NogaFormulas, and Amazing Cash Prizes
Ladies and gentlemen, a conference celebrating Noga Alon’s 60th birthday is coming on January. It will take place at Tel Aviv University on January 1721. Here is the event webpage. Don’t miss the event ! Cash Prizes! The poster includes 15 … Continue reading
Carmella Kalai (19262015)
My beloved mother Carmella Kalai passed away last week. With me, 1956 My father Hanoch Kalai, my mother Carmella, My sister Tamar (Tami) and me around 1957).
Choongbum Lee proved the BurrErdős conjecture
Let be a graph. The Ramsey number is the smallest such that whenever you color the edges of the complete graph with vertices with two colors blue and red, you can either find a blue copy or a red copy … Continue reading
More Reasons for Small Influence
Readers of the bigleague ToC blogs have already heard about the breakthrough paper An averagecase depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and LiYang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading