Related papers: A note on some binomial sums

This paper presents the equality of finite index sums of Bessel func- tions containing arbitrary numbers of terms. These reduce to the familiar three term recursion formulas in simple cases.

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

We extend Riemann's rearrangement theorem on conditionally convergent series of real numbers to multiple instead of simple sums.

In this note we show a simple formula for the coefficients of the polynomial associated with the sums of powers of the terms of an arbitrary arithmetic progression. This formula consists of a double sum involving only ordinary binomial…

Let $p_1,p_2,\dots,p_n, a_1,a_2,\dots,a_n \in \N$, $x_1,x_2,\dots,x_n \in \R$, and denote the $k$th periodized Bernoulli polynomial by $\B_k(x)$. We study expressions of the form \[ \sum_{h \bmod{a_k}} \ \prod_{\substack{i=1\\ i\not=k}}^{n}…

We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…

We suggest a new approach to Artin's constant that leads to its representation as an infinite sum divided by another infinite sum. The same approach works well for Stephens' constant and higher rank Artin's constants. The main results are…

Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author results here in combinatorial interpretation of the recurrence relation for fibonomial coefficients . The presentation is provided with…

We offer a proof of a summation formula equivalent to one due to Berndt. Our proof uses the M$\ddot{u}$ntz formula and the Poisson summation formula. By utilizing known properties of Mellin inversion, we give an example from a discontinuous…

In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…

A new kind of diagrams is presented, showing the causal structure of bimetric interactions.

We extend the authors' previous work on Wiener-Wintner double recurrence theorem to the case of polynomials.

Multiple binomial sums form a large class of multi-indexed sequences, closed under partial summation, which contains most of the sequences obtained by multiple summation of products of binomial coefficients and also all the sequences with…

In this paper, we find an elementary approach for double sums where the inner sum is binomial but incomplete. We apply our core identity and its relatives to double sums involving famous numbers such as harmonic numbers, Fibonacci numbers,…

Let $(X_{k})_{k\geq 1}$ and $(Y_k)_{k\geq 1}$ be the sequence of $X$ and $Y$-coordinates of the positive integer solutions $(x, y)$ of the equation $x^2 - dy^2 = t$. In this paper we completely describe those recurrence sequences such that…

Recently, Andrews and Berkovich introduced a trinomial version of Bailey's lemma. In this note we show that each ordinary Bailey pair gives rise to a trinomial Bailey pair. This largely widens the applicability of the trinomial Bailey lemma…