Date of Submission
Spring 2024
Academic Program
Mathematics
Project Advisor 1
Robert McGrail
Abstract/Artist's Statement
This project explores the $k$-cover conjecture for the game Quads. The conjecture states that for all $k\in\mathbb{N}$, there exists a $k$-cover if and only if $k = 2$ or $k = \frac{2^n-2}{6}$ for some odd $n\in\mathbb{N}$ with $n>1$. We show that if $k$ is one of these values, then there exists a $k$-cover. We discuss partial results in the other direction, i.e., that these are the only values of $k$ for which there exists a $k$-cover.
Open Access Agreement
Open Access
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Recommended Citation
Rose-Levine, Daniel Melvin, "Results on $k$-Covers in the Game Quads" (2024). Senior Projects Spring 2024. 252.
https://digitalcommons.bard.edu/senproj_s2024/252
This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.