Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
The electronic journal of combinatorics, Tome 19 (2012) no. 3
We give bijective proofs that, when combined with one of the combinatorial proofs of the general ballot formula, constitute a combinatorial argument yielding the number of lattice paths from $(0,0)$ to $(n,rn)$ that touch or cross the diagonal $y = rx$ at exactly $k$ lattice points. This enumeration partitions all lattice paths from $(0,0)$ to $(n,rn)$. While the resulting formula can be derived using results from Niederhausen, the bijections and combinatorial proof are new.
DOI :
10.37236/2477
Classification :
05A15, 05A19
Mots-clés : lattice path, bijection
Mots-clés : lattice path, bijection
Affiliations des auteurs :
Michael Z. Spivey  1
@article{10_37236_2477,
author = {Michael Z. Spivey},
title = {Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {3},
doi = {10.37236/2477},
zbl = {1253.05020},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2477/}
}
TY - JOUR AU - Michael Z. Spivey TI - Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points JO - The electronic journal of combinatorics PY - 2012 VL - 19 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.37236/2477/ DO - 10.37236/2477 ID - 10_37236_2477 ER -
Michael Z. Spivey. Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points. The electronic journal of combinatorics, Tome 19 (2012) no. 3. doi: 10.37236/2477
Cité par Sources :