Cyril Banderier ; Bernhard Gittenberger
-
Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the Area
dmtcs:3481 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2006,
DMTCS Proceedings vol. AG, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities
-
https://doi.org/10.46298/dmtcs.3481
Analytic Combinatorics of Lattice Paths: Enumeration and Asymptotics for the AreaArticle
Authors: Cyril Banderier 1; Bernhard Gittenberger 2
NULL##NULL
Cyril Banderier;Bernhard Gittenberger
1 Laboratoire d'Informatique de Paris-Nord
2 Institut für Diskrete Mathematik und Geometrie [Wien]
This paper tackles the enumeration and asymptotics of the area below directed lattice paths (walks on $\mathbb{N}$ with a finite set of jumps). It is a nice surprise (obtained via the "kernel method'') that the generating functions of the moments of the area are algebraic functions, expressible as symmetric functions in terms of the roots of the kernel. For a large class of walks, we give full asymptotics for the average area of excursions ("discrete'' reflected Brownian bridge) and meanders ("discrete'' reflected Brownian motion). We show that drift is not playing any role in the first case. We also generalise previous works related to the number of points below a path and to the area between a path and a line of rational slope.
Helmut Prodinger, 2020, Enumeration of S-Motzkin paths from left to right and from right to left: a kernel method approach, Pure mathematics and applications, 29, 1, pp. 28-38, 10.1515/puma-2015-0039, https://doi.org/10.1515/puma-2015-0039.