English
Related papers

Related papers: Thue--Morse along the sequence of cubes

200 papers

For a nonnegative integer $t$, let $c_t$ be the asymptotic density of natural numbers $n$ for which $s(n + t) \geq s(n)$, where $s(n)$ denotes the sum of digits of $n$ in base $2$. We prove that $c_t > 1/2$ for $t$ in a set of asymptotic…

Combinatorics · Mathematics 2016-05-03 Michael Drmota , Manuel Kauers , Lukas Spiegelhofer

The Thue-Morse sequence is an aperiodically ordered infinite binary sequence. It is used as a one-dimensional way to model the structure of a quasicrystal. For example, taking autocorrelations of these sequences (roughly, measuring how…

Statistical Mechanics · Physics 2022-09-23 Darren C. Ong

Letting $(t_n)$ denote the Thue-Morse sequence with values $0, 1$, we note that the Woods-Robbins product $$ \prod_{n \geq 0} \left(\frac{2n+1}{2n+2}\right)^{(-1)^{t_n}} = 2^{-1/2} $$ involves a rational function in $n$ and the $\pm 1$…

Number Theory · Mathematics 2017-09-13 Jean-Paul Allouche , Samin Riasat , Jeffrey Shallit

In this article we introduce a new approach to compute infinite products defined by automatic sequences involving the Thue-Morse sequence. As examples, for any positive integers $q$ and $r$ such that $0 \leq r \leq q-1$, we find infinitely…

Combinatorics · Mathematics 2020-06-11 Shuo Li

Let $(u_n)_{n\ge 0}$ denote the Thue-Morse sequence with values $\pm 1$. The Woods-Robbins identity below and several of its generalisations are well-known in the literature…

Number Theory · Mathematics 2018-05-17 Samin Riasat

Given an integer $q\ge2$ and $\theta_1,\cdots,\theta_{q-1}\in\{0,1\}$, let $(\theta_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0\theta_1\cdots\theta_{q-1}$$…

Number Theory · Mathematics 2020-06-09 Yao-Qiang Li

We consider the generalized Thue-Morse sequences $(t_n^{(c)})_{n\ge 0}$ ($c \in [0,1)$ being a parameter) defined by $t_n^{(c)} = e^{2\pi i c s_2(n)}$, where $s_2(n)$ is the sum of digits of the binary expansion of $n$. For the polynomials…

Dynamical Systems · Mathematics 2022-12-27 Aihua Fan , Jörg Schmeling , Weixiao Shen

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

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

In this paper we study correlation measures introduced in \cite{emme_asymptotic_2017}. Denote by $\mu_a(d)$ the asymptotic density of the set $\mathcal{E}_{a,d}=\{n \in \mathbb{N}, \ s_2(n+a)-s_2(n)=d\}$ (where $s_2$ is the sum-of-digits…

Dynamical Systems · Mathematics 2018-10-29 Jordan Emme , Pascal Hubert

One of the fundamental theorems of uniform distribution theory states that the fractional parts of the sequence $(n \alpha)_{n \geq 1}$ are uniformly distributed modulo one (u.d. mod 1) for every irrational number $\alpha$. Another…

Number Theory · Mathematics 2015-02-26 Christoph Aistleitner , Roswitha Hofer , Gerhard Larcher

Given an integer $q\ge 2$ and a real number $c\in [0,1)$, consider the generalized Thue-Morse sequence $(t_n^{(q;c)})_{n\ge 0}$ defined by $t_n^{(q;c)} = e^{2\pi i c S_q(n)}$, where $S_q(n)$ is the sum of digits of the $q$-expansion of $n$.…

Dynamical Systems · Mathematics 2021-04-07 Aihua Fan , Joerg Schmeling , Weixiao Shen

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 prove that the generalized Thue-Morse word $\mathbf{t}_{b,m}$ defined for $b \geq 2$ and $m \geq 1$ as $\mathbf{t}_{b,m} = (s_b(n) \mod m)_{n=0}^{+\infty}$, where $s_b(n)$ denotes the sum of digits in the base-$b$ representation of the…

Combinatorics · Mathematics 2015-03-12 Štěpán Starosta

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…

Number Theory · Mathematics 2026-05-26 Nathan McNew , Carl Pomerance

We put forward several general conjectures concerning the algebraicity or transcendence of continued fractions and Stieltjes continued fractions defined by the Thue-Morse and period-doubling sequences in characteristic $2$. We present our…

Number Theory · Mathematics 2020-06-23 Yining Hu , Guoniu Wei-Han

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq…

Combinatorics · Mathematics 2013-03-05 Michelangelo Bucci , Neil Hindman , Svetlana Puzynina , Luca Q. Zamboni

Let $p$ be a prime number and consider a $p$-automatic sequence ${\bf u}=(u_{n})_{n\in\N}$ and its generating function $U(X)=\sum_{n=0}^{\infty}u_{n}X^{n}\in\mathbb{F}_{p}[[X]]$. Moreover, let us suppose that $u_{0}=0$ and $u_{1}\neq 0$ and…

Combinatorics · Mathematics 2016-01-20 Maciej Gawro , Maciej Ulas

Let $(t_n)_{n\ge0}$ be the well konwn $\pm1$ Thue-Morse sequence $$+1,-1,-1,+1,-1,+1,+1,-1,\cdots.$$ Since the 1982-1983 work of Coquet and Dekking, it is known that $\sum_{k<n}t_ke^\frac{2k\pi i}{3}$ is strongly related to the famous Koch…

Dynamical Systems · Mathematics 2021-10-04 Yao-Qiang Li

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