Related papers: Catalan triangle numbers and binomial coefficients
The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…
In this paper, we introduce three new classes of binomial sums involving Fibonacci (Lucas) numbers and weighted binomial coefficients.
The Catalan transform of a sequence (a_{n})_{n>=0} is the sequence (b_{n})_{n>=0} with b_{n} = Sum[k/(2n-k) (2n-k)-choose-(n-k) a_{k},k=0..n]. Here we show that the Catalan transform of the Catalan numbers has a simple interpretation: it…
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…
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 q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of…
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.
Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…
In type A, the q,t-Fuss-Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group. We generalize this construction to (finite) complex reflection groups and, based on computer experiments, we…
The $q$-analog of Kostant's weight multiplicity formula is an alternating sum over a finite group, known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. This formula, when evaluated at $q=1$, gives the…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…
On an elliptic surface or threefold, Catalan numbers appear when one tries to compute the autoequivalence group action on the Bridgeland stability manifold. We explain why this happens by identifying a class of equations in the Chow ring of…
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…
We prove two conjectures on sums of products of Catalan triangle numbers, which were originally conjectured by Miana, Ohtsuka, and Romero [Discrete Math. 340 (2017), 2388--2397]. The first one is proved by using Zeilberger's algorithm, and…
Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements of the finitely generated free monoids. In this paper we…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
In this study, we introduce the generalized Gaussian third-order Jacobsthal numbers with arbitrary initial values and discuss two particular cases, namely, Gaussian third-order Jacobsthal and Gaussian modified third-order Jacobsthal…
Using generating functions and some trivial bijections, we show in this paper that the binomial coefficients count the set of (123,132) and (123,213)-avoiding permutations according to the number of crossings. We also define a q-tableau of…
We present several types of ordinary generating functions involving central binomial coefficients, harmonic numbers, and odd harmonic numbers. Our results complement those of Boyadzhiev from 2012 and Chen from 2016. Based on these…
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…