Recent Comments
-
Recent Posts
- Some News from a Seminar in Cambridge
- Subspace Designs, Unit and Distinct Distances, and Piercing Standard Boxes.
- Greg Kuperberg @ Tel Aviv University
- Israel AGT Day, Reichman University, March 5, 2023
- Alef’s Corner: Democracy (Israel, 2023)
- Absolutely Sensational Morning News – Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
Top Posts & Pages
- Some News from a Seminar in Cambridge
- Absolutely Sensational Morning News - Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- Greg Kuperberg @ Tel Aviv University
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth's theorem!
- 'Gina Says'
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- R(5,5) ≤ 48
- The Argument Against Quantum Computers - A Very Short Introduction
RSS
Monthly Archives: October 2021
Alef’s Corner: QED (two versions)
QED: Version 2
Dream a Little Dream: Quantum Computer Poetry for the Skeptics (Part II, The Classics)
Quantum poetry for the skeptics had long roots, and, also here, Peter Shor along with Jennifer Shor had a pioneering role. Volker Strassen’s response is the earliest poem known to me on the skeptics’ side. We will start with Jennifer … Continue reading
Giving a talk at Eli and Ricky’s geometry seminar. (October 19, 2021)
One of my favorite seminars in the world is the Courant Institute (NYU) Geometry seminar that Eli Goodman and Ricky Pollack started in the 1980s (I think). On Tuesday October 19, I will give a seminar, details follow. Jacob Eli … Continue reading
To cheer you up in difficult times 32, Annika Heckel’s guest post: How does the Chromatic Number of a Random Graph Vary?
This is a guest post kindly written by Annika Heckel. We first reported about Annika Heckel’s breakthrough in this post. A pdf version of this post can be found here. Pick an -vertex graph uniformly at random. Pick another one. … Continue reading