Recent Comments
-
Recent Posts
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- Igor Pak: How I chose Enumerative Combinatorics
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Noga Alon and Udi Hrushovski won the 2022 Shaw Prize
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Past and Future Events
- Joshua Hinman proved Bárány’s conjecture on face numbers of polytopes, and Lei Xue proved a lower bound conjecture by Grünbaum.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- Combinatorial Convexity: A Wonderful New Book by Imre Bárány
Top Posts & Pages
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Igor Pak: How I chose Enumerative Combinatorics
- Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
- Richard Stanley: How the Proof of the Upper Bound Theorem (for spheres) was Found
- Richard Stanley: Enumerative and Algebraic Combinatorics in the1960’s and 1970’s
- The Argument Against Quantum Computers - A Very Short Introduction
- A sensation in the morning news - Yaroslav Shitov: Counterexamples to Hedetniemi's conjecture.
- Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
- To cheer you up in difficult times 13: Triangulating real projective spaces with subexponentially many vertices
RSS
Monthly Archives: August 2013
Open Collaborative Mathematics over the Internet – Three Examples
After much hesitation, I decided to share with you the videos of my lecture: Open collaborative mathematics over the internet – three examples, that I gave last January in Doron Zeilberger’s seminar at Rutgers on experimental mathematics. Parts of the 47-minutes … Continue reading
Poznań: Random Structures and Algorithms 2013
Michal Karonski (left) who built Poland’s probabilistic combinatorics group at Poznań, and a sculpture honoring the Polish mathematicians who first broke the Enigma machine (right, with David Conlon, picture taken by Jacob Fox). Update: Here is a picture from 2015, while … Continue reading
Posted in Combinatorics, Conferences, Open problems, Philosophy, Probability
Tagged Poznan, RSA
4 Comments
BosonSampling and (BKS) Noise Sensitivity
Update (Nov 2014): Noise sensitivity of BosonSampling and computational complexity of noisy BosonSampling are studied in this paper by Guy Kindler and me. Some of my predictions from this post turned out to be false. In particular the noisy BosonSampling … Continue reading
Posted in Computer Science and Optimization, Physics, Probability, Quantum
Tagged BosonSampling, Noise, Noise-sensitivity, Quantum computation
8 Comments