Counting SET-free sets
From MaRDI portal
Publication:1787968
Abstract: We consider the following counting problem related to the card game SET: How many -element SET-free sets are there in an -dimensional SET deck? Through a series of algebraic reformulations and reinterpretations, we show the answer to this question satisfies two polynomiality conditions.
Recommendations
Cites work
- An introduction to hyperplane arrangements
- FI-modules and stability for representations of symmetric groups
- FI-modules over Noetherian rings.
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 3354142 (Why is no real title available?)
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Representation stability for families of linear subspace arrangements
- Representation stability in cohomology and asymptotics for families of varieties over finite fields
- The card game SET.
- Weights in Cohomology Groups Arising from Hyperplane Arrangements
Cited in
(5)
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)