Lattice path enumeration by formal schema
From MaRDI portal
Publication:1197397
Recommendations
- Lattice path enumeration
- Enumerating a class of lattice paths
- Enumerating and constructing essentially equivalent lattice paths
- scientific article; zbMATH DE number 1058045
- Enumerating lattice paths to hyperplanes
- Enumerating minimal length lattice paths
- scientific article; zbMATH DE number 2247202
- A probabilistic method for lattice path enumeration
- Refined lattice path enumeration and combinatorial reciprocity
- Lattices of lattice paths
Cites work
- scientific article; zbMATH DE number 3821741 (Why is no real title available?)
- scientific article; zbMATH DE number 3957110 (Why is no real title available?)
- scientific article; zbMATH DE number 3681764 (Why is no real title available?)
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- scientific article; zbMATH DE number 3758344 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Chain enumeration and non-crossing partitions
- Combinatorial aspects of continued fractions
- Formal languages and enumeration
Cited in
(6)- Context-free grammars, differential operators and formal power series
- The Formal System of Dijkstra and Scholten
- The area determined by underdiagonal lattice paths
- Underdiagonal lattice paths with unrestricted steps
- scientific article; zbMATH DE number 2010461 (Why is no real title available?)
- A combinatorial study of the growing altitude elementary paths of the plane lattice Z2
This page was built for publication: Lattice path enumeration by formal schema
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197397)