Related papers: On a Combinatorial Identity

In this note we present a method for obtaining a wide class of combinatorial identities. We give several examples, in particular, based on the Gamma and Beta functions. Some of them have already been considered by previously, and other are…

We obtain a family of new combinatorial identities for symmetric formal power series.

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…

In the process of studying a conjecture of Holly M. Green and Martin W. Liebeck, we obtain two interesting identities by elementary methods, one is a combinatorial identity, and the other is a number theoretic identity.

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…

In this note, we present two new identities for derangements. As a corollary, we have a combinatorial proof of the irreducibility of the standard representation of symmetric groups.

Some generalized multi-sum Chu-Vandermonde identities are presented and proved, generalizing some known multi-sum Chu-Vandermonde identities from literature and adding some quadratic and cubic examples of these identities. Some other…

We give a proof of a recent combinatorial conjecture due to the first author, which was discovered in the framework of commutative algebra. This result gives rise to new companions to the famous Andrews-Gordon identities. Our tools involve…

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

In this note we give some identities which involve the Mertens function M(n). Our proofs are combinatorial with relatively prime subsets as a main tool.

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

Motivated by a polynomial identity of certain iterated integrals, first observed in [CGM20] in the setting of lattice paths, we prove an intriguing combinatorial identity in the shuffle algebra. It has a close connection to de Bruijn's…

We prove two identities of Hall-Littlewood polynomials, which appeared recently in a paper by two of the authors. We also conjecture, and in some cases prove, new identities which relate infinite sums of symmetric polynomials and partition…

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

In their recent book on combinatorial identities, Quaintance and Gould devoted one chapter to Melzak's identity. We give new proofs for this identity and its generalization.

We present a proof of a combinatorial conjecture from the second author's Ph.D. thesis. The proof relies on binomial and multinomial sums identities. We also discuss the relevance of the conjecture in the context of PAC-Bayesian machine…

We extend to a scheme-theoretic context the notion of a combinatorial differential form, due to A.Kock in the framework of synthetic differential geometry. We show that group-valued combinatorial forms on a scheme may be identified, under…

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…

We prove a master identity for a class of sequences defined by full-history linear homogeneous recurrences with (non-negative) constant coefficients. The identity is derived in a combinatorial way, providing thus combinatorial proofs for…