Combinatorics·OpenAI Math·Result 177·Lean formalisation listed
Bounded-degree coboundary expanders
One of the 372 results in OpenAI's public mathematics catalogue, filed under combinatorics: 1 preprint, the latest dated 24 September 2026. This page quotes OpenAI's own summary of the claim, links the paper and abstract, and will embed the animation.
Latest paper
Bounded-degree coboundary expanders in every dimension
The animation for this result has not been released yet. Subscribe on YouTube to catch it.
What OpenAI claims
Constructs arbitrarily large finite d-dimensional simplicial complexes, for every d ≥ 3, with uniformly bounded vertex degrees and uniform 𝔽2 coboundary expansion in every degree below d. Together with the known graph and two-dimensional cases, this establishes the existence of such expanders in every positive dimension. (Lean)
Paper
Bounded-degree coboundary expanders in every dimension
For every integer d ≥ 3, we construct arbitrarily large finite d-dimensional simplicial complexes with uniformly bounded vertex degrees and uniform 𝔽2 coboundary expansion in every degree below d. Together with the known graph and two-dimensional cases, this establishes the existence of bounded-degree 𝔽2 coboundary expanders in every positive dimension.
Status
Preprint. The paper has not been independently reviewed. Treat the result as OpenAI's claim until other mathematicians have checked it. If a video exists, it illustrates the statement; it is not the proof.
Related results in Combinatorics
- 178Deterministic nonbipartite Ramanujan graphs in every fixed degree
- 179The circulant Hadamard and Barker-sequence conjecturesLean
- 180Barnette’s Hamiltonian-cycle conjectureVideoLean
- 181The Erdős–Gallai cycle-decomposition conjectureVideoLean
- 182Power savings for intersective polynomial differences and prime argumentsLean
- 183Power savings for planar halving lines and k-setsLean