arXiv (All)
open access
Subexponential upper bound on the number of rich words
Let $R_q(n)$ denote the number of rich words of length $n$ over a fixed alphabet of size $q\geq2$. It is known that $R_q(n)^{1/n}\to1$. We establish a nonrecursive subexponential upper bound on the number of rich words, with its asymptotic growth quantified in terms of an iterated logarithm. For eve
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Predicting and Repairing Merge Collapse in Large Language Models#1187877
- The Area Asymptotics of $(sn,n)$-Dyck Paths#1217046
- Rarity Determines Minimax Rates of Semantic Entropy From Weak Pairwise Judgments With a Known Channel#1343170
- Gallizismen im Roman „Lotte in Weimar” von Thomas Mann#738356
- Strong $q$-log-convexity of the $d$-Hoggatt polynomials#1118805
Record · ID 1327289
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive