Counting SET-free sets
Combinatorics
2016-04-27 v1
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.
Cite
@article{arxiv.1604.07811,
title = {Counting SET-free sets},
author = {Nate Harman},
journal= {arXiv preprint arXiv:1604.07811},
year = {2016}
}
Comments
8 pages, largely expository