Recent Comments

Recent Posts
 Gil’s Collegial Quantum Supremacy Skepticism FAQ
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
 Starting today: Kazhdan Sunday seminar: “Computation, quantumness, symplectic geometry, and information”
 The story of Poincaré and his friend the baker
 Gérard Cornuéjols’s baker’s eighteen 5000 dollars conjectures
 Noisy quantum circuits: how do we know that we have robust experimental outcomes at all? (And do we care?)
 Test Your Intuition 40: What Are We Celebrating on Sept, 28, 2019? (And answer to TYI39.)
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 Jeff Kahn and Jinyoung Park: Maximal independent sets and a new isoperimetric inequality for the Hamming cube.
Top Posts & Pages
 Gil's Collegial Quantum Supremacy Skepticism FAQ
 Amazing! Keith Frankston, Jeff Kahn, Bhargav Narayanan, Jinyoung Park: Thresholds versus fractional expectationthresholds
 Amazing: Hao Huang Proved the Sensitivity Conjecture!
 Quantum computers: amazing progress (Google & IBM), and extraordinary but probably false supremacy claims (Google).
 TYI 30: Expected number of Dice throws
 Jeff Kahn and Jinyoung Park: Maximal independent sets and a new isoperimetric inequality for the Hamming cube.
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 The story of Poincaré and his friend the baker
 Amazing: Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang made dramatic progress on the Sunflower Conjecture
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
65 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