- Alef Corner: Math Collaboration
- Alef’s Corner: Math Collaboration 2
- To cheer you up in difficult times 11: Immortal Songs by Sabine Hossenfelder and by Tom Lehrer
- To cheer you up in difficult times 10: Noam Elkies’ Piano Improvisations and more
- Quantum Matters
- To cheer you up in difficult times 9: Alexey Pokrovskiy proved that Rota’s Basis Conjecture holds asymptotically
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski’s Conjecture on Randomly Signed Sums
- Noam Lifshitz: A new hypercontractivity inequality — The proof!
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth’s theorem!
Top Posts & Pages
- TYI 30: Expected number of Dice throws
- Quantum Matters
- Gil's Collegial Quantum Supremacy Skepticism FAQ
- To Cheer you up in Difficult Times 8: Nathan Keller and Ohad Klein Proved Tomaszewski's Conjecture on Randomly Signed Sums
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Extremal Combinatorics IV: Shifting
- Are Natural Mathematical Problems Bad Problems?
Monthly Archives: March 2019
Update April 2, 2019: the links below are not working anymore. Google Plus is a nice social platform with tens of millions participants. I found it especially nice for scientific posts, e.g. by John Baez, Moshe Vardi, or about symplectic … Continue reading
Breaking news: David Harvey and Joris Van Der Hoeven. Integer multiplication in time O(nlogn). 2019. (I heard about it from Yoni Rozenshein on FB (חפירות על מתמטיקה); update GLL post. ) _____ Update: There were many interesting comments here and … Continue reading
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
For breaking news, scroll down. Lior Kalai: Survivor Meets the Monty Hall Puzzle We start with the classical question and go on with a new version contributed by my son Lior. Update: A few brief comments on the original problem … Continue reading
My 1983 Ph D thesis was on Helly-type theorems which is an exciting part of discrete geometry and, in the last two decades, I have had an ongoing research project with Roy Meshulam on topological Helly-type theorems. The subject found … Continue reading
Update: The result was achieved by Andrew Booker from Bristol. Here is the preprint Cracking the problem with 33. It is a notoriously difficult open problem which integers can be written as the sum of three integer cubes. Such integers … Continue reading
Consider a Brownian motion in three dimensional space. What is the largest number of points on the path described by the motion which form an arithmetic progression? (Namely, , so that all are equal.) A 2-D picture; In … Continue reading
How much is The product ranges over all primes. In other words, Just heard it from Avinoam Mann.
Philippe Flajolet 1948-2011 I am happy to forward the announcement on two free online courses (Mooks) by Bob Sedgewick Analysis of Algorithms and Analytic Combinatorics. Analysis of Algorithms page provides access to online lectures, lecture slides, and assignments for … Continue reading