Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams

Details Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams

2008-02-24

arxiv.org/abs/0802.3491v1

Mathematics

Combinatorics

9 pages and 2 figures

Scientific paper

In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper halfplane with a particular notion of crossings and nestings. Our main result is the asymptotic formula for the number of $k$-noncrossing tangled-diagrams $T_{k}(n) \sim c_k n^{-((k-1)^2+(k-1)/2)} (4(k-1)^2+2(k-1)+1)^n$ for some $c_k>0$.

Affiliated with

Also associated with

No associations

Rating

Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams 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 Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Counting and Asymptotics of $k$-noncrossing tangled-diagrams will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-427122