Recent Comments

Recent Posts
 Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words
 Subhash Khot, Dor Minzer and Muli Safra proved the 2to2 Games Conjecture
 Interesting Times in Mathematics: Enumeration Without Numbers, Group Theory Without Groups.
 Cody Murray and Ryan Williams’ new ACC breakthrough: Updates from Oded Goldreich’s Choices
 Yael Tauman Kalai’s ICM2018 Paper, My Paper, and Cryptography
 Ilan Karpas: Frankl’s Conjecture for Large Families
 Third third of my ICM 2018 paper – Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 Second third of my ICM 2018 paper – Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
 First third of my ICM2018 paper – Three Puzzles on Mathematics, Computation and Games. Corrections and comments welcome
Top Posts & Pages
 Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words
 Subhash Khot, Dor Minzer and Muli Safra proved the 2to2 Games Conjecture
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Interesting Times in Mathematics: Enumeration Without Numbers, Group Theory Without Groups.
 Cody Murray and Ryan Williams' new ACC breakthrough: Updates from Oded Goldreich's Choices
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Yael Tauman Kalai's ICM2018 Paper, My Paper, and Cryptography
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 TYI 30: Expected number of Dice throws
RSS
Tag Archives: Peter Keevash
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
In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 1831
The 18th yearly school in mathematics is devoted this year to combinatorics. It will feature lecture series by Irit Dinur, Joel Hass, Peter Keevash, Alexandru Nica, Alexander Postnikov, Wojciech Samotij, and David Streurer and additional activities. As usual grants … Continue reading
Amazing: Peter Keevash Constructed General Steiner Systems and Designs
Here is one of the central and oldest problems in combinatorics: Problem: Can you find a collection S of qsubsets from an nelement set X set so that every rsubset of X is included in precisely λ sets in the collection? … Continue reading