Recent Comments
-
Recent Posts
- What is mathematics (or at least, how it feels)
- Alef’s Corner
- To cheer you up in difficult times 22: some mathematical news! (Part 1)
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Amazing: Feng Pan and Pan Zhang Announced a Way to “Spoof” (Classically Simulate) the Google’s Quantum Supremacy Circuit!
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- Amazing: Simpler and more general proofs for the g-theorem by Stavros Argyrios Papadakis and Vasiliki Petrotou, and by Karim Adiprasito, Stavros Argyrios Papadakis, and Vasiliki Petrotou.
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Are Natural Mathematical Problems Bad Problems?
- TYI 30: Expected number of Dice throws
- The Argument Against Quantum Computers - A Very Short Introduction
- What is mathematics (or at least, how it feels)
- Dan Romik on the Riemann zeta function
RSS
Tag Archives: Jean Bourgain
Jean
Jean Bourgain and Joram Lindenstrauss. I was very sad to hear that Jean Bourgain, among the greatest mathematicians of our time, and a dear friend, passed away. I first met Jean about forty years ago and later we became friends … Continue reading
Posted in Analysis, Combinatorics, Computer Science and Optimization, Convexity, Number theory, Obituary
Tagged Jean Bourgain
5 Comments
Three Conferences: Joel Spencer, April 29-30, Courant; Joel Hass May 20-22, Berkeley, Jean Bourgain May 21-24, IAS, Princeton
Dear all, I would like to advertise three promising-to-be 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
Influence, Threshold, and Noise
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
The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
…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
Celebrations in Sweden and Norway
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 Endre Szemeredi, Jean Bourgain, Terry Tao
3 Comments
The AC0 Prime Number Conjecture
Möbius randomness and computational complexity Last spring Peter Sarnak gave a thought-provoking lecture in Jerusalem. (Here are the very interesting slides of a similar lecture at I.A.S.) Here is a variation of the type of questions Peter has raised. The Prime … Continue reading
Roth’s Theorem: Tom Sanders Reaches the Logarithmic Barrier
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 Endre Szemeredi, Jean Bourgain, Klaus Roth, Roger Heath-Brown, Roth's theorem, Tom Sanders
11 Comments