Powers in Sturmian sequences

Authors:
David Damanik;Daniel Lenz
Affiliations:
Department of Mathematics 253-37, California Institute of Technology, Pasadena, CA;Fakultät für Mathematik, TU Chemnitz, D-09107 Chemnitz, Germany
Venue:
European Journal of Combinatorics
Year:
2003

Citing 9
Cited 7

On the number of factors of Sturmian words

Theoretical Computer Science
Fibonacci numbers and words

Discrete Mathematics
The exact number of squares in Fibonacci words

Theoretical Computer Science
Sturmian words and words with a critical exponent

Theoretical Computer Science
Special factors, periodicity, and an application to Sturmian words

Acta Informatica
Fractional powers in Sturmian words

Theoretical Computer Science
The index of Sturmian sequences

European Journal of Combinatorics
On the Index of Sturmian Words

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Hierarchical structures in Sturmian dynamical systems

Theoretical Computer Science - Special issue: Tilings of the plane

Reversals and palindromes in continued fractions

Theoretical Computer Science
Powers in a class of A-strict standard episturmian words

Theoretical Computer Science
Some properties of the Tribonacci sequence

European Journal of Combinatorics
Factors of characteristic words: Location and decompositions

Theoretical Computer Science
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers

Theoretical Computer Science
On the maximum number of cubic subwords in a word

European Journal of Combinatorics
Computing the number of cubic runs in standard Sturmian words

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider Sturmian sequences and explicitly determine all the integer powers occurring in them. Our approach is purely combinatorial and is based on canonical decompositions of Sturmian sequences and properties of their building blocks.