Related papers: Identities involving Narayana polynomials and Cata…
In this paper we give combinatorial proofs of some well known identities and obtain some generalizations. We give a visual proof of a result of Chapman and Costas-Santos regarding the determinant of sum of matrices. Also we find a new…
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n,k,m}$ is the number of Dyck paths of semilength $n$ with $k$…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We derive some Fibonacci and Lucas identities which contain inverse binomial coefficients. Extension of the results to the general Horadam sequence is possible, in some cases.
In this paper we introduce the polynomials $\{d_n^{(r)}(x)\}$ and $\{D_n^{(r)}(x)\}$ given by $d_n^{(r)}(x)=\sum_{k=0}^n\binom{x+r+k}k\binom{x-r}{n-k} \ (n\ge 0)$, $D_0^{(r)}(x)=1,\ D_1^{(r)}(x)=x$ and…
We use the inversion of coefficient arrays to define dual polynomials to the Fibonacci and Catalan-Fibonacci polynomials, and we explore the properties of these new polynomials sequences. Many of the arrays involved are Riordan arrays.…
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,…
The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…
We provide an involution proof of a Catalan-tangent number identity arising from the study of peak algebra that was found by Aliniaeifard and Li. In the course, we find a new combinatorial identity for the tangent numbers $T_{2n+1}$: $$…
I use polynomial analogue of the Jacobi triple product identity together with the Eisenstein formula for the Legendre symbol modulo 3 . to prove six identities involving the $q$-binomial coefficients. These identities are then extended to…
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kur\c{s}ung\"oz. We also present some related polynomial and $q$-series…
In this paper, we study Catalan numbers which can be represented by the p-adic integral on Zp and we investigate some properties and formulae related to Catalan numbers and special numbers.
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
We prove a recursive identity involving formal iterated logarithms and formal iterated exponentials. These iterated logarithms and exponentials appear in a natural extension of the logarithmic formal calculus used in the study of…
We derive various weighted summation identities, including binomial and double binomial identities, for Tribonacci numbers. Our results contain some previously known results as special cases.
We examine an identity originally stated in Ramanujan's ``lost notebook'' and first proven algebraically by Andrews and combinatorially by Kim. We give two independent combinatorial proofs and interpretations of this identity, which also…
The purpose of this paper is to give some new identities for the Bernoulli, the Euler and the Genocchi numbers and polynomials.
A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be…