相关论文: On proofs of certain combinatorial identities

We survey combinatorial interpretations of some dozen identities for the double factorial such as, for instance, (2n-2)!! + Sum_{k=2}^{n} (2n-1)!!(2k-4)!!/(2k-1)!! = (2n-1)!!. Our methods are mostly bijective.

In the present paper combinatorial identities involving q-dual sequences or polynomials with coefficients q-dual sequences are derived. Further, combinatorial identities for q-binomial coefficients(Gaussian coefficients), q-Stirling numbers…

In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…

In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…

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…

We prove some combinatorial identities using the Polya urn and the closely related Hoppe urn.

An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.

In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…

We utilize the Wilf-Zeilberger (WZ) method to establish congruences related to truncated Ramanujan-type series. By constructing hypergeometric terms $f(k, a, b, \ldots)$ with Gosper-summable differences and selecting appropriate parameters,…

We give a combinatorial identity related to the Franel numbers involving the sum of fourth power of binomial coefficients. Furthermore, investigating in J. Mikic's proof of the first Strehl Identity, we provide a combinatorial proof of this…

A binomial coefficient identity due to Zhi-Wei Sun is the subject of half a dozen recent papers that prove it by various analytic techniques and establish a generalization. Here we give a simple proof that uses weight-reversing involutions…

We translate Uchimura's identity for the divisor function and whose generalizations into combinatorics of partitions, and give a combinatorial proof of them. As a by-product of their proofs, we obtain some combinatorial results.

Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.

In this paper, we prove a new identity for values of the Hurwitz zeta function which contains as particular cases Koecher's identity for odd zeta values, the Bailey-Borwein-Bradley identity for even zeta values and many other interesting…

We provide a short proof of an algebraic identity. For integers $n\ge 2$ and variables $x,y,z$, it represents $(x^n+y^n-z^n)$ as a value of the quadratic form $\mathcal A^2+\mathcal B^2-\mathcal C^2$ after multiplication by an explicit…

This paper argues that automated proofs of identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. For two analogues of Saalsch\"utz' summation formula in the…

In this paper we prove that there exist infinitely many integers which can be expressed as a sum of four cubes of polynomials with integer coefficients. We give several identities that express the integers 1 and 2 as a sum of four cubes of…

In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer…