Recent Comments
-
Recent Posts
- Some News from a Seminar in Cambridge
- Subspace Designs, Unit and Distinct Distances, and Piercing Standard Boxes.
- Greg Kuperberg @ Tel Aviv University
- Israel AGT Day, Reichman University, March 5, 2023
- Alef’s Corner: Democracy (Israel, 2023)
- Absolutely Sensational Morning News – Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- The Trifference Problem
- Greatest Hits 2015-2022, Part II
- Greatest Hits 2015-2022, Part I
Top Posts & Pages
- Some News from a Seminar in Cambridge
- Absolutely Sensational Morning News - Zander Kelley and Raghu Meka proved Behrend-type bounds for 3APs
- Greg Kuperberg @ Tel Aviv University
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- To cheer you up in difficult times 7: Bloom and Sisask just broke the logarithm barrier for Roth's theorem!
- 'Gina Says'
- R(5,5) ≤ 48
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- The Argument Against Quantum Computers - A Very Short Introduction
RSS
Tag Archives: Convexity
Igor Pak’s “Lectures on Discrete and Polyhedral Geometry”
Here is a link to Igor Pak’s book on Discrete and Polyhedral Geometry (free download) . And here is just the table of contents. It is a wonderful book, full of gems, contains original look on many important directions, things that … Continue reading
Posted in Book review, Convex polytopes, Convexity
Tagged Convex polytopes, Convexity, Igor Pak, rigidity
4 Comments
Five Open Problems Regarding Convex Polytopes
The problems 1. The conjecture A centrally symmetric d-polytope has at least non empty faces. 2. The cube-simplex conjecture For every k there is f(k) so that every d-polytope with has a k-dimensional face which is either a simplex … Continue reading