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

DOI10.1007/S44007-023-00047-0zbMATH Open1522.05025arXiv2212.05353MaRDI QIDQ6108941FDOQ6108941

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

Publication date: 30 June 2023

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

Abstract: A 2-cap in the affine geometry $AG(n,q)$ is a subset of 4 points in general position. In this paper we classify all 2-caps in $AG(n,2)$, up to affine equivalence, for $nleq6$. We also provide structural results for general $n$. Since the EvenQuads card deck is a model for $AG(6,2)$, as a consequence we determine the probability that an arbitrary $k$-card layout contains a quad.

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

Recommendations

• A variation on the game SET
• Large caps
• Maximal caps in \(\mathrm{AG}(6,3)\).
• The largest cap in \(AG\)(4, 4) and its uniqueness
• The classification of the largest caps in AG(5, 3)

zbMATH Keywords

combinatoricsfinite geometrySidon setscapsaffine geometryrecreational mathematics\textit{EvenQuads}

Mathematics Subject Classification ID

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

Cites Work

• Geometry. Transl. from the French
• The card game SET.
• Bounds on sizes of generalized caps in \(\mathrm{AG} (n,q)\) via the Croot-Lev-Pach polynomial method
• Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps
• Improved bounds on sizes of generalized caps in \(AG(n,q)\)
• 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 joy of SET. The many mathematical dimensions of a seemingly simple card game
• A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108941)