- 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
- Dan Romik on the Riemann zeta function
- The seventeen camels riddle, and Noga Alon's camel proof and algorithms
- TYI 30: Expected number of Dice throws
- If Quantum Computers are not Possible Why are Classical Computers Possible?
- 'Gina Says'
- 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
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Game Theory 2020
Monthly Archives: September 2013
The Real Analysis ‘Boot Camp’ included three excellent mini-courses. Inapproximability of Constraint Satisfaction Problems (5 lectures) Johan Håstad (KTH Royal Institute of Technology) (Lecture I, Lecture II, Lecture III, Lecture IV, Lecture V) Unlike more traditional ‘boot camps’ Johan rewarded answers and questions … Continue reading
Lecture 6 Last week we discussed two applications of the Fourier-Walsh plus hypercontractivity method and in this lecture we will discuss one additional application: The lecture was based on a 5-pages paper by Ehud Friedgut and Jeff Kahn: On the number … Continue reading
Yitang Zhang Update (July 22, ’14). The polymath8b paper “Variants of the Selberg sieve, and bounded intervals containing many primes“, is now on the arXiv. See also this post on Terry Tao’s blog. Since the last update, we also had here … Continue reading
Lecture 4 In the third week we moved directly to the course’s “punchline” – the use of Fourier-Walsh expansion of Boolean functions and the use of Hypercontractivity. Before that we started with a very nice discrete isoperimetric question on a … Continue reading
The upper bound theorem asserts that among all d-dimensional polytopes with n vertices, the cyclic polytope maximizes the number of facets (and k-faces for every k). It was proved by McMullen for polytopes in 1970, and by Stanley for general triangulations … Continue reading
Raghu Meka talking at the workshop I spend the semester in Berkeley at the newly founded Simons Institute for the Theory of Computing. The first two programs demonstrate well the scope of the center and why it is needed. One program … Continue reading
Post on week 1; home page of the course analysis of Boolean functions Lecture II: We discussed two important examples that were introduced by Ben-Or and Linial: Recursive majority and tribes. Recursive majority (RM): is a Boolean function with variables … Continue reading
Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the “Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading
Home page of the course. In the first lecture I defined the discrete n-dimensional cube and Boolean functions. Then I moved to discuss five problems in extremal combinatorics dealing with intersecting families of sets. 1) The largest possible intersecting family … Continue reading