79 research outputs found

    A characterization of balanced episturmian sequences

    Full text link
    It is well known that Sturmian sequences are the aperiodic sequences that are balanced over a 2-letter alphabet. They are also characterized by their complexity: they have exactly (n+1)(n+1) factors of length nn. One possible generalization of Sturmian sequences is the set of infinite sequences over a kk-letter alphabet, k3k \geq 3, which are closed under reversal and have at most one right special factor for each length. This is the set of episturmian sequences. These are not necessarily balanced over a kk-letter alphabet, nor are they necessarily aperiodic. In this paper, we characterize balanced episturmian sequences, periodic or not, and prove Fraenkel's conjecture for the class of episturmian sequences. This conjecture was first introduced in number theory and has remained unsolved for more than 30 years. It states that for a fixed k>2k> 2, there is only one way to cover Z\Z by kk Beatty sequences. The problem can be translated to combinatorics on words: for a kk-letter alphabet, there exists only one balanced sequence up to letter permutation that has different letter frequencies

    Extremal properties of (epi)Sturmian sequences and distribution modulo 1

    Get PDF
    Starting from a study of Y. Bugeaud and A. Dubickas (2005) on a question in distribution of real numbers modulo 1 via combinatorics on words, we survey some combinatorial properties of (epi)Sturmian sequences and distribution modulo 1 in connection to their work. In particular we focus on extremal properties of (epi)Sturmian sequences, some of which have been rediscovered several times

    Characterizations of finite and infinite episturmian words via lexicographic orderings

    Get PDF
    In this paper, we characterize by lexicographic order all finite Sturmian and episturmian words, i.e., all (finite) factors of such infinite words. Consequently, we obtain a characterization of infinite episturmian words in a "wide sense" (episturmian and episkew infinite words). That is, we characterize the set of all infinite words whose factors are (finite) episturmian. Similarly, we characterize by lexicographic order all balanced infinite words over a 2-letter alphabet; in other words, all Sturmian and skew infinite words, the factors of which are (finite) Sturmian.Comment: 18 pages; to appear in the European Journal of Combinatoric

    A local balance property of episturmian words

    Full text link
    We prove that episturmian words and Arnoux-Rauzy sequences can be characterized using a local balance property. We also give a new characterization of epistandard words and show that the set of finite words that are not factors of an episturmian word is not context-free

    Directive words of episturmian words: equivalences and normalization

    Get PDF
    Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing a common episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As a consequence of these results, we characterize episturmian words having a unique directive word.Comment: 15 page

    On the Structure of Bispecial Sturmian Words

    Full text link
    A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words. A Sturmian word is bispecial if it can be extended to the left and to the right with both letters remaining a Sturmian word. There is a deep relation between bispecial Sturmian words and Christoffel words, that are the digital approximations of Euclidean segments in the plane. In 1997, J. Berstel and A. de Luca proved that \emph{palindromic} bispecial Sturmian words are precisely the maximal internal factors of \emph{primitive} Christoffel words. We extend this result by showing that bispecial Sturmian words are precisely the maximal internal factors of \emph{all} Christoffel words. Our characterization allows us to give an enumerative formula for bispecial Sturmian words. We also investigate the minimal forbidden words for the language of Sturmian words.Comment: arXiv admin note: substantial text overlap with arXiv:1204.167

    Episturmian words: a survey

    Get PDF
    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 properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their connection to the balance property, and related notions such as finite episturmian words, Arnoux-Rauzy sequences, and "episkew words" that generalize the skew words of Morse and Hedlund.Comment: 36 pages; major revision: improvements + new material + more reference

    On sets of indefinitely desubstitutable words

    Full text link
    The stable set associated to a given set S of nonerasing endomorphisms or substitutions is the set of all right infinite words that can be indefinitely desubstituted over S. This notion generalizes the notion of sets of fixed points of morphisms. It is linked to S-adicity and to property preserving morphisms. Two main questions are considered. Which known sets of infinite words are stable sets? Which ones are stable sets of a finite set of substitutions? While bringing answers to the previous questions, some new characterizations of several well-known sets of words such as the set of binary balanced words or the set of episturmian words are presented. A characterization of the set of nonerasing endomorphisms that preserve episturmian words is also provided

    A Coloring Problem for Infinite Words

    Full text link
    In this paper we consider the following question in the spirit of Ramsey theory: Given xAω,x\in A^\omega, where AA is a finite non-empty set, does there exist a finite coloring of the non-empty factors of xx with the property that no factorization of xx is monochromatic? We prove that this question has a positive answer using two colors for almost all words relative to the standard Bernoulli measure on Aω.A^\omega. We also show that it has a positive answer for various classes of uniformly recurrent words, including all aperiodic balanced words, and all words xAωx\in A^\omega satisfying λx(n+1)λx(n)=1\lambda_x(n+1)-\lambda_x(n)=1 for all nn sufficiently large, where λx(n) \lambda_x(n) denotes the number of distinct factors of xx of length n.n.Comment: arXiv admin note: incorporates 1301.526

    Quasiperiodic and Lyndon episturmian words

    Get PDF
    Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in terms of their "directive words". Even further, we establish a complete characterization of all episturmian words that are Lyndon words. Our main results show that, unlike the Sturmian case, there is a much wider class of episturmian words that are non-quasiperiodic, besides those that are infinite Lyndon words. Our key tools are morphisms and directive words, in particular "normalized" directive words, which we introduced in an earlier paper. Also of importance is the use of "return words" to characterize quasiperiodic episturmian words, since such a method could be useful in other contexts.Comment: 33 pages; minor change
    corecore