Words with factor somplexity $2n+1$ and minimal critical exponent
By: James D. Currie
Potential Business Impact:
Finds patterns in words that are very hard to break.
We show that words with factor complexity 2n+1 have critical exponent at least $\mu$, where $\mu=2+\frac{1}{\lambda^2-1}= 2.4808726\cdots$, where $\lambda=1.7548777$ is the real zero of $x^3-2x+x-1=0$. This confirms a conjecture of Shallit and Shur.
Similar Papers
A number-theoretic conjecture implying faster algorithms for polynomial factorization and integer factorization
Data Structures and Algorithms
Makes computers factor numbers much faster.
Subexponential upper bound on the number of rich words
Combinatorics
Finds a way to count special word patterns.
Low complexity binary words avoiding $(5/2)^+$-powers
Combinatorics
Finds patterns in endless word lists.