Recent Comments

Recent Posts
 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 KadisonSinger 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
 About
 In how many ways you can chose a committee of three students from a class of ten students?
RSS
Category Archives: Geometry
Many triangulated threespheres!
The news Eran Nevo and Stedman Wilson have constructed triangulations with n vertices of the 3dimensional sphere! This settled an old problem which stood open for several decades. Here is a link to their paper How many nvertex triangulations does the 3 … Continue reading
Posted in Combinatorics, Convex polytopes, Geometry, Open problems
Tagged Eran Nevo, Stedman Wilson
Leave a comment
Around Borsuk’s Conjecture 3: How to Save Borsuk’s conjecture
Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the “Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading
Some old and new problems in combinatorics and geometry
Paul Erdős in Jerusalem, 1933 1993 I just came back from a great Erdős Centennial conference in wonderful Budapest. I gave a lecture on old and new problems (mainly) in combinatorics and geometry (here are the slides), where I presented twenty … Continue reading
Andriy Bondarenko Showed that Borsuk’s Conjecture is False for Dimensions Greater Than 65!
The news in brief Andriy V. Bondarenko proved in his remarkable paper The Borsuk Conjecture for twodistance sets that the Borsuk’s conjecture is false for all dimensions greater than 65. This is a substantial improvement of the earlier record (all dimensions … Continue reading
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
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
Exciting News on Three Dimensional Manifolds
The Virtually Haken Conjecture A Haken 3manifold is a compact 3dimensional manifold M which is irreducible (in a certain strong sense) but contains an incompressible surface S. (An embedded surface S is incompressible if the embedding indices an injection of its … Continue reading
Fractional SylvesterGallai
Avi Wigderson was in town and gave a beautiful talk about an extension of SylvesterGallai theorem. Here is a link to the paper: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes by Boaz Barak, Zeev … Continue reading
Posted in Combinatorics, Computer Science and Optimization, Geometry
Tagged Avi Wigderson, Codes, Greg Kuperberg, SylvesterGallai
3 Comments