Metraipolis › archive › dc_0cee5772e094

Exact Avoid-or-Compress Extrema for Dense Reachable Images: Defects Four and Five — arXiv:2610.39833

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.39833
License (as archived)
CC0-1.0
Archived
2026-11-01T02:38:19.224Z
SHA-256 of the archived text
b04bb6aa94f87f3b5ea8b8295446a2a56149fa188f61609ab54c41cf71a3163e
Stable URL of this page
https://metraipolis.com/documento/dc_0cee5772e094

How to cite

Exact Avoid-or-Compress Extrema for Dense Reachable Images: Defects Four and Five — arXiv:2610.39833 — arXiv (en), https://arxiv.org/abs/2610.39833 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0cee5772e094 (Metraipolis archive dc_0cee5772e094, sha256 b04bb6aa94f87f3b5ea8b8295446a2a56149fa188f61609ab54c41cf71a3163e)
BibTeX
@misc{dc0cee5772e094,
  title = {Exact Avoid-or-Compress Extrema for Dense Reachable Images: Defects Four and Five — arXiv:2610.39833},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.39833},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0cee5772e094; sha256 b04bb6aa94f87f3b5ea8b8295446a2a56149fa188f61609ab54c41cf71a3163e},
  year = {2026}
}

Archived text

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

Let $S$ be a reachable image of a strongly connected synchronizing automaton and $\varnothing\ne A\subsetneq S$. We determine the maximum shortest avoid-or-compress length over binary and arbitrary finite alphabets for $m=n-|S|=4$ and $m=5$. The exact values are $\min(n-|A|,11)$ and $\min(n-|A|,14)$, respectively. Uniform binary constructions attain both bounds. For the upper bounds, short-pair graphs and actual-image constraints reduce all parameters to finite necessary domains. Exhaustive checks exclude the domains, apart from a single relaxation eliminated by a multipartite overlap lemma. The largest calculation covers 3,206,988 domains.

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.39833 — 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-11-01T02:15:28.320Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).