|
|
|
|
LEADER |
00876 am a22001453u 4500 |
001 |
141866 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Li, Sean
|e author
|
700 |
1 |
0 |
|a Khovanova, Tanya
|e author
|
245 |
0 |
0 |
|a The Penney's Game with Group Action
|
260 |
|
|
|b Springer International Publishing,
|c 2022-04-13T12:58:47Z.
|
856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/141866
|
520 |
|
|
|a 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.
|
546 |
|
|
|a en
|
655 |
7 |
|
|a Article
|