Recent Comments

Recent Posts
 Friendship and Sesame, Maryam and Marina, Israel and Iran
 Elchanan Mossel’s Amazing Dice Paradox (your answers to TYI 30)
 TYI 30: Expected number of Dice throws
 Test your intuition 29: Diameter of various random trees
 Micha Perles’ Geometric Proof of the ErdosSos Conjecture for Caterpillars
 Touching Simplices and Polytopes: Perles’ argument
 Where were we?
 Call for nominations for the Ostrowski Prize 2017
 Problems for Imre Bárány’s Birthday!
Top Posts & Pages
 Friendship and Sesame, Maryam and Marina, Israel and Iran
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 TYI 30: Expected number of Dice throws
 Test your intuition 29: Diameter of various random trees
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Test your intuition 28: What is the most striking common feature to all these remarkable individuals
 Test Your Intuition (17): What does it Take to Win TicTacToe
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 Updates and plans III.
RSS
Author Archives: Gil Kalai
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 CrootLevPach paper I posted about yesterday (GK: see also my last post) can indeed be used to give a new bound … Continue reading
Posted in Combinatorics, Open problems, Updates
Tagged Cap sets, Dion Gijswijt, Ernie Croot, Jordan Ellenberg, Peter Pach, Seva Lev.
21 Comments
More Math from Facebook
David Conlon pointed out to two remarkable papers that appeared on the arxive: Joel Moreira solves an old problem in Ramsey’s theory. Monochromatic sums and products in . Abstract: An old question in Ramsey theory asks whether any finite coloring … Continue reading
Posted in Combinatorics, Mathematics over the Internet, Updates
Tagged Ernie Croot, Joel Moreira, Peter Pach, Vsevolod Lev
3 Comments
The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
Here is the abstract of a recent paper by Andrew Suk. (I heard about it from a Facebook post by Yufei Zhao. I added a link to the original Erdős Szekeres’s paper.) Let ES(n) be the smallest integer such that … Continue reading
The Quantum Computer Puzzle @ Notices of the AMS
The Quantum Computer Puzzle My paper “the quantum computer puzzle” has just appeared in the May 2016 issue of Notices of the AMS. Here are the beautiful drawings for the paper (representing the “optimistic view” and the “pessimistic view”) by my … Continue reading
Three Conferences: Joel Spencer, April 2930, Courant; Joel Hass May 2022, Berkeley, Jean Bourgain May 2124, IAS, Princeton
Dear all, I would like to advertise three promisingtobe wonderful mathematical conferences in the very near future. Quick TYI. See if you can guess the title and speaker for a lecture described by “where the mathematics of Cauchy, Fourier, Sobolev, … Continue reading
Posted in Analysis, Combinatorics, Conferences, Geometry, Updates
Tagged Jean Bourgain, Joel Hass, Joel Spencer
Leave a comment
Math and Physics Activities at HUJI
Between 1115 of September 2016 there will be a special mathematical workshop for excellent undergraduate students at the Hebrew University of Jerusalem. In parallel there will also be a workshop in physics. These workshops are aimed for second and third … Continue reading
Stefan Steinerberger: The Ulam Sequence
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
TYI 26: Attaining the Maximum
(Thanks, Dani!) Given a random sequence , ******, , let . and assume that . What is the probability that the maximum value of is attained only for a single value of ? Test your intuition: is this probability bounded … Continue reading
A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
Maryna Viazovska The news Maryna Viazovska has solved the densest packing problem in dimension eight! Subsequently, Maryna Viazovska with Henry Cohn, Steve Miller, Abhinav Kumar, and Danilo Radchenko solved the densest packing problem in 24 dimensions! Here are the links to … Continue reading
Polymath10post 4: Back to the drawing board?
It is time for a new polymath10 post on the ErdosRado Sunflower Conjecture. (Here are the links for post1, post2, post3.) Let me summarize the discussion from Post 3 and we can discuss together what directions to peruse. It is … Continue reading