Lattice Paths With a First Return Decomposition Constrained by the Maximal Height of a Pattern

DOI10.47443/dml.2021.0108OpenAlexW3201898848MaRDI QIDQ5051419

Sergey Kirgizov, Jean-Luc Baril

Publication date: 23 November 2022

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

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

zbMATH Keywords

heightenumerationstatisticspatternDyck and Motzkin pathsfirst return decomposition

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Combinatorics in computer science (68R05)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dyck path enumeration
• Some statistics on Dyck paths
• Dyck paths with a first return decomposition constrained by height
• Enumerating several aspects of non-decreasing Dyck paths
• Congruences for Catalan and Motzkin numbers and related sequences
• Dyck paths and restricted permutations
• Skew Motzkin paths
• Peaks and Valleys in Motzkin Paths
• Combinatorics of Set Partitions

This page was built for publication: Lattice Paths With a First Return Decomposition Constrained by the Maximal Height of a Pattern