On pairs of non-crossing generalized Dyck paths

DOI10.1016/0378-3758(93)90005-QzbMath0771.05011OpenAlexW2010980166WikidataQ127323765 ScholiaQ127323765MaRDI QIDQ1209653

Jacques Labelle

Publication date: 16 May 1993

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(93)90005-q

zbMATH Keywords

generating functionDyck pathlattice pathnon-crossing Dyck paths

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items

Some statistics on Dyck paths ⋮ A history and a survey of lattice path enumeration ⋮ On three and four vicious walkers ⋮ Bijections on \(r\)-Shi and \(r\)-Catalan arrangements ⋮ \(U\)-parking functions and \((p,q)\)-parking functions ⋮ Pairs of noncrossing free Dyck paths and noncrossing partitions ⋮ Kontsevich-Witten model from \(2+1\) gravity: new exact combinatorial solution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dyck paths of knight moves
• Generalized Dyck paths
• Binomial determinants, paths, and hook length formulae
• A symmetric variation of a distribution of Kreweras and Poupard
• Formal languages and enumeration
• Algebraic languages and polyominoes enumeration
• A Noncommutative Generalization and q-Analog of the Lagrange Inversion Formula
• On the number of certain lattice polygons