Subexponential upper bound on the number of rich words

Josef Rukavicka

Let $R_q(n)$ denote the number of rich words of length $n$ over a fixed alphabet of size $q\ge 2$. It is known that $R_q(n{)}^{1/n}\to 1$. We establish a nonrecursive subexponential u…