Lattice path enumeration by formal schema
From MaRDI portal
Publication:1197397
DOI10.1016/0196-8858(92)90010-TzbMATH Open0767.05008OpenAlexW2028731145MaRDI QIDQ1197397FDOQ1197397
Authors: Jay R. Goldman, Thomas S. Sundquist 
Publication date: 16 January 1993
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-8858(92)90010-t
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
Formal languages and automata (68Q45) Trees (05C05) Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Chain enumeration and non-crossing partitions
- Combinatorial aspects of continued fractions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal languages and enumeration
- Title not available (Why is that?)
Cited In (6)
- A combinatorial study of the growing altitude elementary paths of the plane lattice Z2
- Title not available (Why is that?)
- The area determined by underdiagonal lattice paths
- The Formal System of Dijkstra and Scholten
- Underdiagonal lattice paths with unrestricted steps
- Context-free grammars, differential operators and formal power series
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)
