arXiv (All)
open access
On the limiting distribution of the number of improper edges for random trees
Improper edges were introduced by Shor to refine Cayley's formula for rooted labeled trees. Zeng established a connection between Shor's refinement and the Ramanujan polynomials. Let $\mathscr{T}_n$ denote the set of rooted labeled trees on $[n]=\{1,\ldots,n\}$. We prove that the number of improper
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
- PageRank on Lubotzky--Phillips--Sarnak graphs#1154732
- A Walk From Free Probability to Matrix Discrepancy III: Higher Rank Kadison-Singer and Spectrally Thin Trees#1035687
- Lower Bounds for Moments of $L$-functions#927459
- Diffuse Gaussian Truncation For Deterministic Approximate Counting#926923
- Hausdorff dimension of images and graphs of some random complex series#925944
Record · ID 1061950
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