Construct · 1 fields · 1 citations

cap set problem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Combinatorics

the question of how large a set in an n-dimensional vector space over three elements can be without a three-term arithmetic progression, shown exponentially small.

In combinatorics, cap set problem refers to the question of how large a set in an n-dimensional vector space over three elements can be without a three-term arithmetic progression, shown exponentially small. This meaning comes from Ellenberg (2017) in Annals of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how cap set problem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

progression3 fields · 6 citationsjingle · one word, three constructs vector3 fields · 3 citationsjingle · one word, three constructs

References

Ellenberg, J., & Gijswijt, D. (2017). On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression. Annals of Mathematics, 185(1), 339-343. https://doi.org/10.4007/annals.2017.185.1.8

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct