The SET Card Game and Partitions into Maximal Caps: A Partial Difference Sets Approach
Journal of Humanistic Mathematics · 2026-07 · 16 (2) · 4-19
DOI: 10.5642/jhummath.ljjn8905 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Humanistic Mathematics, 2026-07. Verfasst von John Polhill.
Abstract (Originalsprache)
This article presents the story of how one mathematician and father realized his two roles had a significant overlap. More specifically, we revisit the problem of determining the maximum number of cards that can be dealt in the SET ® card game without any matches, 1 which is well known to be equivalent to the problem of determining the size of a maximal cap in the affine space AG (4 , 3) . We present a new approach to the problem by using partial difference sets, a method that is equivalent to using strongly regular graphs with a regular automorphism group. The paper includes several possible avenues for future investigations on how partial difference sets might be used in related problems.
Zitieren
APA
Polhill, J. (2026). The SET Card Game and Partitions into Maximal Caps: A Partial Difference Sets Approach. Journal of Humanistic Mathematics, 16(2), 4-19. https://doi.org/10.5642/jhummath.ljjn8905
Vancouver
Polhill J. The SET Card Game and Partitions into Maximal Caps: A Partial Difference Sets Approach. Journal of Humanistic Mathematics. 2026;16(2):4-19. doi:10.5642/jhummath.ljjn8905
BibTeX
@article{Polhill2026,
author = {Polhill, John},
title = {The SET Card Game and Partitions into Maximal Caps: A Partial Difference Sets Approach},
journal = {Journal of Humanistic Mathematics},
year = {2026},
volume = {16},
number = {2},
pages = {4--19},
doi = {10.5642/jhummath.ljjn8905}
}
EUVIMED