Enumeration of walks reaching a line - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Enumeration of walks reaching a line


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$.
Fichier principal
Vignette du fichier
dmAE0177.pdf (194.83 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01184438 , version 1 (17-08-2015)



Philippe Nadeau. Enumeration of walks reaching a line. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.401-406, ⟨10.46298/dmtcs.3449⟩. ⟨hal-01184438⟩
62 View
404 Download



Gmail Facebook Twitter LinkedIn More