Papers
Topics
Authors
Recent
Search
2000 character limit reached

Powers in a class of A-strict standard episturmian words

Published 31 Aug 2007 in math.CO and cs.DM | (0708.4400v1)

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 $k$-bonacci word: a generalization of the Fibonacci word to a $k$-letter alphabet ($k\geq2$).

Citations (16)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.