Dyck paths with a first return decomposition constrained by height

DOI10.1016/j.disc.2018.03.002zbMath1384.05096OpenAlexW2794091054MaRDI QIDQ1744745

Armen Petrossian, Sergey Kirgizov, Jean-Luc Baril

Publication date: 19 April 2018

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

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

zbMATH Keywords

heightenumerationstatisticspeakDyck and Motzkin pathsfirst return decomposition

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Lattice Paths With a First Return Decomposition Constrained by the Maximal Height of a Pattern, Unnamed Item, Grand Dyck paths with air pockets, Pattern distributions in Dyck paths with a first return decomposition constrained by height, Enumerating several aspects of non-decreasing Dyck paths

Uses Software

• OEIS

Cites Work

• The height of two types of generalised Motzkin paths
• Equivalence classes of Dyck paths modulo some statistics
• Some enumerations on non-decreasing Dyck paths
• Dyck path enumeration
• Two combinatorial statistics on Dyck paths
• Some statistics on Dyck paths
• Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
• The statistic ``number of udu's in Dyck paths
• Counting strings in Dyck paths
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item