arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.4642math.CO
收藏

B型Weyl室中行走次数的渐近性

Asymptotics for the number of walks in a Weyl chamber of type B

Thomas Feierl

摘要:

我们认为格行走在$\R^k$局限于区域$0<x_1<x_2...<x_k$与固定(但任意)的起点和终点。行走需要是“可反射的”,也就是说,我们假设路径的数量可以使用反射原理来计数。主要结果是渐近公式的总行走长度$n$与一个固定或自由端点的一般类的行走作为$n$趋于无穷大。作为应用,我们发现了当$n$趋于无穷大时,集合$\{1,2,...,n\}$上$k$-非交叉纠缠图的个数的渐近性,以及在随机转弯模型和锁步模型中受壁约束的$k$-恶性步行者的个数的渐近性.所有这些物体的渐近性要么只在某些特殊情况下才被知道,要么只被部分确定,要么完全未知。

英文摘要:

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using the reflection principle. The main results are asymptotic formulas for the total number of walks of length $n$ with either a fixed or a free end point for a general class of walks as $n$ tends to infinity. As applications, we find the asymptotics for the number of $k$-non-crossing tangled diagrams on the set $\{1,2,...,n\}$ as $n$ tends to infinity, and asymptotics for the number of $k$-vicious walkers subject to a wall restriction in the random turns model as well as in the lock step model. Asymptotics for all of these objects were either known only for certain special cases, or have only been partially determined or were completely unknown.

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

↑