The Penney’s Game with Group Action
Name
26_2021_564_ReferencePDF.pdf
Size
344.69 KB
Format
Adobe PDF
Checksum (MD5)
baf29e805a2c74bd98f26f098cb1ee08
Author(s)
Li, Sean
Khovanova, Tanya
Date Issued
January 15, 2022
Publisher
Springer International Publishing
Citation
Li, Sean and Khovanova, Tanya. 2022. "The Penney’s Game with Group Action."
Version
Author's final manuscript
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.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00026-021-00564-1
