Geodesic
Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract)
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2010_special_258_a37,
     author = {Feierl, Thomas},
     title = {Asymptotics for {Walks} in a {Weyl} chamber of {Type} $B$ (extended abstract)},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)},
     year = {2010},
     doi = {10.46298/dmtcs.2801},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2801/}
}
TY  - JOUR
AU  - Feierl, Thomas
TI  - Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract)
JO  - Discrete mathematics & theoretical computer science
PY  - 2010
VL  - DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2801/
DO  - 10.46298/dmtcs.2801
LA  - en
ID  - DMTCS_2010_special_258_a37
ER  - 
%0 Journal Article
%A Feierl, Thomas
%T Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract)
%J Discrete mathematics & theoretical computer science
%D 2010
%V DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2801/
%R 10.46298/dmtcs.2801
%G en
%F DMTCS_2010_special_258_a37
Feierl, Thomas. Asymptotics for Walks in a Weyl chamber of Type $B$ (extended abstract). Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), DMTCS Proceedings vol. AM, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10) (2010). doi : 10.46298/dmtcs.2801. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2801/

Cité par Sources :