Year: 2026
Type: preprint
Abstract: A square is a word of the form $xx$ for a non-empty word $x$. Brlek and Li [Comb. Theory, 2025] proved that the number of distinct squares in a word $w$ of length $n$ is at most $n - σ$, where $σ$ is the number of letters used in $w$. The same authors extended the proof to lower the upper bound to $n - Θ(\log n)$ in [WORDS, 2023]. In this paper, we present another proof to obtain the same bound $n - Θ(\log n)$.
Source: arXiv (Cornell University)
Authors: Tomita, Eitatsu, I, Tomohiro
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7129063345
Cites:
Cited by:
Related to: