Words with Factor Complexity $2n+1$ and Minimal Critical Exponent
The Electronic Journal of Combinatorics · 07.08.2026 · 33 (3)
DOI: 10.37236/14527 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Electronic Journal of Combinatorics, online erschienen am 07.08.2026. Verfasst von James D Currie.
Abstract (Originalsprache)
Let the word ${\mathbf G}$ be the fixed point of the morphism $\gamma$ sending $0$ to $01$, $1$ to $2$, and $2$ to $02$. In 2019, Shallit and Shur showed that ${\mathbf G}$ has factor complexity $2n+1$. They also showed that ${\mathbf G}$ has critical exponent $\mu=2+\frac{1}{\lambda^2-1}= 2.4808726\cdots$, where $\lambda=1.7548777$ is the real zero of $x^3-2x^2+x-1=0$. They conjectured that this was the least possible critical exponent among the words with factor complexity $2n+1$. We confirm their conjecture. We anticipate that our method, including an intricate case analysis by computer, will have wider application.
Zitieren
APA
Currie, J. D. (2026). Words with Factor Complexity $2n+1$ and Minimal Critical Exponent. The Electronic Journal of Combinatorics, 33(3). https://doi.org/10.37236/14527
Vancouver
Currie JD. Words with Factor Complexity $2n+1$ and Minimal Critical Exponent. The Electronic Journal of Combinatorics. 2026;33(3). doi:10.37236/14527
BibTeX
@article{Currie2026,
author = {Currie, James D},
title = {Words with Factor Complexity $2n+1$ and Minimal Critical Exponent},
journal = {The Electronic Journal of Combinatorics},
year = {2026},
volume = {33},
number = {3},
doi = {10.37236/14527}
}
EUVIMED