Related papers: A note on log-convexity of q-Catalan numbers

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 give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…

We define new generalizations of (q,t)-Catalan numbers applying nabla operator on k-Schur functions indexed by column partitions. In some special cases, we give a combinatorial interpretation of these numbers using configurations of Dyck…

In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…

We show that the Catalan-Schroeder convolution recurrences and their higher order generalizations can be solved using Riordan arrays and the Catalan numbers. We investigate the Hankel transforms of many of the recurrence solutions, and…

Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last…

We first establish the result that the Narayana polynomials can be represented as the integrals of the Legendre polynomials. Then we represent the Catalan numbers in terms of the Narayana polynomials by three different identities. We give…

Let $f:\mathbb{Z}\longrightarrow \{ \times \cdot\}$ be a function such that $f(a) = \cdot$ for all except finitely for many $a \in \mathbb{Z}$. We define a set $\flat f$ of non-intersecting arc (or cap) diagrams satisfying certain…

Carlitz has introduced q-analogues of the Bernoulli numbers around 1950. We obtain a representation of these q-Bernoulli numbers (and some shifted version) as moments of some orthogonal polynomials. This also gives factorisations of Hankel…

In this paper, we investigate a specific class of $q$-polynomial sequences that serve as a $q$-analogue of the classical Appell sequences. This framework offers an elegant approach to revisiting classical results by Carlitz and, more…

Let $P_{n,k}$ be the number of permutations $\pi$ on [n]={1, 2,..., n} such that the length of the longest increasing subsequences of $\pi$ equals k, and let $M_{2n, k}$ be the number of matchings on [2n] with crossing number k. Define…

We relate the mixed Hodge structure on the cohomology of open positroid varieties (in particular, their Betti numbers over $\mathbb{C}$ and point counts over $\mathbb{F}_q$) to Khovanov--Rozansky homology of associated links. We deduce that…

Catalan-Daehee numbers and polynomials, generating functions of which can be expressed as p-adic Volkenborn integrals on Zp, were studied previously. The aim of this paper is to introduce q-analogues of the catalan-Daehee numbers and…

We describe one interpretation of the q-Catalan numbers in frameworks of random matrix theory and weighted partitions of the set of integers.

$q$-Kaplansky numbers were considered by Chen and Rota. We find that $q$-Kaplansky numbers are connected to the symmetric differences of Gaussian polynomials introduced by Reiner and Stanton. Based on the work of Reiner and Stanton, we…

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

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…

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

The super Catalan numbers $T(m,n)=(2m)!(2n)!/2m!n!(m+n)!$ are integers which generalize the Catalan numbers. With the exception of a few values of $m$, no combinatorial interpretation in known for $T(m,n)$. We give a weighted interpretation…

Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…