- AlexFest: 60 Faces of Groups
- Postoctoral Positions with Karim and Other Announcements!
- AviFest, AviStories and Amazing Cash Prizes.
- Polymath 10 post 6: The Erdos-Rado sunflower conjecture, and the Turan (4,3) problem: homological approaches.
- Polymath 10 Emergency Post 5: The Erdos-Szemeredi Sunflower Conjecture is Now Proven.
- Mind Boggling: Following the work of Croot, Lev, and Pach, Jordan Ellenberg settled the cap set problem!
- More Math from Facebook
- The Erdős Szekeres polygon problem – Solved asymptotically by Andrew Suk.
Top Posts & Pages
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- 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
- The Simplex, the Cyclic polytope, the Positroidron, the Amplituhedron, and Beyond
- Greatest Hits
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- AlexFest: 60 Faces of Groups
- Analysis of Boolean Functions
Category Archives: Convexity
The topological Tverberg conjecture (discussed in this post), a holy grail of topological combinatorics, was refuted! The three-page paper “Counterexamples to the topological Tverberg conjecture” by Florian Frick gives a brilliant proof that the conjecture is false. The proof is … Continue reading
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
Problem: Let P be a polytope in with n facets. Is it always true that P can be covered by n sets of smaller diameter? I also asked this question over mathoverflow, with some background and motivation.
Greetings to all! Karol Borsuk conjectured in 1933 that every bounded set in can be covered by sets of smaller diameter. In a previous post I described the counterexample found by Jeff Kahn and me. I will devote a few posts … Continue reading
Cocycles Definition: A -cocycle is a collection of -subsets such that every -set contains an even number of sets in the collection. Alternative definition: Start with a collection of -sets and consider all -sets that contain an odd number of members … Continue reading
Martin Tancer recently found a very beautiful proof that finite projective planes can’t be represented by convex sets in any fixed dimension. This was asked in the paper entitled “Transversal numbers for hypergraphs arising in geometry” by Noga Alon, Gil … Continue reading
Pavle Blagojevic, Benjamin Matschke, and Guenter Ziegler settled the “colorful Tverberg’s conjecture.” (Problem 6 in this post.) This gives a sharp version for Zivaljevic and Vrecica theorem, and crossed the “connectivity of chessboard complexes barrier”. Here is the link to the breakthrough paper.
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
Here is an answer to “Test your intuition (8)”. (Essentially the answer posed by David Eppstein.) (From Wolfram Mathworld) Buffon’s needle problem asks to find the probability that a needle of length will land on a line, given a floor … Continue reading