Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points

MaRDI QIDQ456355zbMATH OpenFDO

Authors Michael Z. Spivey

Publication date 24 October 2012

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p24

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

lattice pathbijection

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• scientific article; zbMATH DE number 4027482
• Enumerating a class of lattice paths
• Enumerating lattice paths to hyperplanes
• Counting pairs of lattice paths by intersections
• scientific article; zbMATH DE number 1058046
• scientific article; zbMATH DE number 2247202
• Lattice path enumeration
• scientific article; zbMATH DE number 1036186

Cited in

(9)

• Counting lattice paths by crossings and major index. I: The corner-flipping bijections
• Koroljuk's formula for counting lattice paths revisited
• Optimal play for multiple lottery wins
• scientific article; zbMATH DE number 464791 (Why is no real title available?)
• Lattice paths not touching a given boundary
• Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
• Multi-robot adversarial patrolling strategies via lattice paths
• scientific article; zbMATH DE number 4077210 (Why is no real title available?)
• scientific article; zbMATH DE number 4027482 (Why is no real title available?)

This page was built for publication: Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points

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