| dc.contributor.author | Li, Sean | |
| dc.contributor.author | Khovanova, Tanya | |
| dc.date.accessioned | 2022-04-13T12:58:47Z | |
| dc.date.available | 2022-04-13T12:58:47Z | |
| dc.date.issued | 2022-01-15 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/141866 | |
| dc.description.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. | en_US |
| dc.publisher | Springer International Publishing | en_US |
| dc.relation.isversionof | https://doi.org/10.1007/s00026-021-00564-1 | en_US |
| dc.rights | 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. | en_US |
| dc.source | Springer International Publishing | en_US |
| dc.title | The Penney’s Game with Group Action | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Li, Sean and Khovanova, Tanya. 2022. "The Penney’s Game with Group Action." | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2022-04-13T03:25:13Z | |
| dc.language.rfc3066 | en | |
| dc.rights.holder | The Author(s), under exclusive licence to Springer Nature Switzerland AG | |
| dspace.embargo.terms | Y | |
| dspace.date.submission | 2022-04-13T03:25:13Z | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
