# On Number of Rich Words

## TL;DR

This paper proves that the number of rich words of length n over any alphabet grows subexponentially, refining understanding of their combinatorial complexity and extending previous bounds.

## Contribution

It establishes that the growth rate of rich words is subexponential for any alphabet size, generalizing prior results for binary alphabets.

## Key findings

- The number of rich words grows subexponentially with length.
- The limit of the nth root of the count of rich words is 1 for any alphabet.
- This confirms the complexity of rich words is lower than exponential.

## Abstract

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted $R_n(q)$. For binary alphabet, Rubinchik and Shur deduced that ${R_n(2)}\leq c 1.605^n $ for some constant $c$. We prove that $\lim\limits_{n\rightarrow \infty }\sqrt[n]{R_n(q)}=1$ for any $q$, i.e. $R_n(q)$ has a subexponential growth on any alphabet.