- My Very First Book “Gina Says”, Now Published by “World Scientific”
- Itai Benjamini: Coarse Uniformization and Percolation & A Paper by Itai and me in Honor of Lucio Russo
- After-Dinner Speech for Alex Lubotzky
- Boaz Barak: The different forms of quantum computing skepticism
- Bálint Virág: Random matrices for Russ
- Test Your Intuition 33: The Great Free Will Poll
- Must-read book by Avi Wigderson
- High Dimensional Combinatorics at the IIAS – Program Starts this Week; My course on Helly-type theorems; A workshop in Sde Boker
- Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
Top Posts & Pages
- My Very First Book "Gina Says", Now Published by "World Scientific"
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- TYI 30: Expected number of Dice throws
- Why Quantum Computers Cannot Work: The Movie!
- The Race to Quantum Technologies and Quantum Computers (Useful Links)
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Amazing: Peter Keevash Constructed General Steiner Systems and Designs
- If Quantum Computers are not Possible Why are Classical Computers Possible?
Category Archives: Open problems
This is the fourth in a series of posts by Eran Nevo on the g-conjecture. Eran’s first post was devoted to the combinatorics of the g-conjecture and was followed by a further post by me on the origin of the g-conjecture. Eran’s second post was about … Continue reading
Joseph Zaks (1984), picture taken by Ludwig Danzer (OberWolfach photo collection) The story I am going to tell here was told in several places, but it might be new to some readers and I will mention my own angle, … Continue reading
On June 18-23 2017 we will celebrate in Budapest the 70th birthday of Imre Bárány. Here is the webpage of the conference. For the occasion I wrote a short paper with problems in discrete geometry, mainly around Helly’s and … Continue reading
The Ramsey numbers R(s,t) The Ramsey number R(s, t) is defined to be the smallest n such that every graph of order n contains either a clique of s vertices or an independent set of t vertices. Understanding the values … Continue reading
On the occasion of Polymath 12 devoted to the Rota basis conjecture let me remind you about the Alon-Tarsi conjecture and test your intuition concerning a strong form of the conjecture. The sign of a Latin square is the product … Continue reading
The Polymath10 project on the Erdos-Rado Delta-System conjecture took place over this blog from November 2015 to May 2016. I aimed for an easy-going project that people could participate calmly aside from their main research efforts and the duration of … Continue reading
Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
In earlier posts I proposed a homological approach to the Erdos-Rado sunflower conjecture. I will describe again this approach in the second part of this post. Of course, discussion of other avenues for the study of the conjecture are welcome. The purpose … Continue reading
Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
A quote from a recent post from Jordan Ellenberg‘s blog Quomodocumque: Briefly: it seems to me that the idea of the Croot-Lev-Pach paper I posted about yesterday (GK: see also my last post) can indeed be used to give a new bound … Continue reading
This post is authored by Stefan Steinerberger. The Ulam sequence is defined by starting with 1,2 and then repeatedly adding the smallest integer that is (1) larger than the last element and (2) can be written as the sum of two … Continue reading