Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)

DOI10.37236/11218OpenAlexW4319722755MaRDI QIDQ2684899

Sarah J. Selkirk, Clemens Heuberger, Stephan G. Wagner

Publication date: 17 February 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.14023

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (2)

Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Dyck tilings
• Locally oriented noncrossing trees
• Bijections for a class of labeled plane trees
• Staircase tilings and \(k\)-Catalan structures
• Catalan numbers, their generalization, and their uses
• On the enumeration and generation of generalized Dyck words
• Raney numbers, threshold sequences and Motzkin-like paths
• On the sweep map for \(\vec{k}\)-Dyck paths
• The kernel method for lattice paths below a line of rational slope
• A Course in Enumeration
• Generalized Catalan Numbers and the Enumeration of Planar Embeddings
• Lagrange inversion
• Down-step statistics in generalized Dyck paths

This page was built for publication: Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)