RAIRO-Theor. Inf. Appl.
Volume 43, Number 3, July-September 2009
|Page(s)||615 - 624|
|Published online||06 March 2009|
Squares and cubes in Sturmian sequences
Department of Mathematics and Informatics, Vilnius University,
Naugarduko 24, Vilnius 03225, Lithuania; firstname.lastname@example.org
Accepted: 5 February 2009
We prove that every Sturmian word ω has infinitely many prefixes of the form UnVn3, where |Un| < 2.855|Vn| and limn→∞|Vn| = ∞. In passing, we give a very simple proof of the known fact that every Sturmian word begins in arbitrarily long squares.
Mathematics Subject Classification: 68R15
Key words: Sturmian word / block-complexity / stammering word.
© EDP Sciences, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.