Related papers: Anchored Dyck Paths
We discuss the combinatorics of the decorated Dyck paths appearing in the Delta conjecture framework of Haglund, Remmel and Wilson (2015) and Zabrocki (2016), by introducing two new statistics, bounce and bounce'. We then provide plethystic…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We…
We give a simple explanation why the stationary state of the 1D TASEP model with open boundaries is related to the Catalan numbers. Our construction is based on planar binary trees and provides a combinatorial solution of the stationary…
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…
In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
We give a $q$-enumeration of circular Dyck paths, which is a superset of the classical Dyck paths enumerated by the Catalan numbers. These objects have recently been studied by Alexandersson and Panova. Furthermore, we show that this…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
Descents of odd length in Dyck paths are discussed, taking care of some variations. The approach is based on generating functions and the kernel method and augments relations about them from the Encyclopedia of Integer Sequences, that were…
Pappe, Paul, and Schilling introduced two combinatorial statistics, depth and ddinv, associated with classical Dyck paths, and proved that the distributions of (area, depth) and (dinv, ddinv) are $q,t$-symmetric by constructing an…
A 3-dimensional Catalan word is a word on three letters so that the subword on any two letters is a Dyck path. For a given Dyck path $D$, a recently defined statistic counts the number of Catalan words with the property that any subword on…
We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…
We give bijective results between several variants of lattice paths of length $2n$ (or $2n-2$) and integer compositions of n, all enumerated by the seemingly innocuous formula $4^{n-1}$. These associations lead us to make new connections…
Three-dimensional Catalan numbers are a variant of the classical (bidimensional) Catalan numbers, that count, among other interesting objects, the standard Young tableaux of shape (n,n,n). In this paper, we present a structural bijection…
We introduce the abstract notion of a necklical set in order to describe a functorial combinatorial model of the path fibration over the geometric realization of a path connected simplicial set. In particular, to any path connected…
We find a bijection between bi-banded paths and peak-counting paths, applying to two classes of lattice paths including Dyck paths. Thus we find a new interpretation of Narayana numbers as coefficients of weight polynomials enumerating…
The Fuss-Catalan numbers are a generalization of the Catalan numbers. They enumerate a large class of objects and in particular m-Dyck paths and m+1-ary trees. Recently, F. Bergeron defined an analogue for generic m of the Tamari order on…