相关论文: On two conjectures of Shallit about Thue-Morse-lik…
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…
We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian…
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…
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$…
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…
Infinite products associated with the $\pm 1$ Thue-Morse sequence whose value is rational or algebraic irrational have been studied by several authors. In this short note we prove three new infinite product identities involving ${\pi}$,…
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…
Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number of times in both words. The $k$-binomial complexity of an infinite word is a counting function that maps $n$ to the number of $k$-binomial…
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…
Recently Dekking conjectured the form of the subword complexity function for the Fibonacci-Thue-Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.
Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…
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…
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…
In this paper we investigate local to global phenomena for a new family of complexity functions of infinite words indexed by $k \in \Ni \cup \{+\infty\}$ where $\Ni$ denotes the set of positive integers. Two finite words $u$ and $v$ in…
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the property that for infinitely many n, every length-n factor is a product of two palindromes. We show that every Sturmian word has this property,…
In this paper we study the privileged complexity function of the Thue-Morse word. We prove a recursive formula describing this function, and using the formula we show that the function is unbounded and that the values of the function have…
The Nyldon factorization is a string factorization that is a non-decreasing product of Nyldon words. Nyldon words and Nyldon factorizations are recently defined combinatorial objects inspired by the well-known Lyndon words and Lyndon…
Two polynomials $F_k(X_1,\dots,X_k)$ and $\Theta_k(X_1,\dots,X_k)$ over $\Bbb F_2$ arose from the study of a conjecture by C. Carlet about the sum-freedom of the multiplicative inverse function of $\Bbb F_{2^n}$. Both $F_k$ and $\Theta_k$…
The initial non-repetitive complexity function of an infinite word x (first defined by Moothathu) is the function of n that counts the number of distinct factors of length n that appear at the beginning of x prior to the first repetition of…
We introduce and study a complexity function on words $c_x(n),$ called \emph{cyclic complexity}, which counts the number of conjugacy classes of factors of length $n$ of an infinite word $x.$ We extend the well-known Morse-Hedlund theorem…