Counting SET-free sets

From MaRDI portal
Publication:1787968




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.









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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787968)