Enumerating and constructing essentially equivalent lattice paths

MaRDI QIDQ2765090zbMATH OpenFDO

Authors Rick Gillman

Publication date 6 June 2002

Published in Geombinatorics (Search for Journal in Brave)

zbMATH Keywords

greedy algorithmindependence numberlattice paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Recommendations

• scientific article; zbMATH DE number 2094512
• On the edge set of graphs of lattice paths
• Even and odd pairs of lattice paths with multiple intersections
• scientific article; zbMATH DE number 5844324
• The research and progress of the enumeration of lattice paths

Cited in

(8)

• Lattice path enumeration by formal schema
• On the edge set of graphs of lattice paths
• scientific article; zbMATH DE number 1498640 (Why is no real title available?)
• scientific article; zbMATH DE number 2094512 (Why is no real title available?)
• scientific article; zbMATH DE number 815885 (Why is no real title available?)
• A new scheme for enumerating connected diagrams on the lattice
• A Combinatorial Bijection between Ordered Trees and Lattice Paths
• k-distinct lattice paths

This page was built for publication: Enumerating and constructing essentially equivalent lattice paths

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