Related papers: Anchored Dyck Paths
We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their…
Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…
We consider Dyck paths having height at most two with some constraints on the number of consecutive valleys at height one which must be followed by a suitable number of valleys at height zero. We prove that they are enumerated by so-called…
This note provide bijective proofs of two combinatorial identities involving generalized Catalan number $C_{m,5}(n)={m\over 5n+m}{5n+m\choose n}$ recently proposed by Sun.
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…
A recurrence relation of the generating function of the dimer model of Fibonacci type gives a functional relation for formal power series associated to lattice paths such as a Dyck, Motzkin and Schr\"oder path. In this paper, we generalize…
We investigate the quotient ring $R$ of the ring of formal power series $\Q[[x_1,x_2,...]]$ over the closure of the ideal generated by non-constant quasi-\break symmetric functions. We show that a Hilbert basis of the quotient is naturally…
We obtain a differential equation for the enumeration of the path length of general increasing trees. By using differential operators and their combinatorial interpretation we give a bijective proof of a version of Fa\`a di Bruno formula,…
The first half of this paper is largely expository, wherein we present a systematic combinatorial approach to the theory of polynomial (semi)invariants and multilinear invariants of several vectors and covectors, for the classical groups.…
We give a geometric realization of the polyhedra governed by the structure of associative algebras with co-inner products, or more precisely, governed by directed planar trees. Our explicit realization of these polyhedra, which include the…
We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…
The Catalan numbers (C_n)_{n >= 0} = 1,1,2,5,14,42,... form one of the most venerable sequences in combinatorics. They have many combinatorial interpretations, from counting bracketings of products in non-associative algebra to counting…
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$. L. Shapiro [9] found the Chung-Feller properties for the Motzkin paths.…
By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…
Motivated by representation theory we exhibit an interior structure to Catalan sequences and many generalisations thereof. Certain of these coincide with well known (but heretofore isolated) structures. The remainder are new.
We study certain types of ideals in the standard Borel subalgebra of an untwisted affine Lie algebra. We classify these ideals in terms of the root combinatorics and give an explicit formula for the number of such ideals in type $A$. The…
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these problems.
We study the global dimension of Nakayama algebras. In the case of linear Nakayama algebras, which are in canonical bijection to Dyck paths, we show that the global dimension has the same distribution as the height of Dyck paths. For cyclic…
In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…
In this paper we determine the parity of some sequences which are related to Catalan numbers. Also we introduce a combinatorical object called, \Catalan tree", and discuss its properties.