Metraipolis › archive › dc_fbdc4e0b2497
The Tight Upper Bound on the Number of Distinct Squares in Circular Words — arXiv:2609.32084
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.32084
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T23:26:51.699Z
- SHA-256 of the archived text
7bcb64f4a7289f338f14700a3e7a3eddb2b02bf04c514fa8226ad4acb89f4a58- Stable URL of this page
https://metraipolis.com/documento/dc_fbdc4e0b2497
How to cite
The Tight Upper Bound on the Number of Distinct Squares in Circular Words — arXiv:2609.32084 — arXiv (en), https://arxiv.org/abs/2609.32084 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fbdc4e0b2497 (Metraipolis archive dc_fbdc4e0b2497, sha256 7bcb64f4a7289f338f14700a3e7a3eddb2b02bf04c514fa8226ad4acb89f4a58)
BibTeX
@misc{dcfbdc4e0b2497,
title = {The Tight Upper Bound on the Number of Distinct Squares in Circular Words — arXiv:2609.32084},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.32084},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fbdc4e0b2497; sha256 7bcb64f4a7289f338f14700a3e7a3eddb2b02bf04c514fa8226ad4acb89f4a58},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.32084. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A square is a word $xx$, where $x$ is nonempty. We show that a circular word of length $n$ contains at most $\lfloor 3n/2 \rfloor$ distinct squares of length at most $n$. The proof combines known results relating squares to circuits in Rauzy graphs. The coefficient $3/2$ agrees with the known lower bound. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in math.CO). Categorie arXiv: Combinatorics (math.CO) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.32084 — 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-07T23:08:10.751Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).