arXiv (All)
open access
On how many Fibonacci words is the Plancherel measure concentrated
On the set $\mathbb{YF}_n$ of words in $1$ and $2$ with digit sum $n$, we consider the probability distribution $μ_P$, corresponding to the Plancherel measure on paths in the Young--Fibonacci graph. We study the asymptotics as $n$ grows of the entropy of the distribution $μ_P$ and of the minimum num
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
- A Central Limit Theorem for Coprime Pair Counts in Randomly Translated Disks#1083682
- The Erdős similarity problem for null sequences with adjacent ratios bounded below#1248729
- Farthest-cell triplet entropy: high-dimensional shell limits and hyperbolic curvature amplification#924251
- Farthest-cell triplet entropy: high-dimensional shell limits and hyperbolic curvature amplification#920020
- A threshold for full packing dimension of Hölder images of sets and measures#998838
Record · ID 1215683
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