REVIEW 1 cited by
How many cards should you lay out in a game of EvenQuads?: A detailed study of caps in AG(n,2)
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
We define a \textit{cap} in the affine geometry $AG(n,2)$ to be a subset in which any collection of 4 points is in general position. In this paper we classify, up to affine equivalence, all caps in $AG(n,2)$ of size $k \leq 9$. As a result, we obtain a complete characterization of caps in dimension $n \leq 6$, in particular complete and maximal caps. Since the \textit{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.
Forward citations
Cited by 1 Pith paper
-
SET! From Groups to Games
A survey and extension of SET-like card games over finite groups, introducing new torsor-based games and a symmetry characterization for the group of five elements.
Discussion (0). Continue with ORCID to comment.