Related papers: An Explicit Identity to solve sums of Powers of Co…

We consider the reflection identities for harmonic sums at weight four. We decompose a product of two harmonic sums with mixed pole structure into a linear combination of terms each having a pole at either negative or positive values of the…

This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…

Let $B$ and $C$ be square complex matrices. The differential equation \begin{equation*} x''(t)+Bx'(t)+Cx(t)=f(t) \end{equation*} is considered. A solvent is a matrix solution $X$ of the equation $X^2+BX+C=\mathbf0$. A pair of solvents $X$…

We show generic existence of power series a with complex coefficients a_n, such that the sequence of partial sums of a new power series where its coefficients b_n are functions of a_0, a_1, ..., a_n approximate every polynomial uniformly on…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Given a linear recurrence of the form $c_n=a_1c_{n-1}+\cdots+a_j c_{n-j}$, it is well-known that $c_n=\sum_{r}p_r(n)r^n$, where the sum is taken over the set of characteristic roots and each $p_r(n)$ is some polynomial. We give a closed…

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…

In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…

Resultant $R_{r_1, ..., r_n}$ defines a condition of solvability for a system of $n$ homogeneous polynomials of degrees $r_1, ..., r_n$ in $n$ variables, just in the same way as determinant does for a system of linear equations. Because of…

Convolution powers of $1/x$ are transformed into functions $f_n$, which satisfy a simple recurrence relation. Solutions are characterized and analyzed.

We use both Abel's lemma on summation by parts and Zeilberger's algorithm to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial…

The approach to the constructing explicit solutions of the recurrence relations for multi-loop integrals are suggested. The resulting formulas demonstrate a high efficiency, at least for 3-loop vacuum integrals case. They also produce a new…

The problem of simultaneous decomposition of binary forms as sums of powers of linear forms is studied. For generic forms the minimal number of linear forms needed is found and the space parametrizing all the possible decompositions is…

The method of self-similar factor approximants is completed by defining the approximants of odd orders, constructed from the power series with the largest term of an odd power. It is shown that the method provides good approximations for…

We consider the iterative solution of large linear systems of equations in which the coefficient matrix is the sum of two terms, a sparse matrix $A$ and a possibly dense, rank deficient matrix of the form $\gamma UU^T$, where $\gamma > 0$…

An explicit identity of sums of powers of complex functions presented via this a closed-form formula of Riemann zeta function produced at any given non-zero complex numbers. The closed-form formula showed us Riemann zeta function has no…

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

In this article we consider a consistent matrix equation $AXB = C$ when a particular solution $X_{0}$ is given and we represent a new form of the general solution which contains both reproductive and non-reproductive solutions (it depends…

In this work, the authors provide closed forms and recurrence expressions for computing the $k$th power of the formal power series, some of them in terms of a determinant of some matrices. As a consequence, we obtain the reciprocal of the…

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…