Recent Comments

Recent Posts
 Peter Keevash: More and Easier Designs!
 Monday February 19: Quantum Coding and High Dimensional Expanders
 Alef’s Corner: There is Still a Small Gap in the Proof
 My Argument Against Quantum Computers: An Interview with Katia Moskvitch on Quanta Magazine
 The Semester Break activities of the High Dimensional Combinatorics and Expanders Special Year
 Akshay Venkatesh Lectures at HUJI – Ostrowski’s Prize Celebration, January 24&25
 Hardness of Approximating Vertex Cover, PolytopeIntegralityGap, the AlswedeKachatrian theorem, and More.
 Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words
 Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2to2 Games Conjecture
Top Posts & Pages
 Peter Keevash: More and Easier Designs!
 Amazing: Peter Keevash Constructed General Steiner Systems and Designs
 Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash's Theorem. And more news on designs.
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 Believing that the Earth is Round When it Matters
 TYI 30: Expected number of Dice throws
 Subhash Khot, Dor Minzer and Muli Safra completed the proof of the 2to2 Games Conjecture
 Séminaire N. Bourbaki  Designs Exist (after Peter Keevash)  the paper
RSS
Advertisements