Counting pairs of lattice paths by intersections

DOI10.1006/JCTA.1996.0047zbMath0853.05003arXivmath/9409212OpenAlexW2000134821MaRDI QIDQ1914007

Walter Shur, Ira M. Gessel, Lily Yen, Herbert S. Wilf, Wayne Goddard

Publication date: 9 July 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9409212

zbMATH Keywords

generating functionlattice pathsintersectionsdouble sumbinomial sumenumerating pairs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (6)

Counting lattice paths by crossings and major index I: the corner-flipping bijections ⋮ On pairs of lattice paths with a given number of intersections ⋮ Dyck Words, Lattice Paths, and Abelian Borders ⋮ Unnamed Item ⋮ A history and a survey of lattice path enumeration ⋮ Neighborhood monotonicity, the extended Zermelo model, and symmetric knockout tournaments

This page was built for publication: Counting pairs of lattice paths by intersections