The card game SET.

DOI10.1007/BF02984846zbMath1109.91013OpenAlexW2086068247MaRDI QIDQ1411672

Benjamin Lent Davis, Diane MacLagan

Publication date: 29 October 2003

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02984846

zbMATH Keywords

Fourier analysisfinite affine and projective spaces

Mathematics Subject Classification ID

Games in extensive form (91A18) Recreational mathematics (00A08)

Related Items (16)

Unnamed Item ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ De-Bruijn sequences and magic ⋮ The Joy of SET ⋮ Algebra From Geometry in the Card Game SET ⋮ UFOs in the game SET: Looking for Airplanes and Spaceships ⋮ Exponentially larger affine and projective caps ⋮ How many cards should you lay out in a game of \textit{EvenQuads}: a detailed study of caps in \(\mathrm{AG}(n, 2)\) ⋮ Misère Tic-Tac-Toe on Projective Binary Steiner Triple Systems ⋮ Partitions of \(\mathrm{AG}(4, 3)\) into maximal caps ⋮ The cap set problem and standard diagrams ⋮ Caps and progression-free sets in \(\mathbb{Z}_m^n\) ⋮ Counting SET-free sets ⋮ Maximal caps in \(\mathrm{AG}(6,3)\). ⋮ The Proportion of Comets in the Card Game SET ⋮ Demicaps in \(\mathrm{AG}(4,3)\) and maximal cap partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner triple systems with doubly transitive automorphism groups: A corollary to the classification theorem for finite simple groups
• Homogeneous designs and geometric lattices
• Steiner triple systems with a doubly transitive automorphism group
• Caps and codes
• Maximal three-independent subsets of \(\{0,1,2\}^ n\)
• The classification of the largest caps in AG(5, 3)
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• Automorphisms of Steiner Triple Systems
• Bounds on affine caps

This page was built for publication: The card game SET.