Geodesic
Enumeration of walks reaching a line
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

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

We enumerate walks in the plane $\mathbb{R}^2$, with steps East and North, that stop as soon as they reach a given line; these walks are counted according to the distance of the line to the origin, and we study the asymptotic behavior when the line has a fixed slope and moves away from the origin. When the line has a rational slope, we study a more general class of walks, and give exact as well as asymptotic enumerative results; for this, we define a nice bijection from our walks to words of a rational language. For a general slope, asymptotic results are obtained; in this case, the method employed leads us to find asymptotic results for a wider class of walks in $\mathbb{R}^m$. 
@article{DMTCS_2005_special_250_a58,
     author = {Nadeau, Philippe},
     title = {Enumeration of walks reaching a line},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3449},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3449/}
}
TY  - JOUR
AU  - Nadeau, Philippe
TI  - Enumeration of walks reaching a line
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3449/
DO  - 10.46298/dmtcs.3449
LA  - en
ID  - DMTCS_2005_special_250_a58
ER  - 
%0 Journal Article
%A Nadeau, Philippe
%T Enumeration of walks reaching a line
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3449/
%R 10.46298/dmtcs.3449
%G en
%F DMTCS_2005_special_250_a58
Nadeau, Philippe. Enumeration of walks reaching a line. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3449. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3449/

Cité par Sources :