Related papers: Self-descriptive Sequences directed by two Periodi…
This paper describes a class of sequences that are in many ways similar to Fibonacci sequences: given n, sum the previous two terms and divide them by the largest possible power of n. The behavior of such sequences depends on n. We analyze…
We prove that a sequence is primitive substitutive if and only if the set of its derived sequences is finite; we defined these sequences here.
Let $k\ge 2$. We prove that the characteristic sequence of a regular language over a $k$-letter alphabet is $k$-automatic. More generally, if $t\ge 2$ and $t,k$ are multiplicatively dependent, we show that the characteristic sequence of a…
The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…
We show that there is a very simple approach to determine the 2-adic complexity of periodic binary sequences with ideal two-level autocorrelation. This is the first main result by H. Xiong, L. Qu, and C. Li, IEEE Transactions on Information…
The correlation measure is a testimony of the pseudorandomness of a sequence $\infw{s}$ and provides information about the independence of some parts of $\infw{s}$ and their shifts. Combined with the well-distribution measure, a sequence…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
We examine the linear complexity and the autocorrelation properties of new quaternary cyclotomic sequences of period 2p. The sequences are constructed via the cyclotomic classes of order four.
Periodic phenomena are oscillating signals found in many naturally-occurring time series. A periodogram can be used to measure the intensities of oscillations at different frequencies over an entire time series but sometimes we are…
Generalized Fibonacci-like sequences appear in finite difference approximations of the Partial Differential Equations based upon replacing partial differential equations by finite difference equations. This paper studies properties of the…
The generalized cyclotomic binary sequences $S=S(a, b, c)$ with period $n=pq$ have good autocorrelation property where $(a, b, c)\in \{0, 1\}^3$ and $p, q$ are distinct odd primes. For some cases, the sequences $S$ have ideal or optimal…
Sequential recommendation (SR) aims to predict a user's next item preference by modeling historical interaction sequences. Recent advances often integrate frequency-domain modules to compensate for self-attention's low-pass nature by…
We introduce the notions of $\tau$-exceptional and signed $\tau$-exceptional sequences for any finite dimensional algebra. We prove that for a fixed algebra of rank $n$, and for any positive integer $t \leq n$, there is a bijection between…
We present three classes of symmetric broadband composite pulse sequences. The composite phases are given by analytic formulas (rational fractions of $\pi$) valid for any number of constituent pulses. The transition probability is expressed…
The theory of sequences, supported by many SMT solvers, can model program data types including bounded arrays and lists. Sequences are parameterized by the element data type and provide operations such as accessing elements, concatenation,…
This paper presents the log-concavity of the $m$-gonal figurate number sequences. The author gives and proves the recurrence formula for $m$-gonal figurate number sequences and its corresponding quotient sequences which are found to be…
Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…