I heard a lecture by Benny Sudakov on the remarkable paper Towertype bounds for unavoidable patterns in words, by David Conlon, Jacob Fox, and Benny Sudakov. Here are the slides, and let me let the slides speak for themselves.
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
 Subhash Khot, Dor Minzer and Muli Safra proved the 2to2 Games Conjecture
 Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words
 If Quantum Computers are not Possible Why are Classical Computers Possible?
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Believing that the Earth is Round When it Matters
 Can Category Theory Serve as the Foundation of Mathematics?
 Greatest Hits
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 TYI 30: Expected number of Dice throws
RSS