Related papers: Generalized Catalan numbers from hypergraphs
Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (u_{n})_{n>=0}=(3,2,3,6,14,36,...): they count "aligned cubic trees" on n internal vertices. Here we give…
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…
We extend the notion of polynomial integration over an arbitrary circle $C$ in the Euclidean geometry over general fields $\mathbb F$ of characteristic zero as a normalized $\mathbb F$-linear functional on $\mathbb{F}\left[\alpha_1,…
A finitization of the Catalan numbers $ C_n $ can be defined as Euler characteristics of an algebraic structure. We conjecture the existence of a $ q $-deformed version of such structure, and provide evidence for the first two non-trivial…
We show that recent determinant evaluations involving Catalan numbers and generalisations thereof have most convenient explanations by combining the Lindstr\"om-Gessel-Viennot theorem on non-intersecting lattice paths with a simple…
We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…
The Catalan numbers are well-known to be the answer to many different counting problems, and so there are many different families of sets whose cardinalities are the Catalan numbers. We show how such a family can be given the structure of a…
The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…
We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of consecutive generalized Catalan numbers and find their values in the closed form.
Catalan words are particular growth-restricted words over the set of non-negative integers, and they represent still another combinatorial class counted by the Catalan numbers. We study the distribution of descents on the sets of Catalan…
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…
It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci…
We define the notion of a Catalan pair (which is a pair of binary relations (S,R) satisfying certain axioms) with the aim of giving a common language to most of the combinatorial interpretations of Catalan numbers. We show, in particular,…
A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…
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 present determinantal representations of the Catalan numbers, k-Fuss-Catalan numbers, and its generalized number. The entries of the normalized Hessenberg matrices are the binomial coefficients that related with the enumeration of…
We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…