  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.
