Related papers: On proofs of certain combinatorial identities
We use the Wilf-Zeilberger method to prove identities between Mahler measures of polynomials. In particular, we offer a new proof of a formula due to Lal\'{i}n, and we show how to translate the identity into a formula involving elliptic…
Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…
Using an elementary approach involving the Euler Beta function and the binomial theorem, we derive two polynomial identities; one of which is a generalization of a known polynomial identity. Two well-known combinatorial identities, namely…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
In this paper, we explore identities that allow for representation of positive integers raised to positive integral powers as sums of nested sums of smaller positive integral powers. We begin by establishing the base identity involving…
In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…
We establish $q$-analogs for four congruences involving central binomial coefficients. The $q$-identities necessary for this purpose are shown via the $q$-WZ method.
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…
We present a method for proving q-series identities by combinatorial telescoping, in the sense that one can transform a bijection or a classification of combinatorial objects into a telescoping relation. We shall illustrate this method by…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
We give combinatorial proofs for some identities involving binomial sums that have no closed form.
We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…
We obtain a family of new combinatorial identities for symmetric formal power series.
Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…
Using combinatorial techniques, we derive a recurrence identity that expresses an exponential power sum with negative powers in terms of another exponential power sum with positive powers. Consequently, we derive a formula for the power sum…
We provide combinatorial tools inspired by work of Warnaar to give combinatorial interpretations of the sum sides of the Andrews-Gordon and Bressoud identities. More precisely, we give an explicit weight- and length-preserving bijection…
The main aim of the present paper is to represent an exact and simple proof for FLT by using properties of the algebra identities and linear algebra.
In this paper we give a new formula for the $n$-th power of a $2\times2$ matrix. More precisely, we prove the following: Let $A= \left ( \begin{matrix} a & b \\ c & d \end{matrix} \right )$ be an arbitrary $2\times2$ matrix, $T=a+d$ its…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…