Related papers: The Behavior of a Three-Term Hofstadter-Like Recur…

We study the limiting behavior for the solutions of a nonlinear recurrent relation which arises from the study of Navier-Stokes equations. Some stability theorems are also shown concerning a related class of linear recurrent relations.

We prove the log-concavity of the Fennessey-Larcombe-French sequence based on its three-term recurrence relation, which was recently conjectured by Zhao. The key ingredient of our approach is a sufficient condition for log-concavity of a…

The Furstenberg recurrence theorem (or equivalently, Szemer\'edi's theorem) can be formulated in the language of von Neumann algebras as follows: given an integer $k \geq 2$, an abelian finite von Neumann algebra $(\M,\tau)$ with an…

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…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

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 present nested sequent systems for propositional G\"odel-Dummett logic and its first-order extensions with non-constant and constant domains, built atop nested calculi for intuitionistic logics. To obtain nested systems for these…

In this note we show that if $(u_n)_{n\geqslant 1}$ is a simple linearly recurrent sequence of integers whose minimal recurrence of order $k$ involves only positive coefficients that has positive initial terms, then $(Mu_{n^s})_{n\geqslant…

In this paper, we deal with two families of third-order Jacobsthal sequences. The first family consists of generalizations of the Jacobsthal sequence. We show that the Gelin-Ces\`aro identity is satisfied. Also, we define a family of…

Using a result of Behrend concerning sets without arithmetic progressions, we construct some examples of dynamical systems with slow time of multiple recurrence. Our theorem is a quatitative analog of Furstenberg's Correspondence Principle.

We introduce an elementary congruence-based procedure to look for q-th power multiples in arbitrary binary recurrence sequences (q>2). The procedure allows to prove that no such multiples exist in many instances.

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

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.

It is well-known that orthogonal polynomials on the real line satisfy a three-term recurrence relation and conversely every system of polynomials satisfying a three-term recurrence relation is orthogonal with respect to some positive Borel…

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

We investigate new generalizations of the Meixner polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the…

Let $q$ be a positive integer and $\mathcal{S}=\left\{x_0,x_1,\ldots,x_{T-1}\right\}\subseteq\mathbb{Z}_q=\{0,1,\ldots,q-1\}$ with $$0\leq x_0<x_1<\ldots< x_{T-1}\leq q-1.$$ We derive from $\mathcal{S}$ three (finite) sequences. 1. For an…

We consider arithmetic sequences, here defined as ordered lists of positive integers. Any such a sequence can be cast onto a quantum state, enabling the quantification of its `surprise' through von Neumann entropy. We identify typical…

We perform a thorough investigation of the first FPUT recurrence in the $\beta$-FPUT chain for both positive and negative $\beta$. We show numerically that the rescaled FPUT recurrence time $T_{r}=t_{r}/(N+1)^{3}$ depends, for large $N$,…

We give some results and conjectures about recurrence relations for certain sequences of binomial sums.