5 problems

Baranwal–Shallit's conjecture. No other binary rich sequence has a smaller critical exponent than $2+\frac{\sqrt{2}}{2}$. This conjecture concerns the minimum possible critical exp…

Limit conjecture. The repetition thresholds of rich words satisfy

Guo–Shallit–Shur asymptotic conjecture. The number of binary rich words satisfies

Let $r(n)$ be the maximum length of a rich square-free word over an alphabet of size $n$, and let $w_n$ be the recursively constructed rich square-free word over an alphabet of siz…

Let $r(n)$ be the maximum length of a rich square-free word over an alphabet of size $n$, and let $w_n$ be the recursively constructed rich square-free word described in the articl…