Related papers: Discovering and Proving Infinite Binomial Sums Ide…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…
We establish some identities of Euler related sums. By using these identities, we discuss the closed form representations of sums of harmonic numbers and reciprocal parametric binomial coefficients through parametric harmonic numbers,…
We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the…
A doubly infinite set of series expansion for $1/\pi$ are reported. They follow trivially from a formal expansion for the quotient of the values taken by the gamma function for two (complex) arguments differing by an integer plus one half,…
The problem of finding formulas for sums of powers of natural numbers has been of interest to mathematicians for many centuries. Among these is Faulhaber's well-known formula expressing the power sums as polynomials whose coefficients…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
Sum of powers 1^p+...+n^p, with n and p being natural numbers and n>=1, can be expressed as a polynomial function of n of degree p+1. Such representations are often called Faulhaber formulae. A simple recursive algorithm for computing…
We identify a partition-theoretic generalization of Riemann zeta function and the equally positive integer-indexed harmonic sums at infinity, to obtain the generating function and the integral representations of the latter. The special…
We bound the tensor ranks of elementary symmetric polynomials, and we give explicit decompositions into powers of linear forms. The bound is attained when the degree is odd.
In this note, we give a shorter proof of the result of Zheng, Yu, and Pei on the explicit formula of inverses of generalized cyclotomic permutation polynomials over finite fields. Moreover, we characterize all these cyclotomic permutation…
In this paper, we present a method based on contour integration to investigate a class of cyclotomic parametric Ap\'ery-like series. The general term of such series involves a parametric central binomial coefficient, which is defined via…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of…
We prove effective finiteness results concerning polynomial values of the sums $$ b^k +\left(a+b\right)^k + \cdots + \left(a\left(x-1\right) + b\right)^k $$ and $$ b^k - \left(a+b\right)^k + \left(2a+b\right)^k - \ldots + (-1)^{x-1}…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
This paper introduces a symbolic calculus-based approach for deriving closed-form expressions for the sums of arithmetic sequences. The method extends beyond constant-difference sequences to those with polynomially increasing steps,…
Spivey presented a new approach to evaluate combinatorial sums by using finite differences. We present some closed forms for sums involving the binomial coefficients, Fibonacci and Lucas numbers in terms of the falling factorial.
We exploit transformations relating generalized $q$-series, infinite products, sums over integer partitions, and continued fractions, to find partition-theoretic formulas to compute the values of constants such as $\pi$, and to connect sums…
We demonstrate that certain class of infinite sums can be calculated analytically starting from a specific quantum mechanical problem and using principles of quantum mechanics. For simplicity we illustrate the method by exploring the…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…