Metraipolis › archive › dc_49ceae5c8e13

Shuffle squares in smooth binary words and the Kolakoski sequence — arXiv:2610.02262

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.02262
License (as archived)
CC0-1.0
Archived
2026-10-06T08:24:19.923Z
SHA-256 of the archived text
5449b0fac711f561fabccf1c0f120f7a641b4d8a528adaf80ac990976f0a39f4
Stable URL of this page
https://metraipolis.com/documento/dc_49ceae5c8e13

How to cite

Shuffle squares in smooth binary words and the Kolakoski sequence — arXiv:2610.02262 — arXiv (en), https://arxiv.org/abs/2610.02262 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49ceae5c8e13 (Metraipolis archive dc_49ceae5c8e13, sha256 5449b0fac711f561fabccf1c0f120f7a641b4d8a528adaf80ac990976f0a39f4)
BibTeX
@misc{dc49ceae5c8e13,
  title = {Shuffle squares in smooth binary words and the Kolakoski sequence — arXiv:2610.02262},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.02262},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49ceae5c8e13; sha256 5449b0fac711f561fabccf1c0f120f7a641b4d8a528adaf80ac990976f0a39f4},
  year = {2026}
}

Archived text

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

A binary word is a shuffle square if its positions can be partitioned into two identical subsequences. A finite word over $\{1,2\}$ is smooth if repeated finite run-length differentiation remains binary until the empty word is reached. This paper proves that every smooth binary word in which both letters have even multiplicity is a shuffle square once its length is at least $18$. There are exactly $34$ exceptions, all of length at most $16$. The infinite part of the proof is a parity-return atom induction: a smooth even-Parikh word factors uniquely into smooth parity atoms, and every such atom has length at most $8$. A finite, independently checkable certificate handles lengths $18$ through $40$. As a consequence, a nonempty prefix of the classical Kolakoski sequence is a shuffle square if and only if both symbols occur an even number of times and its length is not $4$ or $8$. There are infinitely many such prefixes. In fact, the entire infinite Kolakoski sequence can be partitioned into two identical infinite subsequences with monochromatic blocks of uniformly bounded length.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2610.02262 — 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-06T08:18:48.267Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).