相关论文: Thue-Morse-Sturmian words and critical bases for t…

Expansions in noninteger bases often appear in number theory and probability theory, and they are closely connected to ergodic theory, measure theory and topology. For two-letter alphabets the golden ratio plays a special role: in smaller…

Glendinning and Sidorov discovered an important feature of the Komornik-Loreti constant $q'\approx1.78723$ in non-integer base expansions on two-letter alphabets: in bases $1<q<q'$ only countably numbers have unique expansions, while 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$…

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…

Given a finite set of real numbers $A$, the generalised golden ratio is the unique real number $\mathcal{G}(A) > 1$ for which we only have trivial unique expansions in smaller bases, and have non-trivial unique expansions in larger bases.…

An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct…

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

Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…

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…

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

Let $\theta = [0; a_1, a_2, \dots]$ be the continued fraction expansion of an irrational real number $\theta \in (0, 1)$. It is well-known that the characteristic Sturmian word of slope $\theta$ is the limit of a sequence of finite words…

In this article, first we generalize the Thue-Morse sequence $(a(n))_{n=0}^\infty$ (the generalized Thue-Morse sequences) by a cyclic permutation and $k$ -adic expansion of natural numbers, and consider the necessary-sufficient condition…

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…

Let $q$ be a positive integer. Consider an infinite word $\omega=w_0w_1w_2\cdots$ over an alphabet of cardinality $q$. A finite word $u$ is called an arithmetic factor of $\omega$ if $u=w_cw_{c+d}w_{c+2d}\cdots w_{c+(|u|-1)d}$ for some…

In this paper, we investigate the combinatorial and density properties of infinite words generated by Fibonacci-type morphisms, focusing on their subword structure, palindrome density, and extremal statistical behaviors. Using the morphism…

Given a positive integer $N$ and $x$ irrational between zero and one, an $N$-continued fraction expansion of $x$ is defined analogously to the classical continued fraction expansion, but with the numerators being all equal to $N$. Inspired…

We revisit the topic of power-free morphisms, focusing on the properties of the class of complementary morphisms. Such morphisms are defined over a $2$-letter alphabet, and map the letters 0 and 1 to complementary words. We prove that every…

We study the properties of the uncountable set of Stewart words. These are Toeplitz words specified by infinite sequences of Toeplitz patterns of the form $\alpha\beta\gamma$, where $\alpha,\beta,\gamma$ is any permutation of the symbols…

In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…

Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences describing discrete lines. They are famous and have been…