How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\)

DOI10.1007/s44007-023-00047-0zbMath1522.05025arXiv2212.05353MaRDI QIDQ6108941

Lauren L. Rose, Julia Crager, Darrion Thornburgh, Daniel Rose-Levine, Raphael Walker, Timothy E. Goldberg, Felicia Flores

Publication date: 30 June 2023

Published in: La Matematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.05353

zbMATH Keywords

combinatoricsaffine geometrySidon setscapsfinite geometryrecreational mathematics\textit{EvenQuads}

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Steiner systems in finite geometry (51E10) Combinatorial aspects of finite geometries (05B25)

Cites Work

• Unnamed Item
• Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• The card game SET.
• Geometry. Transl. from the French
• Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
• A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
• Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$