相关论文: On proofs of certain combinatorial identities

We combine the powerful method of Wilf-Zeilberger pairs with systematic theory of multiple zeta values to prove a large number of series identities due to Z.W. Sun, many of them have been long standing conjectures.

While there are many identities involving the Euler and Bernoulli numbers, they are usually proved analytically or inductively. We prove two identities involving Euler and Bernoulli numbers with combinatorial reasoning via up-down…

In the paper, with the aid of the series expansions of the square or cubic of the arcsine function, the authors establish several possibly new combinatorial identities containing the ratio of two central binomial coefficients which are…

In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…

This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…

We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…

Osburn and Schneider derived several combinatorial identities involving harmonic numbers using the computer programm Sigma. Here, they are derived by partial fraction decomposition and creative telescoping.

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

Recently N.Jing discovered a certain combinatorial identity from validity of the Serre relations in some vertex representations of quantum Kac-Moody algebras. We generalize this identity, in particular, extending it from polynomials to…

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 give a proof of two identities involving binomial sums at infinity conjectured by Z-W Sun. In order to prove these identities, we use a recently presented method i.e. we view the series as specializations of generating series and derive…

Recently, Andrews and EI Bachraoui obtained several iden tities on two-colored partitions. While solving open problems they posed, Chen and Zhou derived a number of identities using analytic methods and asked for combinatorial proofs. In…

Let $F$ be a binary form with integer coefficients, non-zero discriminant and degree $d$ with $d$ at least $3$. Let $R_F(Z)$ denote the number of integers of absolute value at most $Z$ which are represented by $F$. We prove that there is a…

Using a probabilistic approach, we derive some interesting combinatorial identities involving gamma and beta functions. These results generalize certain well-known combinatorial identities involving binomial coefficients and special…

Using the WZ method we present simpler proofs of Koecher's, Leshchiner's and Bailey-Borwein-Bradley's identities for generating functions of the sequences $\{\zeta(2n+2)\}_{n\ge 0}, \{\zeta(2n+3)\}_{n\ge 0}.$ By the same method we give…

Let $f(m,c)=\sum_{k=0}^{\infty} (km+1)^{k-1} c^k e^{-c(km+1)/m} / (m^kk!)$. For any positive integer $m$ and positive real $c$, the identity $f(m,c)=f(1,c)^{1/m}$ arises in the random graph theory. In this paper, we present two elementary…

A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of q elements, where q is a power of a prime p > 3. His proof required deep algebro-geometric techniques, and he…

Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…

We use Zeilberger's algorithm for proving some identities of Ramanujan-type via $_2F_1$ evaluations.

Wilf-Zeilberger pairs are fundamental in the algorithmic theory of Wilf and Zeilberger for computer-generated proofs of combinatorial identities. Wilf-Zeilberger forms are their high-dimensional generalizations, which can be used for…