Metraipolis › archive › dc_1ff85f511c10

Purely Periodic Three-move Subtraction Games — arXiv:2609.05358

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05358
License (as archived)
CC0-1.0
Archived
2026-10-16T23:21:20.416Z
SHA-256 of the archived text
5361096cda7a0f72bc281612b47a16af1310006dc7267c5057bf91a9abc038f6
Stable URL of this page
https://metraipolis.com/documento/dc_1ff85f511c10

How to cite

Purely Periodic Three-move Subtraction Games — arXiv:2609.05358 — arXiv (en), https://arxiv.org/abs/2609.05358 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_1ff85f511c10 (Metraipolis archive dc_1ff85f511c10, sha256 5361096cda7a0f72bc281612b47a16af1310006dc7267c5057bf91a9abc038f6)
BibTeX
@misc{dc1ff85f511c10,
  title = {Purely Periodic Three-move Subtraction Games — arXiv:2609.05358},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05358},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_1ff85f511c10; sha256 5361096cda7a0f72bc281612b47a16af1310006dc7267c5057bf91a9abc038f6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05358. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We determine the full Sprague-Grundy sequence and its least period for a class of three-move subtraction games whose sequences are periodic from the start. Write the move set as $S=\{a,b,c\}$, with $0<a<b<c$ and $\gcd(a,b,c)=1$. The case $a=1$ is known and is summarized separately. For $a\ge2$ and $c\ne a+b$, we give three explicit sufficient tests for pure periodicity, associated with the candidate periods $a+b$, $c+a$, and $c+b$. For fixed $a,b$, the tests depend only on $c\bmod(a+b)$ and are computed from the losing positions of the two-move game $\{a,b\}$. Whenever a test succeeds, we give the losing positions in closed form, reconstruct the remaining values, and prove that the least period is the smallest candidate whose test succeeds. The construction shows how the added move $c$ modifies the two-move pattern to form a repeating block. We also give a uniform formulation of the known additive case $c=a+b$. For $a\ge2$, we conjecture that the tests cover every purely periodic non-additive game. In this range, when $c\ge2(a+b)$, we prove necessity for purely periodic games with least period at most $a+b$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-07 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.05358 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T23:03:13.269Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-07?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).