Metraipolis › archive › dc_7919017f1963
Shuffle Squares in Differentiable Words — arXiv:2610.07828
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07828
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:11.242Z
- SHA-256 of the archived text
6413aafb5d9bf4009e94ddad697fceda0980a27f97a1fb297ef5a6fbc70a42a0- Stable URL of this page
https://metraipolis.com/documento/dc_7919017f1963
How to cite
Shuffle Squares in Differentiable Words — arXiv:2610.07828 — arXiv (en), https://arxiv.org/abs/2610.07828 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7919017f1963 (Metraipolis archive dc_7919017f1963, sha256 6413aafb5d9bf4009e94ddad697fceda0980a27f97a1fb297ef5a6fbc70a42a0)
BibTeX
@misc{dc7919017f1963,
title = {Shuffle Squares in Differentiable Words — arXiv:2610.07828},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07828},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7919017f1963; sha256 6413aafb5d9bf4009e94ddad697fceda0980a27f97a1fb297ef5a6fbc70a42a0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07828. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Experiments on binary run-length differentiability lead to sharp computer-assisted criteria for shuffle squares. Every $C^3$-word of length greater than $16$ is a shuffle square exactly when both letter multiplicities are even. All $34$ nonempty even-Parikh exceptions are smooth and persist in every higher differentiability class. For $C^2$ the sharp threshold is $48$, with $212$ nonempty exceptions. At level $C^1$ no global parity threshold exists, but every even-Parikh non-shuffle-square of length at least $36$ has proper nonempty shuffle-square prefixes and suffixes. Exactly $230$ nonempty even-Parikh $C^1$-words have no nonempty shuffle-square prefix. The full tree avoiding such prefixes eventually consists of $422$ periodic rays. Consequently, a nonempty Kolakoski prefix is a shuffle square exactly when both multiplicities are even, apart from lengths $4$ and $8$. We also characterize classes of morphisms reflecting shuffle squares. For doubly binary words, we determine the exact deletion distance and largest twins, and prove sharp bounds for single local repairs. Exact recurrences, residual-state checks, and separate Python programs make the finite computations reproducible. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO) ; Formal Languages and Automata Theory (cs.FL). Pagina del lavoro: https://arxiv.org/abs/2610.07828 — 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-07T11:22:09.550Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).