Related papers: Counting peaks at height k in a Dyck path
Paths that consist of up-steps of one unit and down-steps of $k$ units, being bounded below by a horizontal line $-t$, behave like $t+1$ ordered tuples of $k$-Dyck paths, provided that $t\le k$. We describe the general case, allowing $t$…
In the Stanley lattice defined on Dyck paths of size $n$, cover relations are obtained by replacing a valley $DU$ by a peak $UD$. We investigate a greedy version of this lattice, first introduced by Chenevi\`ere, where cover relations…
We consider a variation of Dyck paths, where additionally to steps $(1,1)$ and $(1,-1)$ down-steps $(1,-j)$, for $j\ge2$ are allowed. We give credits to Emeric Deutsch for that. The enumeration of such objects living in a strip is…
The degree of symmetry of a combinatorial object, such as a lattice path, is a measure of how symmetric the object is. It typically ranges from zero, if the object is completely asymmetric, to its size, if it is completely symmetric. We…
Motzkin paths with air pockets (MAP) of the first kind are defined as a generalization of Dyck paths with air pockets. They are lattice paths in $\mathbb{N}^2$ starting at the origin made of steps $U=(1,1)$, $D_k=(1,-k)$, $k\geq 1$ and…
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…
Skew Dyck paths are like Dyck paths, but an additional south-west step $(-1,-1)$ is allowed, provided that the path does not intersect itself. Lattice paths with catastrophes can drop from any level to the origin in just one step. We…
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all…
Bargraphs are a special class of convex polyominoes. They can be identified with lattice paths with unit steps north, east, and south that start at the origin, end on the $x$-axis, and stay strictly above the $x$-axis everywhere except at…
We derive the length and area generating function of planar height-restricted forward-moving discrete paths of increments +1, 0, or -1 with arbitrary starting and ending points, the so-called Motzkin meanders, and the more general…
Given a graph $G(V, E)$ and a positive integer $k$ ($k \geq 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an…
We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…
In analyzing balanced parentheses, we consider a group of related variables in Dyck paths. In the four-dimensional space, the Dyck triangle is constructed, i.e. an integer lattice with Dyck paths.
In this paper we study the number of humps (peaks) in Dyck, Motzkin and Schr\"{o}der paths. Recently A. Regev noticed that the number of peaks in all Dyck paths of order $n$ is one half of the number of super Dyck paths of order $n$. He…
Dispersed Dyck paths are Dyck paths, with possible flat steps on level 0. We revisit and augment questions about them from the Encyclopedia of Integer Sequences, in a systematic way that uses generating functions and the kernel method.
In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths which can be described by means of two equivalent strategies.…
We exhibit a bijection between central Delannoy $n$-paths, that is, lattice paths from the origin to $(n,n)$ with steps $E=(1,0), \,N=(0,1),\,D=(1,1)$ and the lattice paths from the origin to $(n+1,n)$ where the only restriction on the…
We enumerate interlaced pairs of parking functions whose underlying Dyck path has a bounded height. We obtain an explicit formula for this enumeration in the form of a quotient of analogs of Chebicheff polynomials having coefficients in the…
Dyck paths (also balanced brackets and Dyck words) are among the most heavily studied Catalan families. This paper is a continuation of [2, 3, 4]. In the paper we are dealing with the numbering of Dyck paths, with the resulting numbers, the…
A Schr\"oder path is a lattice path from $(0,0)$ to $(2n,0)$ with steps $(1,1)$, $(1,-1)$ and $(2,0)$ that never goes below the $x-$axis. A small Schr\"{o}der path is a Schr\"{o}der path with no $(2,0)$ steps on the $x-$axis. In this paper,…