Related papers: Self-descriptive Sequences directed by two Periodi…
Periodic signals play an important role in daily lives. Although conventional sequential models have shown remarkable success in various fields, they still come short in modeling periodicity; they either collapse, diverge or ignore details.…
A constant term sequence is a sequence of rational numbers whose $n$-th term is the constant term of $P^n(\boldsymbol{x}) Q(\boldsymbol{x})$, where $P(\boldsymbol{x})$ and $Q(\boldsymbol{x})$ are multivariate Laurent polynomials. While the…
Controlled ordinary differential equations driven by continuous bounded variation curves can be considered a continuous time analogue of recurrent neural networks for the construction of expressive features of the input curves. We ask up to…
The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
Unmeasured causal forces influence diverse experimental time series, such as the transcription factors that regulate genes, or the descending neurons that steer motor circuits. Combining the theory of skew-product dynamical systems with…
Given an algebraically closed field $K$, a dynamical sequence over $K$ is a $K$-valued sequence of the form $a(n):= f(\phi^n(x_0))$, where $\phi\colon X\to X$ and $f\colon X\to\mathbb{A}^1$ are rational maps defined over $K$, and $x_0\in X$…
The Catalan number sequence is one of the most famous number sequences in combinatorics and is well studied in the literature. In this paper we further investigate its fundamental properties related to the moment problem and prove for the…
In this note, we prove the last remaining case of the original 15 two-term supercongruence conjectures for sporadic sequences. The proof utilizes a new representation for this sequence (due to Gorodetsky) as the constant term of powers of a…
We present a general method to obtain asymptotic power series for three kinds of sequences. And we give recurrence relations for determining the coefficients of asymptotic power series for these sequences. As applications, we show how these…
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};…
We introduce the notion of an asymptotically automatic sequence, which generalises the notion of an automatic sequence, and we prove a variant of Cobham's theorem for the newly introduced class of sequences.
The paper studies discrete time processes and their predictability and randomness in deterministic pathwise setting, without using probabilistic assumptions on the ensemble. We suggest some approaches to quantification of randomness based…
We introduce a class of subshifts governed by finitely many two-sided infinite words. We call these words leading sequences. We show that any locally constant cocycle over such a subshift is uniform. From this we obtain Cantor spectrum of…
Frequent sequence mining methods often make use of constraints to control which subsequences should be mined. A variety of such subsequence constraints has been studied in the literature, including length, gap, span, regular-expression, and…
Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period…
We give the trace representation of a family of binary sequences derived from Euler quotients by determining the corresponding defining polynomials. Trace representation can help us producing the sequences efficiently and analyzing their…
For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory…
Negative orientable sequences, i.e. periodic sequences with elements from a finite alphabet of size at least three in which an n-tuple or the negative of its reverse appears at most once in a period of the sequence, were introduced by…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…