- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.
- The US Elections and Nate Silver: Informtion Aggregation, Noise Sensitivity, HEX, and Quantum Elections.
- Avifest live streaming
- AlexFest: 60 Faces of Groups
- Postoctoral Positions with Karim and Other Announcements!
- AviFest, AviStories and Amazing Cash Prizes.
- Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- יופיה של המתמטיקה
- The Quantum Computer Puzzle @ Notices of the AMS
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Believing that the Earth is Round When it Matters
- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash's Theorem. And more news on designs.
- Sarkaria's Proof of Tverberg's Theorem 1
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- 'Gina Says'
Category Archives: Combinatorics
It is a pleasure to announce my own birthday conference which will take place in Jerusalem on June 15-16 2015. Here is the meeting’s homepage! The organizers asked me also to mention that some support for accommodation in Jerusalem for the … Continue reading
Muli, Dor and Subash, Jerusalem May 21 2015. Michel Talagrand Gregory Margulis Property testing In this post I will tell you about a new paper by Subhash Khot, Dor Minzer and Muli Safra entitled: On … Continue reading
Arguably mathematics is getting harder, although some people claim that also in the old times parts of it were hard and known only to a few experts before major simplifications had changed matters. Let me report here about two recent remarkable simplifications … Continue reading
A quick schematic road-map to these new geometric objects. The positroidron can be seen as a cellular structure on the nonnegative Grassmanian – the part of the real Grassmanian G(m,n) which corresponds to m by n matrices with all m by … Continue reading
The topological Tverberg conjecture (discussed in this post), a holy grail of topological combinatorics, was refuted! The three-page paper “Counterexamples to the topological Tverberg conjecture” by Florian Frick gives a brilliant proof that the conjecture is false. The proof is … Continue reading
Tahl Nowik Update 3 (January 30): The midrasha ended today. Update 2 (January 28): additional videos are linked; Update 1 (January 23): Today we end the first week of the school. David Streurer and Peter Keevash completed … Continue reading
When can we properly color the vertices of a graph with a few colors? This is a notoriously difficult problem. Things get a little better if we consider simultaneously a graph together with all its induced subgraphs. Recall that an … Continue reading
Coloring Edge-coloring of simple polytopes One of the equivalent formulation of the four-color theorem asserts that: Theorem (4CT) : Every cubic bridgeless planar graph is 3-edge colorable So we can color the edges by three colors such that every two … Continue reading
Noga with Uri Feige among various other heroes A few weeks ago I devoted a post to the 240-summit conference for Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach, and today I will bring you the slides of Noga … Continue reading
Gian Carlo Rota Rota’s conjecture I just saw in the Notices of the AMS a paper by Geelen, Gerards, and Whittle where they announce and give a high level description of their recent proof of Rota’s conjecture. The 1970 conjecture asserts … Continue reading