- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.
- The US Elections and Nate Silver: Informtion Aggregation, Noise Sensitivity, HEX, and Quantum Elections.
- Avifest live streaming
- AlexFest: 60 Faces of Groups
- Postoctoral Positions with Karim and Other Announcements!
- AviFest, AviStories and Amazing Cash Prizes.
- Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- יופיה של המתמטיקה
- The Quantum Computer Puzzle @ Notices of the AMS
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Believing that the Earth is Round When it Matters
- Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash's Theorem. And more news on designs.
- Sarkaria's Proof of Tverberg's Theorem 1
- A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
- 'Gina Says'
Category Archives: Games
Dinitz’ conjecture The following theorem was conjectured by Jeff Dinitz in 1979 and proved by Fred Galvin in 1994: Theorem: Consider an n by n square table such that in each cell (i,j) you have a set with n or more elements. … Continue reading
The angle of Victoria Beckham’s hat (here in a picture from a recent wedding) is closely related to our previous post on football One of the highlights of the recent Newton Institute conference on discrete harmonic analysis was a football … Continue reading
The Complexity of Zero-Sum Stochastic Games with Perfect Information Is there a polynomial time algorithm for chess? Well, if we consider the complexity of chess in terms of the board size then it is fair to think that the answer is … Continue reading
Oliver Friedmann, Thomas Dueholm Hansen, and Uri Zwick have managed to prove subexponential lower bounds of the form for the following two basic randomized pivot rules for the simplex algorithm! This is the first result of its kind and deciding … Continue reading
Recall the game “matching pennies“. Player I has to chose between ‘0’ or ‘1’, player II has to chose between ‘0’ and ‘1’.No player knows what is the choice of the other player before making his choice. Player II pays … Continue reading
A recent interesting article by Ariel Rubinstein entitled “Digital Sodom” (in Hebrew) argues that certain forms of futures trading (and Internet sites where these forms of trading take place) are essentially gambling activities. The issue of “what is gambling” is very intereting. In an earlier … Continue reading
Can chess be a game of luck? Let us consider the following two scenarios: A) We have a chess tournament where each of forty chess players pay 50 dollars entrance fee and the winner takes the prize which is 80% … Continue reading
Well, I wrote an article (in Hebrew) about it in the Newspaper Haaretz. An English translation appeared in the English edition. Here is an appetizer: During World War II, many fighter planes returned from bombing missions in Japan full of bullet holes. The … Continue reading
Yair Tauman (This post is a continuation of this previous post.) Aumann and Myerson proposed that if political and ideological matters are put aside, the party forming the coalition would (or should) prefer to form the coalition in which its own power (according … Continue reading