Related papers: New developments of an old identity
By applying the Newton-Gregory expansion to the polynomial associated with the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$, we derive a couple of infinite families of explicit formulas for $S_k(n)$. One of the families…
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…
We give a new identity involving Bernoulli polynomials and combinatorial numbers. This provides, in particular, a Faulhaber-like formula for sums of the form $1^m (n-1)^m + 2^m (n-2)^m + \cdots + (n-1)^m 1^m$ for positive integers $m$ and…
This paper highlights three known identities, each of which involves sums over alternating sign matrices. While proofs of all three are known, the only known derivations are as corollaries of difficult results. The simplicity and natural…
Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…
An identity for binomial symbols modulo an odd positive integer $n$ relating to the least prime factor of $n$ is proved. The identity is discussed within the context of Pell conics.
We give a simple geometric argument to derive in a common manner orthospectrum identities of Basmajian and Bridgeman. Our method also considerably simplifies the determination of the summands in these identities. For example, for every odd…
From sum-of-squares formulas of sizes $[r, s, n]$ and $[r', s', n']$ we construct a formula of size $[r + r', 2ss', 2nn']$.
We give a $q$-analogue of some binomial coefficient identities of Y. Sun [Electron. J. Combin. 17 (2010), #N20] as follows: {align*} \sum_{k=0}^{\lfloor n/2\rfloor}{m+k\brack k}_{q^2}{m+1\brack n-2k}_{q} q^{n-2k\choose 2} &={m+n\brack…
We prove a recent conjecture, due to Vigren and Dieckmann, about an explicit triple sum formula for a series from Ramanujan's Notebooks. We shall give two proofs: the first one is by evaluation and based on the identity \begin{equation*}…
We prove a double binomial sum identity which differs from most binomial sum identities in that the summands involve the absolute value function. The identity is of interest because it can be used in proofs of lower bounds for the Hadamard…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…
The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…
In this article we prove an algebraic identity which significantly generalizes the formula for sum of powers of consecutive integers involving Stirling numbers of the second kind. Also we have obtained a generalization of Newton-Girard…
An identity is proved connecting two finite sums of inverse tangents. This identity is discretized version of Jacobi's imaginary transformation for the modular angle from the theory of elliptic functions. Some other related identities are…
Sylvester's identity is a classical determinantal identity with a straightforward linear algebra proof. We present a new, combinatorial proof of the identity, prove several non-commutative versions, and find a $\beta$-extension that is both…
For a regular $2n$-gon there are $(2n-1)!!$ ways to match and glue the $2n$ sides. The Harer-Zagier bivariate generating function enumerates the gluings by $n$ and the genus $g$ of the attendant surface and leads to a recurrence equation…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
A product difference equation is proved and used for derivation by elementary methods of four combinatorial identities, eight combinatorial identities involving generalized harmonic numbers and eight combinatorial identities involving…