Name
Abstract | ||
|---|---|---|
We consider Superset, a lesser-known yet interesting variant of the famous card game Set. Here, players look for Supersets instead of Sets, that is, the symmetric difference of two Sets that intersect in exactly one card. In this paper, we pose questions that have been previously posed for Set and provide answers to them; we also show relations between Set and Superset.For the regular Set deck, which can be identified with F^3_4, we give a proof for the fact that the maximum number of cards that can be on the table without having a Superset is 9. This solves an open question posed by McMahon et al. in 2016. For the deck corresponding to F^3_d, we show that this number is Omega(1.442^d) and O(1.733^d). We also compute probabilities of the presence of a superset in a collection of cards drawn uniformly at random. Finally, we consider the computational complexity of deciding whether a multi-value version of Set or Superset is contained in a given set of cards, and show an FPT-reduction from the problem for Set to that for Superset, implying W[1]-hardness of the problem for Superset. |
Year | Venue | Field |
|---|---|---|
2018 | FUN | Symmetric difference,Discrete mathematics,Subset and superset,Combinatorics,Computer science,Computational complexity theory,The Intersect |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fábio Botler | 1 | 0 | 0.34 |
| Andrés Cristi | 2 | 0 | 0.68 |
| Ruben Hoeksma | 3 | 33 | 8.23 |
| Kevin Schewior | 4 | 37 | 9.79 |
| Andreas Tönnis | 5 | 40 | 3.97 |