Related papers: Non-linear Recurrences that Quite Unexpectedly Gen…
Recurrence equations have played a central role in static cost analysis, where they can be viewed as abstractions of programs and used to infer resource usage information without actually running the programs with concrete data. Such…
Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that…
Natural numbers from 0 to 11111 are written in terms of 1 to 9 in two different ways. The first one in increasing order of 1 to 9, and the second one in decreasing order. This is done by using the operations of addition, multiplication,…
We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…
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…
Let $E$ be an elliptic curve defined over the rationals and in minimal Weierstrass form, and let $P=(x_1/z_1^2,y_1/z_1^3)$ be a rational point of infinite order on $E$, where $x_1,y_1,z_1$ are coprime integers. We show that the integer…
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…
We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…
We consider a family of nonlinear rational recurrences of odd order which was introduced by Heideman and Hogan. All of these recurrences have the Laurent property, implying that for a particular choice of initial data (all initial values…
Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…
We study sets of the form $A = \big\{ n \in \mathbb N \big| \lVert p(n) \rVert_{\mathbb R / \mathbb Z} \leq \varepsilon(n) \big\}$ for various real valued polynomials $p$ and decay rates $\varepsilon$. In particular, we ask when such sets…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
In this paper we introduce and study new notions of uniform recurrence in multidimensional words. A $d$-dimensional word is called \emph{uniformly recurrent} if for all $(s_1,\ldots,s_d)\in\mathbb{N}^d$ there exists $n\in\mathbb{N}$ such…
We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.
We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…
We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…