Skip to Main content Skip to Navigation
Conference papers

Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract)

Thomas Feierl 1
1 ALGORITHMS - Algorithms
Inria Paris-Rocquencourt
Abstract : We consider lattice walks in $\mathbb{R}^k$ confined to the region $0 < x_1 < x_2 \ldots < 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 result is an asymptotic formula for the total number of walks of length $n$ with fixed but arbitrary starting and end point for a general class of walks as the number $n$ of steps tends to infinity. As applications, we find the asymptotics for the number of $k$-non-crossing tangled diagrams on the set $\{1,2, \ldots,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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/hal-01185600
Contributor : Coordination Episciences Iam <>
Submitted on : Thursday, August 20, 2015 - 4:34:00 PM
Last modification on : Tuesday, May 14, 2019 - 1:09:18 AM
Long-term archiving on: : Wednesday, April 26, 2017 - 10:08:57 AM

File

dmAM0113.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01185600, version 1

Collections

Citation

Thomas Feierl. Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract). 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.175-188. ⟨hal-01185600⟩

Share

Metrics

Record views

216

Files downloads

643