Enumerating minimal length lattice paths

zbMATH Open1384.05020MaRDI QIDQ4637142FDOQ4637142

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

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

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

zbMATH Keywords

Catalan numbergenerating functionlattice path enumerationMotzkin number

Mathematics Subject Classification ID

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

Cites Work

• Lattice path enumeration

Cited In (7)

• Lattice paths and submonoids of \(\mathbb{Z}^2\)
• Lattice path enumeration by formal schema
• Counting Lattice Walks in the Plane
• Title not available (Why is that?)
• Combinatorial Algorithms for Listing Paths in Minimal Change Order
• Title not available (Why is that?)
• Alternating paths and cycles of minimum length

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)