Latest

Combinatorics

Bounded-degree coboundary expanders

OpenAI research collection Ā· 1 manuscript Ā· Source checked 2026-10-19

OpenAI's result summary

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.

Read the manuscripts

Short excerpts below come from OpenAI's abstracts. The full abstract and original PDF preserve the paper's precise scope.

MANUSCRIPT 01

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…

Full source abstract

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.

This exact PDF is not listed in the imported formalization catalogue. Family scope notes may contain further information.

One signal in the wider AGI picture

New mathematical reasoning could help AI tackle harder scientific and computational problems. How reliably these skills transfer beyond mathematics will determine how much they contribute to general intelligence.

Explore the AGI Clock ↗