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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Church T., Ellenberg J.S., Farb B.: FI-modules and stability for representations of symmetric groups. Duke Math. J. 164(9), 1833–1910 (2015)
Church, T., Ellenberg, J.S., Farb, B.: Representation stability in cohomology and asymptotics for families of varieties over finite fields. In: Tillmann, U., Galatius, S., Sinha, D. (eds.) Algebraic Topology: Applications and New Directions. Contemp. Math. Vol. 620, pp. 1–54. Amer. Math. Soc., Providence, RI (2014)
Church T., Ellenberg J.S., Farb B., Nagpal R.: FI-modules over Noetherian rings. Geom. Topology 18(5), 2951–2984 (2014)
Davis B.L., Maclagan D.: The card game set. Math. Intelligencer 25(3), 33–40 (2003)
Ellenberg J.S., Gijswijt D.: On large subsets of \({\mathbb{F}_{q}^{n}}\) with no three-term arithmetic progression. Ann. of Math. (2) 185(1), 339–343 (2017)
Gadish N.: Representation stability for families of linear subspace arrangements. Adv. Math. 322, 341–377 (2017)
Kim M.: Weights in cohomology groups arising from hyperplane arrangements. Proc. Amer. Math. Soc. 120(3), 697–703 (1994)
Orlik, P., Terao, H.: Arrangements of Hyperplanes. Grundlehren Math. Wiss., Vol. 300. Springer-Verlag, Berlin (1992)
Pellegrino G.: Sul massimo ordine delle calotte in S 4,3. Matematich 25, 149–157 (1971)
Stanley, R.P.: An introduction to hyperplane arrangements. In: Miller, E., Reiner, V., Sturmfels, B. (eds.) Geometric Combinatorics. IAS/Park City Math. Ser., Vol. 13, pp. 389–496. Amer. Math. Soc., Providence, RI (2007)
Acknowledgments
Thanks to Pavel Etingof, Sam Hopkins, and Liz McMahon for helpful conversations. The author was partially supported by the National Science Foundation Graduate Research Fellowship under Grant No. 1122374.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Harman, N. Counting SET-Free Sets. Ann. Comb. 22, 575–582 (2018). https://doi.org/10.1007/s00026-018-0401-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-018-0401-5