Related papers: The convergence test to the application in a multi…
In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…
We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…
Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
We propose a sufficient condition of the convergence of a power-log series that formally satisfies an algebraic ordinary differential equation (ODE) of arbitrary order. A general form and properties of the functional coefficients of such a…
An integrable system is often formulated as a flat connection, satisfying a Lax equation. It is given in terms of compatible systems having a common solution called the ``wave function" $\Psi$ living in a Lie group $G$, which satisfies some…
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
We generalize the classical Olivier's theorem which says that for any convergent series $\sum_n a_n$ with positive nonincreasing real terms the sequence $(n a_n)$ tends to zero. Our results encompass many known generalizations of Olivier's…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
We present a closed-form solution for n-th term of a general three-term recurrence relation with arbitrary given n-dependent coefficients. The derivation and corresponding proof are based on two approaches, which we develop and describe in…
The history of linear differential equations is over 350 years. By using Frobenius method and putting the power series expansion into linear differential equations, the recursive relation of coefficients starts to appear. There can be…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Recursive formulas are derived for the number of solutions of linear and quadratic Diophantine equations with positive coefficients. This result is further extended to general non-linear additive Diophantine equations. It is shown that all…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…