### Recent Comments

Giving a talk at Eli… on Academic Degrees and Sex Johan Aspegren on To Cheer You Up in Difficult T… To cheer you up in d… on Another sensation – Anni… Gil Kalai on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… Kevin on To Cheer You Up in Difficult T… Gil Kalai on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T… Alexander Barvinok on To Cheer You Up in Difficult T… uniform on To Cheer You Up in Difficult T… Arseniy on To Cheer You Up in Difficult T… -
### Recent Posts

- Giving a talk at Eli and Ricky’s geometry seminar. (October 19, 2021)
- To cheer you up in difficult times 32, Annika Heckel’s guest post: How does the Chromatic Number of a Random Graph Vary?
- To Cheer You Up in Difficult Times 31: Federico Ardila’s Four Axioms for Cultivating Diversity
- Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part I, mainly 2019)
- To Cheer you up in difficult times 30: Irit Dinur, Shai Evra, Ron Livne, Alex Lubotzky, and Shahar Mozes Constructed Locally Testable Codes with Constant Rate, Distance, and Locality
- To cheer you up in difficult times 29: Free will, predictability and quantum computers
- Alef’s corner: Mathematical research
- Let me tell you about three of my recent papers
- Mathematical news to cheer you up

### Top Posts & Pages

- Giving a talk at Eli and Ricky's geometry seminar. (October 19, 2021)
- Academic Degrees and Sex
- The Argument Against Quantum Computers - A Very Short Introduction
- To cheer you up in difficult times 32, Annika Heckel's guest post: How does the Chromatic Number of a Random Graph Vary?
- To Cheer You Up in Difficult Times 31: Federico Ardila's Four Axioms for Cultivating Diversity
- To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- TYI 30: Expected number of Dice throws
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- Must-read book by Avi Wigderson

### 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