Related papers: New proofs of Melzak's identity
We provide a refinement of MacMahon's partition identity on sequence-avoiding partitions, and use it to produce another mod 6 partition identity. In addition, we show that our technique also extends to cover Andrews's generalization of…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…
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…
A very short, bijective proof, of Touchard's Catalan identity is given, using Dyck paths.
We introduce the notion of Kravchuk derivations of the polynomial algebra. We prove that any element of the kernel of the derivation gives a polynomial identity satisfied by the Kravchuk polynomials. Also, we prove that any kernel element…
In our previous paper, we determined a unified combinatorial framework to look at a large number of colored partition identities, and studied the five identities corresponding to the exceptional modular equations of prime degree of the…
We investigate extensions of Malcev algebras and give an explicit example of extended algebras. We present a new algebraic identity, which can be regarded as a generalization of the Jacobi identity or the Malcev identity. As applications to…
An identity by Chaundy and Bullard writes 1/(1-x)^n (n=1,2,...) as a sum of two truncated binomial series. This identity was rediscovered many times. Notably, a special case was rediscovered by I. Daubechies, while she was setting up the…
In 2018, Stanton proved two types of generalisations of the celebrated Andrews--Gordon and Bressoud identities (in their $q$-series version): one with a similar shape to the original identities, and one involving binomial coefficients. In…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
In this paper we give new identities involving q-Euler polynomials of higher order.
In this note, we will give a short proof of an identity for cubic partitions.
In 1991, the Borweins established a cubic analogue of Jacobi's identity for theta functions, which is used by B.C. Berndt, S. Bhargava, and F.G. Garvan in the development of Ramanujan's cubic theory of elliptic functions. In 2013, D.…
We give new proofs of MacMahon and Russell's modulo 6 identities using the method of weighted words. We also present a new refinement of MacMahon's identity, some related finite sum identities, and a companion partition theorem to sequence…
This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Knisley Sanders, and explores characteristics of these generalized theorems ad infinitum.
A proof of several identities of Ramanujan involving theta functions of level $7$ is given which uses a specific modular function for $\Gamma_1(7)$ and Klein's projective representation of $PSL(2,7)$ into $PSL(3, \mathbb{C})$. Four…
We present some identities dealing with reflexive and admissible relations and which, through a variety, are equivalent to congruence modularity.
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 obtain several new identities for Bernoulli and Euler polynomials; some of them extend Miki's and Matiyasevich's identities. Our new method involves differences and derivatives of polynomials.