Related papers: On nearly linear recurrence sequences
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…
Motivated by computing duplication patterns in sequences, a new fundamental problem called the longest subsequence-repeated subsequence (LSRS) is proposed. Given a sequence $S$ of length $n$, a letter-repeated subsequence is a subsequence…
The paper investigates the properties of a nonlinear recursive sequence which includes several ones studied formerly in the literature.
Sequences of Nilsson type appear in abundance in Algebraic Geometry, Enumerative Combinatorics, Mathematical Physics and Quantum Topology. We give an elementary introduction on this subject, including the definition of sequences of Nilsson…
We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…
A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…
Let $\widetilde{\alpha}$ be a length-$L$ cyclic sequence of characters from a size-$K$ alphabet $\mathcal{A}$ such that the number of occurrences of any length-$m$ string on $\mathcal{A}$ as a substring of $\widetilde{\alpha}$ is $\lfloor L…
This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…
Sequence modeling tasks across domains such as natural language processing, time series forecasting, and control require learning complex input-output mappings. Nonlinear recurrence is theoretically required for universal approximation of…
Recursive decoding techniques are considered for Reed-Muller (RM) codes of growing length $n$ and fixed order $r.$ An algorithm is designed that has complexity of order $n\log n$ and corrects most error patterns of weight up to…
For each positive integer $N$, define $$S'_N \ =\ \{1 < d < \sqrt{N}: d|N\}\mbox{ and }L'_N \ =\ \{\sqrt{N} < d < N : d|N\}.$$ Recently, Chentouf characterized all positive integers $N$ such that the set of small divisors $\{d\le \sqrt{N}:…
The almost-principal rank characteristic sequence (apr-sequence) of an $n\times n$ symmetric matrix is introduced, which is defined to be the string $a_1 a_2 \cdots a_{n-1}$, where $a_k$ is either $\tt A$, $\tt S$, or $\tt N$, according as…
Recurrent neural networks (RNNs) are widely used to model sequential data but their non-linear dependencies between sequence elements prevent parallelizing training over sequence length. We show the training of RNNs with only linear…
Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…
Various sequences that possess explicit analytic expressions can be analysed asymptotically through integral representations due to Lindel\"of, which belong to an attractive but somewhat neglected chapter of complex analysis. One of the…
The often elusive Poincar\'e recurrence can be witnessed in a completely separable system. For such systems, the problem of recurrence reduces to the classic mathematical problem of simultaneous Diophantine approximation of multiple…
A Nash group is said to be almost linear if it has a Nash representation with finite kernel. Structures and basic properties of these groups are studied.
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
New type III and type N approximate solutions which are regular in the linear approximation are shown to exist. For that, we use complex transformations on self-dual Robinson-Trautman metrics rather then the classical approach. The…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…