相关论文: On proofs of certain combinatorial identities
In this paper, we show combinatorial identities that represent powers of positive integers using multinomial coefficients, which do not come from the multinomial theorem and the multinomial Vandermonde's convolution.
Automating formal proofs of combinatorial identities is challenging for LLM-based provers, as long-horizon proof planning is required and unconstrained search quickly explodes. Symbolic methods such as the Wilf-Zeilberger (WZ) method can…
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…
By using the Wilf-Zeilberger method, we prove a novel finite combinatorial identity related to a bivariate generating function for $\zeta(2+r+2s)$ (an extension of a Bailey-Borwein-Bradley Apery-like formula for even zeta values). Such…
Recently the second named author discovered a combinatorial identity in the context of vertex representations of quantum Kac-Moody algebras. We give a direct and elementary proof of this identity. Our method is to show a related identity of…
In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…
In this paper, we obtain formulas for the number of representations of positive integers as sums of arbitrarily many squares (and other polygonal numbers) with a certain natural weighting. The resulting weighted sums give Fourier…
The coefficient of x^{-1} of a formal Laurent series f(x) is called the formal residue of f(x). Many combinatorial numbers can be represented by the formal residues of hypergeometric terms. With these representations and the extended…
A combinatorial identity that was needed in Ahlgren and Ono's proof of a certain congruence conjecture of Frits Beukers is stated, and a pointer to its WZ proof is given.
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…
Recently, Kam Cheong Au discovered a powerful methodology of finding new Wilf-Zeilberger (WZ) pairs. He calls it WZ seeds and gives numerous examples of applications to proving longstanding conjectural identities for reciprocal powers of…
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…
In this note, we show how a combinatorial identity of Frisch can be applied to prove and generalize some well-known identities involving harmonic numbers. We also present some combinatorial identities involving odd harmonic numbers which…
We formulate several polynomial identities. One side of these identities has a nice simple form. Whereas the other has a form of a polynomial whose coefficients contain binomial coefficients double factorials or (and) rising factorials. The…
We give an identity which is conjectured and proved by using an implementation in Multi-WZ.
We prove formulas for the Bernoulli numbers by using the Newton-Girard identities to evaluate the Riemann zeta function at positive even integers. To do this, we define a sequence of positive integers, a sequence of polynomials, and a…
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.
We prove astonishing identities generated by compositions of positive integers. In passing, we obtain two new identities for Stirling numbers of the first kind. In the two last sections we clarify an algebraic sense of these identities and…
We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.
A probability method is provided to prove three classes of combinatorial identities. The method is extremely simple, only one step after the proper probability setup.