Asymptotic analysis of $k$-noncrossing matchings

Details Asymptotic analysis of $k$-noncrossing matchings Asymptotic analysis of $k$-noncrossing matchings

2008-03-06

arxiv.org/abs/0803.0848v1

Mathematics

Combinatorics

19 pages and 1 figure

Scientific paper

In this paper we study $k$-noncrossing matchings. A $k$-noncrossing matching is a labeled graph with vertex set $\{1,...,2n\}$ arranged in increasing order in a horizontal line and vertex-degree 1. The $n$ arcs are drawn in the upper halfplane subject to the condition that there exist no $k$ arcs that mutually intersect. We derive: (a) for arbitrary $k$, an asymptotic approximation of the exponential generating function of $k$-noncrossing matchings $F_k(z)$. (b) the asymptotic formula for the number of $k$-noncrossing matchings $f_{k}(n) \sim c_k n^{-((k-1)^2+(k-1)/2)} (2(k-1))^{2n}$ for some $c_k>0$.

Affiliated with

Also associated with

No associations

Rating

Asymptotic analysis of $k$-noncrossing matchings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic analysis of $k$-noncrossing matchings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic analysis of $k$-noncrossing matchings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13744