Metraipolis › archive › dc_2e126c5aa720
The compress-with-another threshold of Szykuła's Figure 3 family — arXiv:2610.07044
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07044
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:53:27.459Z
- SHA-256 of the archived text
10893207da5cb8f6361c07408d35554d1d0ac9e541aecbafc6e9bf00caf5c70c- Stable URL of this page
https://metraipolis.com/documento/dc_2e126c5aa720
How to cite
The compress-with-another threshold of Szykuła's Figure 3 family — arXiv:2610.07044 — arXiv (en), https://arxiv.org/abs/2610.07044 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e126c5aa720 (Metraipolis archive dc_2e126c5aa720, sha256 10893207da5cb8f6361c07408d35554d1d0ac9e541aecbafc6e9bf00caf5c70c)
BibTeX
@misc{dc2e126c5aa720,
title = {The compress-with-another threshold of Szykuła's Figure 3 family — arXiv:2610.07044},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07044},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e126c5aa720; sha256 10893207da5cb8f6361c07408d35554d1d0ac9e541aecbafc6e9bf00caf5c70c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07044. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give a self-contained pair-automaton proof of the exact compress-with-another threshold of the corrected Figure 3 family from a recent survey of open problems in synchronizing automata. For every $p \geq 3$, the automaton has $n = 3p$ states and $\mu(q_0) = 4p = 4n/3$. The word $(ba)^p(ab)^p$ attains this value. Two entrance potentials and an excluded region yield the lower bound, with the endpoint exception at $p = 3$ treated explicitly. A separate reset construction proves $\operatorname{rt}(A_p) \leq 3p^2 + 4p - 1$ for every parameter. Reproducible computations verify the transition and entrance identities; the all-parameter results follow from the explicit proofs.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.07044 — 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.578Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).