# Lattice paths with a first return decomposition constrained by the maximal height of a pattern

@article{Baril2021LatticePW,
title={Lattice paths with a first return decomposition constrained by the maximal height of a pattern},
author={Jean-Luc Baril and Sergey Kirgizov},
journal={ArXiv},
year={2021},
volume={abs/2110.02831}
}
• Published 6 October 2021
• Computer Science, Mathematics
• ArXiv
We consider the system of equations Ak(x) = p(x)Ak−1(x)(q(x) + ∑ k i=0 Ai(x)) for k > r+ 1 where Ai(x), 0 6 i 6 r, are some given functions and show how to obtain a close form for A(x) = ∑ k>0 Ak(x). We apply this general result to the enumeration of certain subsets of Dyck, Motzkin, skew Dyck, and skew Motzkin paths, defined recursively according to the first return decomposition with a monotonically non-increasing condition relative to the maximal ordinate reached by an occurrence of a given… Expand

#### References

SHOWING 1-10 OF 16 REFERENCES
Motzkin Paths With a Restricted First Return Decomposition
• Computer Science, Mathematics
• Integers
• 2019
This work provides enumerative results by giving bivariate generating functions with respect to the length and another parameter, and constructs one-to-one correspondences with several restricted classes of ordered trees. Expand
Counting peaks at height k in a Dyck path
A Dyck path is a lattice path in the plane integer lattice $\mathbb{Z}\times\mathbb{Z}$ consisting of steps (1,1) and (1,-1), which never passes below the x-axis. A peak at height k on a Dyck path isExpand
Dyck paths with a first return decomposition constrained by height
• Computer Science, Mathematics
• Discret. Math.
• 2018
The enumeration of Dyck paths having a first return decomposition with special properties based on a height constraint is studied and a constructive bijection is given between these objects and Motzkin paths. Expand
Enumerating several aspects of non-decreasing Dyck paths
• Computer Science, Mathematics
• Discret. Math.
• 2019
Enumerative results and some statistics of several aspects of non-decreasing Dyck paths are given, including the number of pyramids at a fixed level that the paths of a given length have, and how many of the non-primitive paths can be expressed as a product of primitive paths. Expand
Skew Motzkin paths
In this paper, we study the class S of skew Motzkin paths, i.e., of those lattice paths that are in the first quadrat, which begin at the origin, end on the x-axis, consist of up steps U = (1, 1),Expand
Dyck paths and restricted permutations
• Computer Science, Mathematics
• Discret. Appl. Math.
• 2006
This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321) and Sn (231),Expand
Peaks and Valleys in Motzkin Paths
• Mathematics
• 2010
Abstract A Motzkin path is a non-negative lattice path in N2 starting at the origin, where only three types of steps are allowed: the diagonal up step (1, 1) called u, the diagonal down step (1, −1)Expand
Combinatorics of Set Partitions
Introduction Historical Overview and Earliest Results Timeline of Research for Set Partitions A More Detailed Book Basic Tools of the Book Sequences Solving Recurrence Relations Generating FunctionsExpand
Statistics on Dyck Paths
In this paper we consider several statistics on the set of Dyck paths. Enumeration of Dyck paths according to length and various other parameters has been studied in several papers. However, theExpand
Some statistics on Dyck paths
• Mathematics
• 2002
We study some statistics related to Dyck paths, whose explicit formulas are obtained by means of the Lagrange Inversion Theorem. There are five such statistics and one of them is well-known and owedExpand