An additive-square-free word over an alphabet of size 6
An additive square over $\mathbb{N}$ is two consecutive nonempty blocks of the same length and same sum. For example, 1423 is an additive square, since 14 and 23 both have length 2 and sum 5. Solving a problem that has been open for more than 50 years, we give an example of an infinite word over a 6-letter subset of N that avoids additive squares.
Authors
- Jeffrey O. Shallit (ORCID: https://orcid.org/0000-0003-1197-3820)
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-18
- DOI
- https://doi.org/10.48550/arxiv.2611.24441
- Primary Topic
- semigroups and automata theory
- Type
- preprint