- Next Week in Jerusalem: Special Day on Quantum PCP, Quantum Codes, Simplicial Complexes and Locally Testable Codes
- Happy Birthday Ervin, János, Péter, and Zoli!
- My Mathematical Dialogue with Jürgen Eckhoff
- Test Your Intuition (23): How Many Women?
- Happy Birthday Richard Stanley!
- Influence, Threshold, and Noise
- Erdős Lectures 2014 – Dan Spielman
- Answer to Test Your Intuition (22)
- Test your intuition (22): Selling Two Items in a Bundle.
Top Posts & Pages
- Why Quantum Computers Cannot Work: The Movie!
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Polymath 8 - a Success!
- Believing that the Earth is Round When it Matters
- Emmanuel Abbe: Erdal Arıkan's Polar Codes
- Another Forgotten Bet: Is Don Zagier About to Owe Me 1000 Shekels For The Proof of the ABC Conjecture?
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- In how many ways you can chose a committee of three students from a class of ten students?
Monthly Archives: August 2013
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
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). I am visiting now Poznań for the 16th … Continue reading
Following are some preliminary observations connecting BosonSampling, an interesting computational task that quantum computers can perform (that we discussed in this post), and noise-sensitivity in the sense of Benjamini, Schramm, and myself (that we discussed here and here.) BosonSampling and computational-complexity hierarchy-collapse Suppose that … Continue reading