Date of Submission

Spring 2024

Academic Program

Mathematics

Project Advisor 1

Stefan Méndez-Diez

Abstract/Artist's Statement

This project introduces the concept of share strings and how they can be used to figure out maximal cap sizes for different decks of the card game EvenQuads. We prove that all caps must map to a share string with respect to a basis and that if no share strings exist for cap size k in a given dimension d, then the maximal cap size of that dimension M (d) must be less than k. We prove the maximal cap sizes up to dimension 7 and show that there are at most 8 possible share strings for 19-caps of dimension 8.

Open Access Agreement

Open Access

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License.

Download

This work is protected by a Creative Commons license. Any use not permitted under that license is prohibited.

Included in

Mathematics Commons

Share

COinS