English

Powers in a class of A-strict standard episturmian words

Combinatorics 2010-03-16 v1 Discrete Mathematics

Abstract

This paper concerns a specific class of strict standard episturmian words whose directive words resemble those of characteristic Sturmian words. In particular, we explicitly determine all integer powers occurring in such infinite words, extending recent results of Damanik and Lenz (2003), who studied powers in Sturmian words. The key tools in our analysis are canonical decompositions and a generalization of singular words, which were originally defined for the ubiquitous Fibonacci word. Our main results are demonstrated via some examples, including the kk-bonacci word: a generalization of the Fibonacci word to a kk-letter alphabet (k2k\geq2).

Keywords

Cite

@article{arxiv.0708.4400,
  title  = {Powers in a class of A-strict standard episturmian words},
  author = {Amy Glen},
  journal= {arXiv preprint arXiv:0708.4400},
  year   = {2010}
}

Comments

26 pages; extended version of a paper presented at the 5th International Conference on Words, Montreal, Canada, September 13-17, 2005