Counting SET-free sets

Preprint English OPEN
Harman, Nate (2016)
  • Subject: Mathematics - Combinatorics

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.
  • References (6)

    [CEF1] T. Church, J. S. Ellenberg, B. Farb, FI-modules and stability for representations of symmetric groups, Duke Math. J. 164 No. 9 (2015).

    [CEF2] T. Church, J. S. Ellenberg, and B. Farb, Representation stability in cohomology and asymptotics for families of varieties over finite fields, Contemporary Mathematics 620 (2014), 1-54

    [CEFN] T. Church, J. S. Ellenberg, B. Farb, R. Nagpal, FI-modules over Noetherian rings, Geometry and Topology 18 (2014)

    [Ga] N. Gadish, Representation stability for families of linear subspace arrangements, (2016) arXiv:1603.08547

    [Ki] M. Kim, Weights in cohomology groups arising from hyperplane arrangements, Proc. Amer. Math. Soc. 120 (1994) 3, 697-703.

    [OT] P. Orlik, H. Terao, Arrangements of hyperplanes, Grundlehren der Mathematischen Wissenschaften 300, Springer-Verlag, Berlin, (1992).

  • Metrics
    No metrics available
Share - Bookmark