arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0802.3491math.CO
收藏

$k$ -不相交缠结图的有效计数和渐近性

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

William Y. C. Chen, Jing Qin, Christian M. Reidys, Doron Zeilberger

摘要:

在本文中,我们列举了$k$ -非交叉缠结图。缠结图是一个标号图,其顶点是$1,...,n$,度为$\le 2$,并且在水平线上以递增的顺序排列。它的弧是在上半平面中画的,带有交叉和嵌套的特殊概念。我们的主要结果是对某些$c_k>0$给出了$k$ -不相交缠结图$T_{k}(n) \sim c_k n^{-((k-1)^2+(k-1)/2)} (4(k-1)^2+2(k-1)+1)^n$个数的渐近公式。

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑