Related papers: Gaps in the Thue--Morse word
We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…
In this work we introduce a new notion called opacity complexity to measure the complexity of automatic sequences. We study basic properties of this notion, and exhibit an algorithm to compute it. As applications, we compute the opacity…
We study the behavior of a polynomial sequence which is defined by iterating a polynomial pair under Thue-Morse dynamic. We show that in suitable sense, the sequence will behave like $\{2\cos 2^nx: n\ge 1\}$. Basing on this property we can…
Automatic sequences such as the Thue-Morse sequence and the Rudin-Shapiro sequence are highly predictable and thus not suitable in cryptography. In particular, they have small expansion complexity. However, they still have a large maximum…
It is a classical fact that the exponential function is solution of the integral equation $ \int_0^X f(x)dx + f(0) =f(X)$. If we slightly modify this equation to $ \int_0^X f(x)dx+f(0)=f(\alpha X)$ with $\alpha\in ]0,1[$, it seems that no…
The problem is sequence prediction in the following setting. A sequence x1,..., xn,... of discrete-valued observations is generated according to some unknown probabilistic law (measure) mu. After observing each outcome, it is required to…
The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential queries (decide if the pattern occurs in S), reporting…
We present tracial analogs of the classical results of Curto and Fialkow on moment matrices. A sequence of real numbers indexed by words in non-commuting variables with values invariant under cyclic permutations of the indexes, is called a…
The paradigm for singular continuous spectra in symbolic dynamics and in mathematical diffraction is provided by the Thue-Morse chain, in its realisation as a binary sequence with values in $\{\pm 1\}$. We revisit this example and derive a…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…
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…
In the base phi expansion any natural number is written uniquely as a sum of powers of the golden mean with digits 0 and 1, where one requires that the product of two consecutive digits is always 0. In this paper we show that the sum of…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
Logical theories have been developed which have allowed temporal reasoning about eventualities (a la Galton) such as states, processes, actions, events, processes and complex eventualities such as sequences and recurrences of other…
In this paper, we consider a variant of the classical algorithmic problem of checking whether a given word $v$ is a subsequence of another word $w$. More precisely, we consider the problem of deciding, given a number $p$ (defining a…
In this paper we study the non-injectivity arising in infinite interval exchange transformations. In particular, we build and analyze an infinite family of infinite interval exchanges semi-conjugated to generalized Thue-Morse subshifts,…
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…
In this paper, we study the topological properties and the gap sequences of Bedford-McMullen sets. First, we introduce a topological condition, the component separation condition (CSC), and a geometric condition, the exponential rate…
We consider the longest common subsequence problem in the context of subsequences with gap constraints. In particular, following Day et al. 2022, we consider the setting when the distance (i. e., the gap) between two consecutive symbols of…