English
Related papers

Related papers: To Symbolic Dynamics Through The Thue-Morse Sequen…

200 papers

Using three examples of sequences over a finite alphabet, we want to draw attention to the fact that these sequences having the minimum critical exponent in a given class of sequences show a large degree of symmetry, i.e., they are G-rich…

Combinatorics · Mathematics 2025-01-28 Lubomíra Dvořáková , Edita Pelantová

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

Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…

Number Theory · Mathematics 2021-05-10 László Mérai , Arne Winterhof

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,…

Dynamical Systems · Mathematics 2023-05-22 Luis-Miguel Lopez , Philippe Narbel

We consider a numeration system in the ring of integers ${\mathcal O}_K$ of a number field, which we assume to be principal. We prove that the property of being a prime in ${\mathcal O}_K$ is decorrelated from two fundamental examples of…

Number Theory · Mathematics 2022-01-28 Sary Drappeau , Gautier Hanna

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

A Sturmian sequence is an infinite nonperiodic string over two letters with minimal subword complexity. In two papers, the first written by Morse and Hedlund in 1940 and the second by Coven and Hedlund in 1973, a surprising correspondence…

Number Theory · Mathematics 2020-09-01 Jörg M. Thuswaldner

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

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

Nous d\'ecrivons quelques r\'esultats r\'ecents sur la suite de Thue-Morse, ainsi que des questions ou conjectures, dont l'une, due \`a Shevelev, est r\'esolue dans cet article. We describe some recent results on the Thue-Morse sequence. We…

Number Theory · Mathematics 2014-02-04 Jean-Paul Allouche

We report on a peculiar effect regarding the use of the prime's last digit sequence which is equivalent to a quaternary symbolic sequence. This was used as a driving sequence for the recently introduced Schramm-Loewner Evolution after using…

General Physics · Physics 2022-03-22 Theophanes Raptis , Alberto Fraile

For an integer $q\ge2$, a $q$-recursive sequence is defined by recurrence relations on subsequences of indices modulo some powers of~$q$. In this article, $q$-recursive sequences are studied and the asymptotic behavior of their summatory…

Combinatorics · Mathematics 2024-02-28 Clemens Heuberger , Daniel Krenn , Gabriel F. Lipnik

Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…

Combinatorics · Mathematics 2022-11-07 Nathan Fox

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

In this work we study $S$-adic shifts generated by sequences of morphisms that are constant-length. We call a sequence of constant-length morphisms torsion-free if any prime divisor of one of the lengths is a divisor of infinitely many of…

Dynamical Systems · Mathematics 2023-05-16 Álvaro Bustos-Gajardo , Neil Mañibo , Reem Yassawi

In the first half of the paper we construct a Morse-type theory on certain spaces of braid diagrams. We define a topological invariant of closed positive braids which is correlated with the existence of invariant sets of parabolic flows…

Dynamical Systems · Mathematics 2007-05-23 R. W. Ghrist , J. B. Van den Berg , R. C. Vandervorst

We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…

Dynamical Systems · Mathematics 2009-05-07 John Smillie , Corinna Ulcigrai

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…

Geometric Topology · Mathematics 2025-07-11 Sagnik Jana , Yulan Qing

We study a class of infinite words $x_k$ , where $k$ is a positive integer, recently introduced by J. Shallit. This class includes the Thue-Morse sequence $x_1$, the Fibonacci-Thue-Morse sequence $x_2$, and the Allouche-Johnson sequence…

Combinatorics · Mathematics 2025-10-16 Lubomíra Dvořáková , Savinien Kreczman , Edita Pelantová

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…

Combinatorics · Mathematics 2019-10-31 Zhimin Sun , Arne Winterhof