9 research outputs found

    A characterization of power-free morphisms

    Get PDF
    AbstractA word is called kth power-free if it does not contain any non-empty factor uk. A morphism is kth power-free if it preserves kth power-free words. A morphism is power-free if it is kth power-free for every K > 1.We show that it is decidable whether a morphism is power-free; more precisely, we prove that a morphism h is power-free iff: h is a square-free morphism and, for each letter a, the image h(a2) is cube-free

    A powerful abelian square-free substitution over 4 letters

    Get PDF
    AbstractIn 1961, Paul Erdös posed the question whether abelian squares can be avoided in arbitrarily long words over a finite alphabet. An abelian square is a non-empty word uv, where u and v are permutations (anagrams) of each other. The case of the four letter alphabet Σ4={a,b,c,d} turned out to be the most challenging and remained open until 1992 when the author presented an abelian square-free (a-2-free) endomorphism g85 of Σ4∗. The size of this g85, i.e., |g85(abcd)|, is equal to 4×85 (uniform modulus). Until recently, all known methods for constructing arbitrarily long a-2-free words on Σ4 have been based on the structure of g85 and on the endomorphism g98 of Σ4∗ found in 2002.In this paper, a great many new a-2-free endomorphisms of Σ4∗ are reported. The sizes of these endomorphisms range from 4×102 to 4×115. Importantly, twelve of the new a-2-free endomorphisms, of modulus m=109, can be used to construct an a-2-free (commutatively functional) substitution σ109 of Σ4∗ with 12 image words for each letter.The properties of σ109 lead to a considerable improvement for the lower bound of the exponential growth of cn, i.e., of the number of a-2-free words over 4 letters of length n. It is obtained that cn>β−50βn with β=121/m≃1.02306. Originally, in 1998, Carpi established the exponential growth of cn by showing that cn>β−tβn with β=219/t=219/(853−85)≃1.000021, where t=853−85 is the modulus of the substitution that he constructs starting from g85

    Periodicity, repetitions, and orbits of an automatic sequence

    Get PDF
    We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately periodic. We prove that it is decidable whether a given k-automatic sequence is overlap-free (or squareefree, or cubefree, etc.) We prove that the lexicographically least sequence in the orbit closure of a k-automatic sequence is k-automatic, and use this last result to show that several related quantities, such as the critical exponent, irrationality measure, and recurrence quotient for Sturmian words with slope alpha, have automatic continued fraction expansions if alpha does.Comment: preliminary versio

    Power-free Complementary Binary Morphisms

    Full text link
    We revisit the topic of power-free morphisms, focusing on the properties of the class of complementary morphisms. Such morphisms are defined over a 22-letter alphabet, and map the letters 0 and 1 to complementary words. We prove that every prefix of the famous Thue-Morse word t\mathbf{t} gives a complementary morphism that is 3+3^+-free and hence α\alpha-free for every real number α>3\alpha>3. We also describe, using a 4-state binary finite automaton, the lengths of all prefixes of t\mathbf{t} that give cubefree complementary morphisms. Next, we show that 33-free (cubefree) complementary morphisms of length kk exist for all k∉{3,6}k\not\in \{3,6\}. Moreover, if kk is not of the form 3⋅2n3\cdot2^n, then the images of letters can be chosen to be factors of t\mathbf{t}. Finally, we observe that each cubefree complementary morphism is also α\alpha-free for some α<3\alpha<3; in contrast, no binary morphism that maps each letter to a word of length 3 (resp., a word of length 6) is α\alpha-free for any α<3\alpha<3. In addition to more traditional techniques of combinatorics on words, we also rely on the Walnut theorem-prover. Its use and limitations are discussed

    Critical Exponents and Stabilizers of Infinite Words

    Get PDF
    This thesis concerns infinite words over finite alphabets. It contributes to two topics in this area: critical exponents and stabilizers. Let w be a right-infinite word defined over a finite alphabet. The critical exponent of w is the supremum of the set of exponents r such that w contains an r-power as a subword. Most of the thesis (Chapters 3 through 7) is devoted to critical exponents. Chapter 3 is a survey of previous research on critical exponents and repetitions in morphic words. In Chapter 4 we prove that every real number greater than 1 is the critical exponent of some right-infinite word over some finite alphabet. Our proof is constructive. In Chapter 5 we characterize critical exponents of pure morphic words generated by uniform binary morphisms. We also give an explicit formula to compute these critical exponents, based on a well-defined prefix of the infinite word. In Chapter 6 we generalize our results to pure morphic words generated by non-erasing morphisms over any finite alphabet. We prove that critical exponents of such words are algebraic, of a degree bounded by the alphabet size. Under certain conditions, our proof implies an algorithm for computing the critical exponent. We demonstrate our method by computing the critical exponent of some families of infinite words. In particular, in Chapter 7 we compute the critical exponent of the Arshon word of order n for n ≥ 3. The stabilizer of an infinite word w defined over a finite alphabet Σ is the set of morphisms f: Σ*→Σ* that fix w. In Chapter 8 we study various problems related to stabilizers and their generators. We show that over a binary alphabet, there exist stabilizers with at least n generators for all n. Over a ternary alphabet, the monoid of morphisms generating a given infinite word by iteration can be infinitely generated, even when the word is generated by iterating an invertible primitive morphism. Stabilizers of strict epistandard words are cyclic when non-trivial, while stabilizers of ultimately strict epistandard words are always non-trivial. For this latter family of words, we give a characterization of stabilizer elements. We conclude with a list of open problems, including a new problem that has not been addressed yet: the D0L repetition threshold
    corecore