Search arXivSearch

arXiv · 2608.24425

Rigorous Asymptotic Analysis of 3-Noncrossing Skeleton Diagrams

Abstract

We give a complete rigorous asymptotic analysis of the generating functions of 3-noncrossing skeleton matchings and canonical 3-noncrossing skeleton diagrams. Let $F_3$ be the ordinary generating function of 3-noncrossing matchings, and let $S(y)=\sum_{n\geq 0}S(n)y^n$ be determined by $S(zF_3(z)^2)=F_3(z)$. The proof is deliberately ordered to avoid circularity. First, Lagrange inversion, a Stieltjes representation of $F_3$, exact cut-boundary estimates, and a moving horizontal Hankel contour give $S(n)\sim 24(πA^5)^{-1}σ^{-n}n^{-5}$ independently of any $Δ$-analyticity of $S$. This estimate supplies boundary regularity of $S$ and $S'$. We then prove a global biholomorphic inversion theorem, continuation across every nonprincipal point of the convergence circle, and a logarithmically perturbed sectorial inverse theorem. A complete disk-chain and monodromy argument yields a single-valued continuation to a standard $Δ$-domain. At the principal singularity, $S(y)=Q_4(u)-(πA^5)^{-1}u^4\log u+O(u^5(1+|\log u|))$, where $u=1-y/σ$. Finally, the canonical composition $S_3^{[4]}(z)=(1-z)(S(\vartheta(z))-1-\vartheta(z))$ is shown to be $Δ$-analytic at its unique dominant singularity $η=0.49340718057613087519\ldots$, and $[z^n]S_3^{[4]}(z)\sim 7892.16205625817\ldots n^{-5}η^{-n}$. The argument retains the methods and detailed estimates of the original proofs while closing the analytic gaps in the earlier dissertation treatment.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yangyang Zhao. 2026-08-25. Rigorous Asymptotic Analysis of 3-Noncrossing Skeleton Diagrams. https://arxiv.org/abs/2608.24425

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO