Tag Archives: Ernie Croot

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

Posted in Combinatorics, Open problems, Updates | Tagged , , , , , | 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 , , , | 3 Comments