691 research outputs found

    Relation between powers of factors and recurrence function characterizing Sturmian words

    Get PDF
    In this paper we use the relation of the index of an infinite aperiodic word and its recurrence function to give another characterization of Sturmian words. As a byproduct, we give a new proof of theorem describing the index of a Sturmian word in terms of the continued fraction expansion of its slope. This theorem was independently proved by Carpi and de Luca, and Damanik and Lenz.Comment: 11 page

    Characterization of repetitions in Sturmian words: A new proof

    Full text link
    We present a new, dynamical way to study powers (that is, repetitions) in Sturmian words based on results from Diophantine approximation theory. As a result, we provide an alternative and shorter proof of a result by Damanik and Lenz characterizing powers in Sturmian words [Powers in Sturmian sequences, Eur. J. Combin. 24 (2003), 377--390]. Further, as a consequence, we obtain a previously known formula for the fractional index of a Sturmian word based on the continued fraction expansion of its slope.Comment: 9 pages, 1 figur

    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

    Enumerating Abelian Returns to Prefixes of Sturmian Words

    Full text link
    We follow the works of Puzynina and Zamboni, and Rigo et al. on abelian returns in Sturmian words. We determine the cardinality of the set APRu\mathcal{APR}_u of abelian returns of all prefixes of a Sturmian word uu in terms of the coefficients of the continued fraction of the slope, dependingly on the intercept. We provide a simple algorithm for finding the set APRu\mathcal{APR}_u and we determine it for the characteristic Sturmian words.Comment: 19page
    corecore