Recent Comments
-
Recent Posts
- Meeting Michael H. at Rio
- 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
Top Posts & Pages
- Meeting Michael H. at Rio
- To cheer you up in difficult times 5: A New Elementary Proof of the Prime Number Theorem by Florian K. Richter
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- The Argument Against Quantum Computers - A Very Short Introduction
- To Cheer You Up in Difficult Times 15: Yuansi Chen Achieved a Major Breakthrough on Bourgain's Slicing Problem and the Kannan, Lovász and Simonovits Conjecture
- Are Natural Mathematical Problems Bad Problems?
- TYI 30: Expected number of Dice throws
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!
RSS
Tag Archives: Sasha Barvinok
Danny Nguyen and Igor Pak: Presburger Arithmetic Problem Solved!
Short Presburger arithmetic is hard! This is a belated report on a remarkable breakthrough from 2017. The paper is Short Presburger arithmetic is hard, by Nguyen and Pak. Danny Nguyen Integer programming in bounded dimension: Lenstra’s Theorem Algorithmic tasks are … Continue reading →