Recent Comments

Recent Posts
 My Very First Book “Gina Says”, Now Published by “World Scientific”
 Itai Benjamini: Coarse Uniformization and Percolation & A Paper by Itai and me in Honor of Lucio Russo
 AfterDinner Speech for Alex Lubotzky
 Boaz Barak: The different forms of quantum computing skepticism
 Bálint Virág: Random matrices for Russ
 Test Your Intuition 33: The Great Free Will Poll
 Mustread book by Avi Wigderson
 High Dimensional Combinatorics at the IIAS – Program Starts this Week; My course on Hellytype theorems; A workshop in Sde Boker
 Stan Wagon, TYI 23: Ladies and Gentlemen: The Answer
Top Posts & Pages
 My Very First Book "Gina Says", Now Published by "World Scientific"
 Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
 Test your intuition 29: Diameter of various random trees
 'Gina Says'
 TYI 30: Expected number of Dice throws
 Believing that the Earth is Round When it Matters
 A Breakthrough by Maryna Viazovska Leading to the Long Awaited Solutions for the Densest Packing Problem in Dimensions 8 and 24
 My Book: "Gina Says," Adventures in the Blogosphere String War
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
RSS
Category Archives: Computer Science and Optimization
A Few Slides and a Few Comments From My MIT Lecture on Quantum Computers
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
Meeting with Aram Harrow, and my Lecture on Why Quantum Computers Cannot Work.
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
Ann Lehman’s Sculpture Based on Herb Scarf’s Maximal Lattice Free Convex Bodies
Maximal latticefree 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
Posted in Art, Computer Science and Optimization, Economics, Games
Tagged Ann Lehman, Herb Scarf
3 Comments
Symplectic Geometry, Quantization, and Quantum Noise
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
Lionel Pournin found a combinatorial proof for SleatorTarjanThurston diameter result
I just saw in Claire Mathieu’s blog “A CS professor blog” that a simple proof of the SleatorTarjanThurston’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
Posted in Combinatorics, Computer Science and Optimization, Convex polytopes
Tagged Associahedron, Lionel Pournin
1 Comment
The Quantum Debate is Over! (and other Updates)
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
The Quantum FaultTolerance Debate Updates
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
Greg Kuperberg: It is in NP to Tell if a Knot is Knotted! (under GRH!)
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
Updates, Boolean Functions Conference, and a Surprising Application to Polytope Theory
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
A Discussion and a Debate
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