Counting SET-free sets

DOI10.1007/S00026-018-0401-5zbMATH Open1396.05009arXiv1604.07811OpenAlexW2964292945MaRDI QIDQ1787968FDOQ1787968

Authors: Nate Harman 

Publication date: 5 October 2018

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: We consider the following counting problem related to the card game SET: How many $k$-element SET-free sets are there in an $n$-dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to this question satisfies two polynomiality conditions.

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

Recommendations

• Game, Set, Math
• The computational complexity of the game of Set and its theoretical applications
• The card game SET.
• The game SET or going fishing
• The Proportion of Comets in the Card Game SET

zbMATH Keywords

representation stabilityFI-modulesadditive combinatoricsrecreational mathematics

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

Cites Work

• An introduction to hyperplane arrangements
• FI-modules over Noetherian rings.
• FI-modules and stability for representations of symmetric groups
• Title not available (Why is that?)
• Weights in Cohomology Groups Arising from Hyperplane Arrangements
• Representation stability in cohomology and asymptotics for families of varieties over finite fields
• The card game SET.
• Title not available (Why is that?)
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Representation stability for families of linear subspace arrangements

Cited In (5)

• \textsc{Superset}: A (super)natural variant of the card game \textsc{Set}
• Finding and Counting MSTD Sets
• Counting set classes with Burnside's lemma
• The computational complexity of the game of Set and its theoretical applications
• The game SET or going fishing

This page was built for publication: Counting SET-free sets

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