TOPICS
Search

Cap Set


A cap set is a subset A of the affine space F_3^n containing no three distinct collinear points, where n is a positive integer and F_3 is the finite field with three elements. Equivalently, the only solutions in A to

 x+y+z=0

have x=y=z. This is also the condition that A contain no nonconstant three-term arithmetic progression, since x+z=2y is the same equation over F_3 (Davis and Maclagan 2003, Ellenberg and Gijswijt 2017).

The set {0,1}^n is a cap set of size 2^n. Indeed, three entries from {0,1} can have sum zero modulo 3 only when they are all equal, so the vector equation forces equality in every coordinate.

Let r_3(n) be the maximum size of a cap set in F_3^n. Ellenberg and Gijswijt (2017) proved that there is a constant C>0, independent of n, such that

 r_3(n)<=C2.756^n.

Since 2.756<3, this is exponentially smaller than the 3^n points of the full affine space.

In dimension four, r_3(4)=20 (Davis and Maclagan 2003). Under the SET game correspondence, this means that 20 cards can contain no valid triple, whereas every collection of 21 cards contains one.


See also

Affine Space, Arithmetic Progression, SET Game

Explore with Wolfram|Alpha

References

Davis, B. L. and Maclagan, D. "The Card Game SET." Math. Intelligencer 25, 33-40, 2003. https://doi.org/10.1007/BF02984846.Ellenberg, J. S. and Gijswijt, D. "On Large Subsets of F_q^n with No Three-Term Arithmetic Progression." Ann. Math. 185, 339-343, 2017. https://doi.org/10.4007/annals.2017.185.1.8.

Cite this as:

Weisstein, Eric W. "Cap Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CapSet.html

Subject classifications