On a counting conjecture for binary rich words
Source: hexagonmath.org/abs/2611.00167v1
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00167
curl -X POST /api/v1/records/hexagon/2611.00167/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00167/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'