Enumeration of strings in Dyck paths: A bijective approach

DOI10.1016/j.disc.2008.08.005zbMath1202.05007OpenAlexW1979537437WikidataQ114190786 ScholiaQ114190786MaRDI QIDQ1025920

Panagiotis Tsikouras, Aristidis Sapounakis, Ioannis Tasoulas

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.005

zbMATH Keywords

stringsDyck pathsbijectionsbijective approach

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (3)

Counting strings at height \(j\) in Dyck paths ⋮ Nonleft peaks in Dyck paths: a combinatorial approach ⋮ Water capacity of Dyck paths

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some bijections and identities for the Catalan and Fine numbers
• Counting upper interactions in Dyck paths
• Dyck paths with coloured ascents
• An involution on Dyck paths and its consequences
• Dyck path enumeration
• Some statistics on Dyck paths
• A bijection on Dyck paths and its consequences
• A simple and unusual bijection for Dyck paths and its consequences
• The statistic ``number of udu's in Dyck paths
• A bijection on ordered trees and its consequences
• Counting strings in Dyck paths
• Dyck Paths with Peaks Avoiding or Restricted to a Given Set

This page was built for publication: Enumeration of strings in Dyck paths: A bijective approach