Recent Comments

Recent Posts
 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 4: Women In Theory present — I will survive
 To cheer you up in difficult times 3: A guest post by Noam Lifshitz on the new hypercontractivity inequality of Peter Keevash, Noam Lifshitz, Eoin Long and Dor Minzer
 Harsanyi’s Sweater
 To cheer you up in difficult times II: Mysterious matching news by Gal Beniamini, Naom Nisan, Vijay Vazirani and Thorben Tröbst!
 Trees not Cubes! Memories of Boris Tsirelson
 A small update from Israel and memories from Singapore: Partha Dasgupta, Robin Mason, Frank Ramsey, and 007
 Game Theory – online Course at IDC, Herzliya
 TYI44: “What Then, To Raise an Old Question, is Mathematics?”
Top Posts & Pages
 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 4: Women In Theory present  I will survive
 TYI 30: Expected number of Dice throws
 Extremal Combinatorics VI: The FranklWilson Theorem
 Or Ordentlich, Oded Regev and Barak Weiss: New bounds for Covering Density!
 Game Theory 2020
 A sensation in the morning news  Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
 Aubrey de Grey: The chromatic number of the plane is at least 5
 My Quantum Debate with Aram Harrow: Timeline, Nontechnical Highlights, and Flashbacks I
RSS
Monthly Archives: September 2019
Test Your Intuition 40: What Are We Celebrating on Sept, 28, 2019? (And answer to TYI39.)
Update: We are celebrating 10 years anniversary to Mathoverflow Domotorp got the answer right. congratulations, Domotorp! To all our readers: Shana Tova Umetuka – שנה טובה ומתוקה – Happy and sweet (Jewish) new year.
Posted in Test your intuition, What is Mathematics
Tagged Mathoverflow, Test your intuition
6 Comments
Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
A 2017 cartoon from this post. After the embargo update (Oct 25): Now that I have some answers from the people involved let me make a quick update: 1) I still find the paper unconvincing, specifically, the verifiable experiments (namely experiments … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Quantum, Updates
Tagged John Martinis
67 Comments
Jeff Kahn and Jinyoung Park: Maximal independent sets and a new isoperimetric inequality for the Hamming cube.
Three isoperimetric papers by Michel Talagrand (see the end of the post) Discrete isoperimetric relations are of great interest on their own and today I want to tell you about a new isoperimetric inequality by Jeff Kahn and Jinyoung Park … Continue reading
Alef’s corner: Bicycles and the Art of Planar Random Maps
The artist behind Alef’s corner has a few mathematical designs and here are two new ones. (See Alef’s website offering over 100 Tshirt designs.) which was used for the official Tshirt for JeanFrançois Le Gall’s birthday conference. See also … Continue reading
Paul Balister, Béla Bollobás, Robert Morris, Julian Sahasrabudhe, and Marius Tiba: Flat polynomials exist!
Béla Bollobás and Paul Erdős at the University of Cambridge in 1990. Credit George Csicsery (from the 1993 film “N is a Number”) (source) (I thank Gady Kozma for telling me about the result.) An old problem from analysis with a … Continue reading
Posted in Analysis, Combinatorics
Tagged Béla Bollobás, Flat polynomials, Julian Sahasrabudhe, Marius Tiba, Paul Balister, Robert Morris
1 Comment
Computer Science and its Impact on our Future
A couple of weeks ago I told you about Avi Wigderson’s vision on the connections between the theory of computing and other areas of mathematics on the one hand and between computer science and other areas of science, technology and … Continue reading
Posted in Academics, Computer Science and Optimization, Quantum, Updates
Tagged computer science
1 Comment
Richard Ehrenborg’s problem on spanning trees in bipartite graphs
Richard Ehrenborg with a polyhedron In the Problem session last Thursday in Oberwolfach, Steve Klee presented a beautiful problem of Richard Ehrenborg regarding the number of spanning trees in bipartite graphs. Let be a bipartite graph with vertices on one … Continue reading