### Recent Comments

Muhamed on In And Around Combinatorics: T… Ehud on Ehud Friedgut: Blissful ignora… wvandernoort on Ehud Friedgut: Blissful ignora… Yiftach Barnea on Test your intuition 24: Which… Gil Kalai on Test your intuition 24: Which… Yiftach Barnea on Test your intuition 24: Which… Yiftach Barnea on Test your intuition 24: Which… Gil Kalai on Test your intuition 24: Which… Gil Kalai on Test your intuition 24: Which… Gabor Pete on Test your intuition 24: Which… chun-xuan jiang on Polymath 8 – a Succ… domotorp on Test your intuition 24: Which… -
### Recent Posts

- Test your intuition 24: Which of the following three groups is trivial
- School Starts at HUJI
- A lecture by Noga
- Ehud Friedgut: Blissful ignorance and the Kahneman-Tversky paradox
- In And Around Combinatorics: The 18th Midrasha Mathematicae. Jerusalem, JANUARY 18-31
- 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

### Top Posts & Pages

- Test your intuition 24: Which of the following three groups is trivial
- Believing that the Earth is Round When it Matters
- Can Category Theory Serve as the Foundation of Mathematics?
- יופיה של המתמטיקה
- In how many ways you can chose a committee of three students from a class of ten students?
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- When It Rains It Pours
- A lecture by Noga
- Happy Birthday Ron Aharoni!

### RSS

# Category Archives: Geometry

## Many triangulated three-spheres!

The news Eran Nevo and Stedman Wilson have constructed triangulations with n vertices of the 3-dimensional sphere! This settled an old problem which stood open for several decades. Here is a link to their paper How many n-vertex 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 two-distance 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 3-manifold is a compact 3-dimensional 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 Sylvester-Gallai

Avi Wigderson was in town and gave a beautiful talk about an extension of Sylvester-Gallai 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, Sylvester-Gallai
4 Comments