Enumerating minimal length lattice paths

MaRDI QIDQ4637142zbMATH OpenFDO

Authors Jackson Evoniuk, Steven Klee, Van Magnan

Publication date 18 April 2018

Full work available at URL https://cs.uwaterloo.ca/journals/JIS/VOL21/Klee/klee2.html

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

Catalan numbergenerating functionlattice path enumerationMotzkin number

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7199610
• Counting Lattice Walks in the Plane
• Lattice paths and submonoids of \(\mathbb{Z}^2\)
• Publication:4723770
• Talmudic lattice path counting

Cites work

• Lattice path enumeration

Cited in

(7)

• scientific article; zbMATH DE number 227225 (Why is no real title available?)
• Lattice paths and submonoids of \(\mathbb{Z}^2\)
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Alternating paths and cycles of minimum length
• scientific article; zbMATH DE number 7199610 (Why is no real title available?)
• Counting Lattice Walks in the Plane
• Lattice path enumeration by formal schema

Describes a project that uses

Uses Software

• SageMath
• OEIS

This page was built for publication: Enumerating minimal length lattice paths

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