Related papers: Recurrence for powers of recursive sequence II
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…
In this paper we present a simple method for deriving recurrence relations and we apply it to obtain two equations involving the Lerch Phi function and sums of Bernoulli and Euler polynomials. Connections between these results and those…
We apply the theory of disconjugate linear recurrence relations to the study of irrational quantities in number theory. In particular, for an irrational number associated with solutions of three-term linear recurrence relations we show that…
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…
Using ordinary and exponential generating functions, we explore the reversion of power series defined by $2$nd order recurrences. We express the reversions in terms of Jacobi and Thron continued fractions. We find relations with Eulerian…
The independence polynomial of a hypergraph is the generating function for its independent (vertex) sets with respect to their cardinality. This article aims to discuss several recurrence relations for the independence polynomial using some…
For each element of certain families of integer sequences, we study the term-wise ratios of the Hankel transforms of three sequences related to that element by series reversion. In each case, the ratios define well-known sequences, and in…
Recurrence properties of systems and associated sets of integers that suffice for recurrence are classical objects in topological dynamics. We describe relations between recurrence in different sorts of systems, study ways to formulate…
We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…
Logical theories have been developed which have allowed temporal reasoning about eventualities (a la Galton) such as states, processes, actions, events, processes and complex eventualities such as sequences and recurrences of other…
Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who…
Let $X = [0,1]$, and let $T:X\to X$ be an expanding piecewise linear map sending each interval of linearity to $[0,1]$. For $\psi:\mathbb N\to\mathbb R_{\geq 0}$, $x\in X$, and $N\in\mathbb N$ we consider the recurrence counting function \[…
This paper studies non-autonomous Lyness type recurrences of the form $x_{n+2}=(a_n+x_{n+1})/x_{n}$, where $\{a_n\}$ is a $k$-periodic sequence of positive numbers with primitive period $k$. We show that for the cases $k\in\{1,2,3,6\}$ the…
Given a positive integer $n$, the small divisors of $n$ are defined as the positive divisors that do not exceed $\sqrt{n}.$ Ianucci previously classified all $n$ for which the small divisors of $n$ form an arithmetic progression. In this…
In this paper, we present a new algorithm for computing the linear recurrence relations of multi-dimensional sequences. Existing algorithms for computing these relations arise in computational algebra and include constructing structured…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
We establish a sufficient condition for the ultimate positivity of P-recursive sequences of arbitrary order with a unique dominant root. By additionally verifying finitely many initial terms, the positivity can also be resolved. As an…
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
An interplay between the Lambert series and Euler's Pentagonal Number Theorem gives an Euler-type recurrence relation for any given arithmetical function. As consequences of this, we present Euler-type recurrence relations for some…
We study the discrete-time, real valued bounded process $\{X_n, n\in {\mathbb N} \}$ defined by a second order recurrence relation $X_{n+2} = \varphi(X_n,X_{n+1})$. We obtain the decay of correlations under analytical hypotheses on $\varphi…