English
Related papers

Related papers: The Thue-Morse Transform

200 papers

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

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…

Discrete Mathematics · Computer Science 2011-09-29 Anna Frid , Luca Zamboni

We begin a systematic study of the relations between subword complexity of infinite words and their power avoidance. Among other things, we show that -- the Thue-Morse word has the minimum possible subword complexity over all overlap-free…

Formal Languages and Automata Theory · Computer Science 2020-07-07 Jeffrey Shallit , Arseny M. Shur

By choosing an unconventional polarization of the connection phase space in (2+1)-gravity on the torus, a modular invariant quantum theory is constructed. Unitary equivalence to the ADM-quantization is shown.

General Relativity and Quantum Cosmology · Physics 2009-10-28 Peter Peldan

The Thue--Morse sequence is a prototypical automatic sequence found in diverse areas of mathematics, and in computer science. We study occurrences of factors $w$ within this sequence, more precisely, the sequence of gaps between consecutive…

Combinatorics · Mathematics 2021-11-19 Lukas Spiegelhofer

We prove various results about the largest exponent of a repetition in a factor of the Thue-Morse word, when that factor is considered as a circular word. Our results confirm and generalize previous results of Fitzpatrick and Aberkane &…

Formal Languages and Automata Theory · Computer Science 2018-08-09 Jeffrey Shallit , Ramin Zarifi

We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated…

Combinatorics · Mathematics 2014-04-04 Tero Harju , Mari Huova , L. Q. Zamboni

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

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

We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…

Combinatorics · Mathematics 2015-06-03 Florian Greinecker

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

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 sequence is generalized to the $TM_m$ sequences and two equivalent definitions are given. This generalization leads to transcendental numbers and has Queff\'elec's theorem on Thue-Morse continued fractions as a special case.…

Number Theory · Mathematics 2013-02-11 Gerardo González Robert

For certain generalized Thue-Morse words t, we compute the "critical exponent", i.e., the supremum of the set of rational numbers that are exponents of powers in t, and determine exactly the occurrences of powers realizing it.

Combinatorics · Mathematics 2010-03-16 Alexandre Blondin-Massé , Srecko Brlek , Amy Glen , Sébastien Labbé

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

Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…

Combinatorics · Mathematics 2024-05-31 Moussa Barro , K. Ernest Bognini , Boucaré Kientéga

We present a 1-loop toroidal membrane winding sum reproducing the conjectured $M$-theory, four-graviton, eight derivative, $R^4$ amplitude. The $U$-duality and toroidal membrane world-volume modular groups appear as a Howe dual pair in a…

High Energy Physics - Theory · Physics 2010-01-15 Boris Pioline , Andrew Waldron

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) "Tribonacci-automatic". This class includes, for example, the famous Tribonacci word T =…

Formal Languages and Automata Theory · Computer Science 2014-07-29 Hamoon Mousavi , Jeffrey Shallit

We introduce a notion of a (V,T)-module over a vertex algebra V for an arbitrary positive integer T, which is a generalization of a twisted V-module. Under some conditions on V, we construct an associative algebra A^{T}_{m}(V) for…

Quantum Algebra · Mathematics 2016-03-07 Kenichiro Tanabe

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