English
Related papers

Related papers: Thue-Morse at Multiples of an Integer

200 papers

In this paper, we study the additive complexity $\rho^{+}_{\mathbf{t}}(n)$ of a Thue-Morse like sequence $\mathbf{t}=\sigma^{\infty}(0)$ with the morphism $\sigma: 0\to 01, 1\to 12, 2\to 20$. We show that…

Combinatorics · Mathematics 2018-07-16 Jin Chen , Zhixiong Wen , Wen Wu

Let $t_n = (-1)^{s_2(n)}$, where $s_2(n)$ is the sum of binary digits function. The sequence $(t_n)_{n\in \mathbb N}$ is the well-known Prouhet-Thue-Morse sequence. In this note we initiate the study of the sequence $(h_n)_{n\in \mathbb…

Number Theory · Mathematics 2021-10-01 Eryk Lipka , Maciej Ulas

The Thue--Morse sequence $t=01101001\cdots$ is an automatic sequence over the alphabet $\{0,1\}$. It can be defined as the binary sum-of-digits function $s:\mathbb N\rightarrow\mathbb N$, reduced modulo $2$, or by using the substitution…

Number Theory · Mathematics 2023-09-11 Lukas Spiegelhofer

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

The length $a(n)$ of the longest common subsequence of the $n$'th Thue-Morse word and its bitwise complement is studied. An open problem suggested by Jean Berstel in 2006 is to find a formula for $a(n)$. In this paper we prove new lower…

Discrete Mathematics · Computer Science 2019-12-03 Joakim Blikstad

Two finite words are k-binomially equivalent if each subword (i.e., subsequence) of length at most k occurs the same number of times in both words. The k-binomial complexity of an infinite word is a function that maps the integer $n\geq 0$…

Combinatorics · Mathematics 2024-12-25 M. Golafshan , M. Rigo , M. Whiteland

In this paper, we study the $2$-binomial complexity $b_{\mathbf{t}_{m},2}(n)$ of the generalized Thue-Morse words $\mathbf{t}_{m}$ for every integer $m\geq 3$. We obtain the exact value of $b_{\mathbf{t}_{m},2}(n)$ for every integer $n\geq…

Combinatorics · Mathematics 2021-12-13 Xiao-Tao Lü , Jin Chen , Zhi-Xiong Wen , Wen Wu

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

We prove that the Thue--Morse sequence $\mathbf t$ along subsequences indexed by $\lfloor n^c\rfloor$ is normal, where $1<c<3/2$. That is, for $c$ in this range and for each $\omega\in\{0,1\}^L$, where $L\geq 1$, the set of occurrences of…

Number Theory · Mathematics 2017-11-16 Clemens Müllner , Lukas Spiegelhofer

We study a binary Thue--Morse-type sequence arising from the base-$3/2$ expansion of integers, an archetypal automatic sequence in a rational base numeration system. Because the sequence is generated by a periodic iteration of morphisms…

Combinatorics · Mathematics 2026-02-26 Julien Cassaigne , Bastiàn Espinoza , Michel Rigo , Manon Stipulanti

We show that the size $\gamma(t_n)$ of the smallest string attractor of the $n$th Thue-Morse word $t_n$ is 4 for any $n\geq 4$, disproving the conjecture by Mantaci et al. [ICTCS 2019] that it is $n$. We also show that $\delta(t_n) =…

Data Structures and Algorithms · Computer Science 2020-08-13 Kanaru Kutsukake , Takuya Matsumoto , Yuto Nakashima , Shunsuke Inenaga , Hideo Bannai , Masayuki Takeda

We prove that for $1<c<4/3$ the subsequence of the Thue--Morse sequence $\mathbf t$ indexed by $\lfloor n^c\rfloor$ defines a normal sequence, that is, each finite sequence $(\varepsilon_0,\ldots,\varepsilon_{T-1})\in \{0,1\}^T$ occurs as a…

Number Theory · Mathematics 2017-07-18 Lukas Spiegelhofer

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

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 partial Stirling numbers T_n(k) used here are defined as the sum over odd values of i of (n choose i) i^k. Their 2-exponents nu(T_n(k)) are important in algebraic topology. We provide many specific results, applying to all values of n,…

Number Theory · Mathematics 2011-09-23 Donald M. Davis

The Thue-Morse set $\mathcal{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-10-22 Émilie Charlier , Célia Cisternino , Adeline Massuir

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…

Dynamical Systems · Mathematics 2014-03-11 Qinghui Liu , Yanhui Qu

We describe factor frequencies of the generalized Thue-Morse word t_{b,m} defined for integers b greater than 1, m greater than 0 as the fixed point starting in 0 of the morphism \phi_{b,m} given by \phi_{b,m}(k)=k(k+1)...(k+b-1), where k =…

Combinatorics · Mathematics 2013-02-05 Lubomira Balkova

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

The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…

Combinatorics · Mathematics 2018-07-12 Lukas Spiegelhofer , Michael Wallner
‹ Prev 1 2 3 10 Next ›