- To cheer you up in difficult times 6: Play Rani Sharim’s two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- To cheer you up in difficult times 4: Women In Theory present — I will survive
- To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
- Harsanyi’s Sweater
- To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
- Trees not Cubes! Memories of Boris Tsirelson
- A small update from Israel and memories from Singapore: Partha Dasgupta, Robin Mason, Frank Ramsey, and 007
- Game Theory – on-line Course at IDC, Herzliya
Top Posts & Pages
- Game Theory 2020
- 'Gina Says'
- TYI 30: Expected number of Dice throws
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Dan Romik on the Riemann zeta function
- To cheer you up in difficult times 6: Play Rani Sharim's two-player games of life, read Maya Bar-Hillel presentation on catching lies with statistics, and more.
- The story of Poincaré and his friend the baker
- Why is mathematics possible?
Monthly Archives: May 2015
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
Readers of the big-league ToC blogs have already heard about the breakthrough paper An average-case depth hierarchy theorem for Boolean circuits by Benjamin Rossman, Rocco Servedio, and Li-Yang Tan. Here are blog reports on Computational complexity, on the Shtetl Optimized, and of Godel … Continue reading