- Mathematical Gymnastics
- Media Item from “Haaretz” Today: “For the first time ever…”
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota’s Conjecture on Matroids
- Media items on David, Amnon, and Nathan
- 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!
Top Posts & Pages
- Believing that the Earth is Round When it Matters
- Exciting News on Three Dimensional Manifolds
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Why Quantum Computers Cannot Work: The Movie!
- The Ultimate Riddle
- Mathematical Gymnastics
- A Meeting at Marburg
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota's Conjecture on Matroids
Category Archives: Computer Science and Optimization
I gathered a few of the comments made by participants of my lecture “Why quantum computers cannot work and how”, and a few of my answers. Here they are along with some of the lecture’s slides. Here is the link … Continue reading
Last Friday, I gave a lecture at the quantum information seminar at MIT entitled “Why quantum computers cannot work and how.” It was a nice event with lovely participation during the talk, and a continued discussion after it. Many very … Continue reading
Maximal lattice-free convex bodies introduced by Herb Scarf and the related complex of maximal lattice free simplices (also known as the Scarf complex) are remarkable geometric constructions with deep connections to combinatorics, convex geometry, integer programming, game theory, fixed point computations, … Continue reading
Over the last two meetings of our HU quantum computation seminar we heard two talks about symplectic geometry and its relations to quantum mechanics and quantum noise. Yael Karshon: Manifolds, symplectic manifolds, Newtonian mechanics, quantization, and the non squeezing theorem. … Continue reading
I just saw in Claire Mathieu’s blog “A CS professor blog” that a simple proof of the Sleator-Tarjan-Thurston’s diameter result for the graph of the associahedron was found by Lionel Pournin! Here are slides of his lecture “The diameters of associahedra” … Continue reading
Quid est noster computationis mundus? Nine months after is started, (much longer than expected,) and after eight posts on GLL, (much more than planned,) and almost a thousand comments of overall good quality, from quite a few participants, my … Continue reading
In a couple of days, we will resume the debate between Aram Harrow and me regarding the possibility of universal quantum computers and quantum fault tolerance. The debate takes place over GLL (Godel’s Lost Letter and P=NP) blog. The Debate Where were … Continue reading
Wolfgang Haken found an algorithm to tell if a knot is trivial, and, more generally with Hemion, if two knots are equivalent. Joel Hass, Jeff Lagarias and Nick Pippinger proved in 1999 that telling that a knot is unknotted is … Continue reading
The Debate continues The debate between Aram Harrow and me on Godel Lost letter and P=NP (GLL) regarding quantum fault tolerance continues. The first post entitled Perpetual motions of the 21th century featured mainly my work, with a short response by Aram. … Continue reading
Heavier than air flight of the 21 century? The very first post on this blog entitled “Combinatorics, Mathematics, Academics, Polemics, …” asked the question “Are mathematical debates possible?” We also had posts devoted to debates and to controversies. A few days ago, … Continue reading