English
Related papers

Related papers: Non-linear Recurrences that Quite Unexpectedly Gen…

200 papers

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

Logic · Mathematics 2008-01-15 Arnold W. Miller

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

Dynamical Systems · Mathematics 2014-02-26 Nikos Frantzikinakis , Emmanuel Lesigne , Mate Wierdl

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

Logic · Mathematics 2025-06-09 Mihai Prunescu , Lorenzo Sauras-Altuzarra

Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…

Information Theory · Computer Science 2010-07-26 Graham H. Norton

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…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

This paper is the continuation of \cite{htl}, where we deal with Lucas sequences. Here we study integers represented by integer sequences which satisfy binary recursive relations. In case of non-degenerate sequences we give bounds for the…

Number Theory · Mathematics 2024-08-12 L. Hajdu , R. Tijdeman

We exhibit a three parameter infinite family of quadratic recurrence relations inspired by the well known Somos sequences. For one infinite subfamily we prove that the recurrence generates an infinite sequence of integers by showing that…

Combinatorics · Mathematics 2009-04-07 Paul Heideman , Emilie Hogan

Consider the celebrated Lyness recurrence $x_{n+2}=(a+x_{n+1})/x_{n}$ with $a\in\Q$. First we prove that there exist initial conditions and values of $a$ for which it generates periodic sequences of rational numbers with prime periods…

Dynamical Systems · Mathematics 2012-01-06 Armengol Gasull , Víctor Mañosa , Xavier Xarles

A nearly linear recurrence sequence (nlrs) is a complex sequence $(a_n)$ with the property that there exist complex numbers $A_0$,$\ldots$, $A_{d-1}$ such that the sequence $\big(a_{n+d}+A_{d-1}a_{n+d-1}+\cdots +A_0a_n\big)_{n=0}^{\infty}$…

Number Theory · Mathematics 2016-08-02 Shigeki Akiyama , Jan-Hendrik Evertse , Attila Pethő

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…

Number Theory · Mathematics 2024-03-25 Kálmán Liptai , László Németh , Tamás Szakács , László Szalay

We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is…

Logic in Computer Science · Computer Science 2014-12-11 Fred Mesnard , Etienne Payet

Let $ \prod_{i=1}^d (X-\alpha_i Y) \in{\mathbb C}[X,Y]$ be a binary form and let $\epsilon_1,\dots,\epsilon_d$ be nonzero complex numbers. We consider the family of binary forms $ \prod_{i=1}^d (X-\alpha_i \epsilon_i^aY)$, $a\in {\mathbb…

Number Theory · Mathematics 2018-02-15 Claude Levesque , Michel Waldschmidt

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

Number Theory · Mathematics 2011-05-23 H. J. Weber

After giving an overview of the existing theory regarding the periods of sequences defined by linear recurrences over finite fields, we give explicit descriptions of the sets of periods that arise if one considers all sequences over…

Number Theory · Mathematics 2021-07-28 Michael R. Bush , Danjoseph Quijada

We are studying fractional linear recursions of second and third orders and finding periodic recursions with periods of eight and twelve, which, apparently, were not known before.

General Mathematics · Mathematics 2023-10-23 Evgeni Lozitsky

We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely the Positivity Problem (are all terms of a given LRS positive?) and the Ultimate Positivity Problem} (are all but finitely many terms of a…

Discrete Mathematics · Computer Science 2013-10-11 Joel Ouaknine , James Worrell

The first two authors have shown [KK99,KK00] that the sum the exponent (and thus the number) of maximal repetitions of exponent at least 2 (also called runs) is linear in the length of the word. The exponent 2 in the definition of a run may…

Discrete Mathematics · Computer Science 2009-06-26 Roman Kolpakov , Gregory Kucherov , Pascal Ochem

We consider the semiconjugate factorization and reduction of order for non-autonomous, nonlinear, higher order difference equations containing linear arguments. These equations have appeared in several mathematical models in biology and…

Dynamical Systems · Mathematics 2014-01-16 H. Sedaghat

For each odd prime power q, we construct an infinite sequence of rational functions f(X) in F_q(X), each of which is exceptional, which means that for infinitely many n the map c-->f(c) induces a bijection of P^1(F_{q^n}). Moreover, each of…

Number Theory · Mathematics 2022-06-08 Zhiguo Ding , Michael E. Zieve