The Penney’s Game with Group Action

Author(s)
Li, Sean; Khovanova, Tanya
Thumbnail
Download26_2021_564_ReferencePDF.pdf (344.6Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Abstract Consider equipping an alphabet $$\mathcal {A}$$ A with a group action which partitions the set of words into equivalence classes which we call patterns. We answer standard questions for Penney’s game on patterns and show non-transitivity for the game on patterns as the length of the pattern tends to infinity. We also analyze bounds on the pattern-based Conway leading number and expected wait time, and further explore the game under the cyclic and symmetric group actions.
Date issued
2022-01-15
URI
https://hdl.handle.net/1721.1/141866
Department
Massachusetts Institute of Technology. Department of Mathematics
Publisher
Springer International Publishing
Citation
Li, Sean and Khovanova, Tanya. 2022. "The Penney’s Game with Group Action."
Version: Author's final manuscript
Collections