{"id":"hexagon/2611.00167","pdf":"https://hexagonmath.org/pdf/2611.00167v1","url":"https://hexagonmath.org/abs/2611.00167v1","tags":["msc:68R15","enumeration","formal verification","palindromes","rich words"],"score":0,"title":"On a counting conjecture for binary rich words","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Max Glass"],"reviews":0,"subject":"math.CO","summary":"Let $R_2(n)$ denote the number of binary rich words of length $n$. We prove that \\[ \\limsup_{n\\to\\infty}\\frac{\\log R_2(n)}{\\sqrt n\\log n}=\\infty. \\] Consequently, $R_2(n)$ is not $O(n^{C\\sqrt n})$ for any fixed $C>0$, disproving the conjectured upper bound $O((n/g(n))^{\\sqrt n})$ with $g(n)\\to\\infty$. The proof combines independent permutation families through an ordered concatenation construction and a binary gap encoding.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":0,"published":"2026-11-06","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}