Counting SET-free sets

DOI10.1007/s00026-018-0401-5zbMath1396.05009arXiv1604.07811OpenAlexW2964292945MaRDI QIDQ1787968

Nate Harman

Publication date: 5 October 2018

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

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

zbMATH Keywords

recreational mathematicsadditive combinatoricsrepresentation stabilityFI-modules

Mathematics Subject Classification ID

Asymptotic enumeration (05A16)

Cites Work

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

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