Tag Archives: Jean Bourgain

Influence, Threshold, and Noise

Posted on June 14, 2014 by

  My dear friend Itai Benjamini told me that he won’t be able to make it to my Tuesday talk on influence, threshold, and noise, and asked if I already have  the slides. So it occurred to me that perhaps … Continue reading →

Posted in Combinatorics, Computer Science and Optimization, Conferences, Probability, Quantum | Tagged , , , , , , , | 4 Comments

The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava

Posted on June 19, 2013 by

…while we keep discussing why mathematics is possible… The news Adam Marcus, Dan Spielman, and Nikhil Srivastava posted a paper entitled “Interlacing Families II: Mixed Characteristic Polynomials and the Kadison-Singer Problem,” where they prove the 1959 Kadison-Singer conjecture. (We discussed part … Continue reading →

Posted in Analysis, Computer Science and Optimization, Physics, Updates | Tagged , , , , , | 30 Comments

Celebrations in Sweden and Norway

Posted on May 23, 2012 by

Celebrations for Endre, Jean and Terry Anders Bjorner presents the 2012 Crafoord Prize in Mathematics  I am in Sweden for two weeks to work with colleagues and to take part in two celebrations. Jean Bourgain and Terence Tao are the 2012 laureates … Continue reading →

Posted in Academics, Combinatorics, Conferences, Updates | Tagged , , | 3 Comments

Roth’s Theorem: Tom Sanders Reaches the Logarithmic Barrier

Posted on November 24, 2010 by

Click here for the most recent polymath3 research thread. I missed Tom by a few minutes at Mittag-Leffler Institute a year and a half ago Suppose that  is a subset of of maximum cardinality not containing an arithmetic progression of length 3. Let . … Continue reading →

Posted in Combinatorics, Open problems | Tagged , , , , , | 9 Comments