Related papers: A new statistic on Dyck paths for counting 3-dimen…
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…
It is well known that the Catalan number C_n counts dissections of a regular (n+2)-gon into triangles. Here we count such dissections by number of triangles that contain two sides of the polygon among their three edges, leading to a…
Raised $k$-Dyck paths are a generalization of $k$-Dyck paths that may both begin and end at a nonzero height. In this paper, we develop closed formulas for the number of raised $k$-Dyck paths from $(0,\alpha)$ to $(\ell,\beta)$ for all…
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.…
Given a sequence of integers b = (b_0,b_1,b_2,...) one gives a Dyck path P of length 2n the weight wt(P) = b_{h_1} b_{h_2} ... b_{h_n}, where h_i is the height of the ith ascent of P. The corresponding weighted Catalan number is C_n^b =…
Generalizing previous results, we introduce and study a new statistic on words, that we call rectangle capacity. For two fixed positive integers $r$ and $s$, this statistic counts the number of occurrences of a rectangle of size $r\times s$…
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.
The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…
An and/or tree is usually a binary plane tree, with internal nodes labelled by logical connectives, and with leaves labelled by literals chosen in a fixed set of k variables and their negations. In the present paper, we introduce the first…
Path pairs are a modification of parallelogram polyominoes that provide yet another combinatorial interpretation of the Catalan numbers. More generally, the number of path pairs of length $n$ and distance $\delta$ corresponds to the…
We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence $(1, 4, 4^2, 4^3, ...)$ which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial…
Catalan numbers arise in many enumerative contexts as the counting sequence of combinatorial structures. In this work, we consider natural Markov chains on some of the realizations of the Catalan sequence. While our main result is in…
Dyck paths are among the most heavily studied Catalan families. This paper is a continuation of [2]. In the paper we are dealing with the numbering of Dyck paths, the terms of the OEIS sequence A036991 or Dyck numbers. We consider triplets…
Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational…
The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…
We show bijectively that Dyck paths with all peaks at odd height are counted by the Motzkin numbers and Dyck paths with all peaks at even height are counted by the Riordan numbers.
Rational Dyck paths are the rational generalization of classical Dyck paths. They play an important role in Catalan combinatorics, and have multiple applications in algebra and geometry. Two statistics over rational Dyck paths called run…
In this work, we define flattened Catalan words as Catalan words whose runs of weak ascents have leading terms that appear in weakly increasing order. We provide generating functions, formulas, and asymptotic expressions for the number of…
Dyck paths are among the most heavily studied Catalan families. In the paper we are dealing with the minimal numbering of Dyck paths, with the resulting numbers, the terms of the OEIS sequence A036991, which we have called Dyck numbers. We…
We provide new interpretations for a subset of Raney numbers, involving threshold sequences and Motzkin-like paths with long up and down steps. Given three integers n, k, l such that n >= 1, k >= 2 and 0 <= l <= k-2, a (k,l)-threshold…