Solution of an enumerative problem connected with lattice paths
From MaRDI portal
Publication:1157327
DOI10.1016/S0195-6698(81)80020-0zbMath0471.05004OpenAlexW2047598337MaRDI QIDQ1157327
Germain Kreweras, Heinrich Niederhausen
Publication date: 1981
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80020-0
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Paths and cycles (05C38)
Related Items (8)
A probabilistic method for lattice path enumeration ⋮ Combinatorial mappings of exclusion processes ⋮ Rényi entropy of the totally asymmetric exclusion process ⋮ A history and a survey of lattice path enumeration ⋮ Promotion of Kreweras words ⋮ Promotion of Kreweras words ⋮ Random walks in octants, and related structures ⋮ The ballot problem with three candidates
Cites Work
This page was built for publication: Solution of an enumerative problem connected with lattice paths
