Talmudic lattice path counting

DOI10.1016/0097-3165(94)90100-7MaRDI QIDQ1336450zbMATH OpenOpenAlexFDO

Authors Jane Friedman, Ira M. Gessel, Doron Zeilberger

Publication date 22 November 1994

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

Full work available at URL https://doi.org/10.1016/0097-3165(94)90100-7

zbMATH Keywords

countingcycle lemmalattice pathplanar walks

Mathematics Subject Classification ID

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

Review text

Consider all planar walks, with positive unit steps (1,0) and (0,1) from the origin (0,0) to a given point \((a,b)\). Let \(L\) be the line joining the beginning to the end. For \(i= 0,1,\dots, a+ b-1\), let \(W_ i\) be the set of walks with ``exactly \(i\) points above and ``exactly \(a+ b+ 1- i\) points below \(L\). The authors show that it is possible to distribute the points on \(L\) in such a way that the sets \(W_ i\) are equinumerous.

Recommendations

• Counting Lattice Walks in the Plane
• scientific article; zbMATH DE number 4149301
• scientific article; zbMATH DE number 734457
• scientific article; zbMATH DE number 3995721
• Bijections for pairs of non-crossing lattice paths and walks in the plane

Cites work

• A Combinatorial Lemma and Its Application to Probability Theory
• A problem of arrangements
• scientific article; zbMATH DE number 3199765 (Why is no real title available?)

Cited in

(2)

• Lattice walks in \({\mathbf Z}^ d\) and permutations with no long ascending subsequences
• Enumerating minimal length lattice paths

This page was built for publication: Talmudic lattice path counting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1336450)