English
Related papers

Related papers: Gaps in the Thue--Morse word

200 papers

The $N$th linear complexity of a sequence is a measure of predictability. Any unpredictable sequence must have large $N$th linear complexity. However, in this paper we show that for $q$-automatic sequences over $\mathbb{F}_q$ the converse…

Number Theory · Mathematics 2017-11-30 László Mérai , Arne Winterhof

Studying and comparing arithmetic properties of a given automatic sequence and the sequence of coefficients of the composition inverse of the associated formal power series (the formal inverse of that sequence) is an interesting problem.…

Number Theory · Mathematics 2018-03-02 Łukasz Merta

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…

Number Theory · Mathematics 2020-10-05 J. -P. Allouche , F. M. Dekking , M. Queffélec

In this survey we summarize properties of pseudorandomness and non-randomness of some number-theoretic sequences and present results on their behaviour under the following measures of pseudorandomness: balance, linear complexity,…

Number Theory · Mathematics 2023-05-22 Arne Winterhof

We show that the images via $z\mapsto z^m$ of the continuous part of the spectral measures of the dynamical systems generated by the 0-1 sequences of the Thue-Morse type are pairwise mutually singular for different odd numbers $m\in\N$.…

Dynamical Systems · Mathematics 2013-10-11 El Houcein El Abdalaoui , Stanisław Kasjan , Mariusz Lemańczyk

Two words are $k$-binomially equivalent whenever they share the same subwords, i.e., subsequences, of length at most $k$ with the same multiplicities. This is a refinement of both abelian equivalence and the Simon congruence. The…

Discrete Mathematics · Computer Science 2018-12-19 Marie Lejeune , Julien Leroy , Michel Rigo

Given a countable set X (usually taken to be the natural numbers or the integers), an infinite permutation \pi of X is a linear ordering of X. This paper investigates the combinatorial complexity of the infinite permutation on the natural…

Combinatorics · Mathematics 2010-04-06 Steven Widmer

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

Formal Languages and Automata Theory · Computer Science 2012-03-30 Dane Henshall , Jeffrey Shallit

Let $\omega$ be a factor of Doubling sequence $D_\infty=x_1x_2\cdots$, then it occurs in the sequence infinitely many times. Let $\omega_p$ be the $p$-th occurrence of $\omega$ and $G_p(\omega)$ be the gap between $\omega_p$ and…

Dynamical Systems · Mathematics 2014-08-26 Yuke Huang , Hanxiong Zhang

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…

Combinatorics · Mathematics 2024-08-27 Pierre Popoli , Manon Stipulanti

The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact…

Data Structures and Algorithms · Computer Science 2023-04-04 Paweł Gawrychowski , Garance Gourdel , Tatiana Starikovskaya , Teresa Anna Steiner

A set of words, also called a language, is letter-balanced if the number of occurrences of each letter only depends on the length of the word, up to a constant. Similarly, a language is factor-balanced if the difference of the number of…

Formal Languages and Automata Theory · Computer Science 2022-11-28 Léo Poirier , Wolfgang Steiner

We prove that a sequence satisfying a certain symmetry property is $2$-regular in the sense of Allouche and Shallit, i.e., the $\mathbb{Z}$-module generated by its $2$-kernel is finitely generated. We apply this theorem to develop a general…

Formal Languages and Automata Theory · Computer Science 2023-09-04 Aline Parreau , Michel Rigo , Eric Rowland , Elise Vandomme

We define the Thue-Morse transform T on a class of infinite binary words. It sends the alternating word a_0 = 010101... to the Thue-Morse sequence. We then study its orbit a_m = T^m(a_0) as well as the sequences u_m and v_m giving…

Number Theory · Mathematics 2026-05-29 Benoit Cloitre

We give an in depth analysis of the subwords of the Thue-Morse sequence. This allows us to prove that there are infinitely many injective primitive substitutions with Perron-Frobenius eigenvalue 2 that generate a symbolic dynamical system…

Combinatorics · Mathematics 2017-05-25 Michel Dekking

The Thue-Morse system is a paradigm of singular continuous diffraction in one dimension. Here, we consider a planar system, constructed by a bijective block substitution rule, which is locally equivalent to the squiral inflation rule. For…

Disordered Systems and Neural Networks · Physics 2019-10-03 Uwe Grimm , Michael Baake

We study various aspects of Dyck words appearing in binary sequences, where $0$ is treated as a left parenthesis and $1$ as a right parenthesis. We show that binary words that are $7/3$-power-free have bounded nesting level, but this no…

Discrete Mathematics · Computer Science 2026-05-27 Lucas Mol , Narad Rampersad , Jeffrey Shallit

We consider a measure of similarity for infinite words that generalizes the notion of asymptotic or natural density of subsets of natural numbers from number theory. We show that every overlap-free infinite binary word, other than the…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Chen Fei Du , Jeffrey Shallit

The Thue-Morse set is the set of those nonnegative integers whose binary expansions have an even number of $1$. We obtain an exact formula for the state complexity of the multiplication by a constant of the Thue-Morse set $\mathcal{T}$ with…

Formal Languages and Automata Theory · Computer Science 2019-03-15 Émilie Charlier , Célia Cisternino , Adeline Massuir

The Thue-Morse set T is the set of those non-negative integers whose binary expansions have an even number of 1. The name of this set comes from the fact that its characteristic sequence is given by the famous Thue-Morse word…

Formal Languages and Automata Theory · Computer Science 2019-09-18 Émilie Charlier , Célia Cisternino , Adeline Massuir