- 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
- 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!
Top Posts & Pages
- The Kadison-Singer Conjecture has beed Proved by Adam Marcus, Dan Spielman, and Nikhil Srivastava
- Believing that the Earth is Round When it Matters
- Test Your Intuition (19): The Advantage of the Proposers in the Stable Matching Algorithm
- János Pach: Guth and Katz's Solution of Erdős's Distinct Distances Problem
- Polymath 8 - a Success!
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Jim Geelen, Bert Gerards, and Geoﬀ Whittle Solved Rota's Conjecture on Matroids
- 'Gina Says'
- Analysis of Boolean Functions
Tag Archives: Topological combinatorics
This is a new polymath3 research thread. Our aim is to tackle the polynomial Hirsch conjecture which asserts that there is a polynomial upper bound for the diameter of graphs of -dimensional polytopes with facets. Our research so far was … Continue reading
We had a series of posts (1,2,3,4) “from Helly to Cayley” on weighted enumeration of Q-acyclic simplicial complexes. The simplest case beyond Cayley’s theorem were Q-acyclic complexes with vertices, edges, and triangles. One example is the six-vertex triangulation of the … Continue reading
In the first part of this post we discussed an appealing conjecture regaring an extension of Cayley’s counting trees formula. The number of d-dimensional “hypertrees” should somehow add up to . But it was not clear to us which complexes we want … Continue reading
1. Helly’s theorem and Cayley’s formula Helly’s theorem asserts: For a family of n convex sets in , n > d, if every d+1 sets in the family have a point in common then all members in the family have a point in common. … Continue reading
Turan’s problem asks for the minimum number of triangles on n vertices so that every 4 vertices span a triangle. (Or equivalently, for the maximum number of triangles on n vertices without a “tetrahedron”, namely without having four triangles on … Continue reading