Squares and cubes in Sturmian sequences

Artūras Dubickas

RAIRO - Theoretical Informatics and Applications (2009)

  • Volume: 43, Issue: 3, page 615-624
  • ISSN: 0988-3754

Abstract

top
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.

How to cite

top

Dubickas, Artūras. "Squares and cubes in Sturmian sequences." RAIRO - Theoretical Informatics and Applications 43.3 (2009): 615-624. <http://eudml.org/doc/250615>.

@article{Dubickas2009,
abstract = { 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. },
author = {Dubickas, Artūras},
journal = {RAIRO - Theoretical Informatics and Applications},
keywords = {Sturmian word; block-complexity; stammering word.; stammering word},
language = {eng},
month = {3},
number = {3},
pages = {615-624},
publisher = {EDP Sciences},
title = {Squares and cubes in Sturmian sequences},
url = {http://eudml.org/doc/250615},
volume = {43},
year = {2009},
}

TY - JOUR
AU - Dubickas, Artūras
TI - Squares and cubes in Sturmian sequences
JO - RAIRO - Theoretical Informatics and Applications
DA - 2009/3//
PB - EDP Sciences
VL - 43
IS - 3
SP - 615
EP - 624
AB - 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.
LA - eng
KW - Sturmian word; block-complexity; stammering word.; stammering word
UR - http://eudml.org/doc/250615
ER -

References

top
  1. B. Adamczewski and Y. Bugeaud, On the complexity of algebraic numbers I. Expansion in integer bases. Ann. Math.165 (2007) 547–565.  
  2. B. Adamczewski and Y. Bugeaud, Dynamics for β-shifts and Diophantine approximation. Ergod. Theory Dyn. Syst.27 (2007) 1695–1711.  
  3. B. Adamczewski and N. Rampersad, On patterns occuring in binary algebraic numbers. Proc. Amer. Math. Soc.136 (2008) 3105–3109.  
  4. J.-P. Allouche, J.P. Davison, M. Queffélec and L.Q. Zamboni, Transcendence of Sturmian or morphic continued fractions. J. Number Theory91 (2001) 39–66.  
  5. J.-P. Allouche and J. Shallit, Automatic sequences, Theory, applications, generalizations. CUP, Cambridge (2003).  
  6. J. Berstel, On the index of Sturmian words. In Jewels are Forever, Contributions on theoretical computer science in honor of Arto Salomaa, J. Karhumäki et al., eds. Springer, Berlin (1999) 287–294.  
  7. J. Berstel and J. Karhumäki, Combinatorics on words – a tutorial, in Current trends in theoretical computer science, The challenge of the new century, Vol. 2, Formal models and semantics, G. Paun, G. Rozenberg, A. Salomaa, eds. World Scientific, River Edge, NJ (2004) 415–475.  
  8. V. Berthé, C. Holton and L.Q. Zamboni, Initial powers of Sturmian sequences. Acta Arith.122 (2006) 315–347.  
  9. J. Cassaigne, On extremal properties of the Fibonacci word. RAIRO-Theor. Inf. Appl.42 (2008) 701–715.  
  10. E. Coven and G. Hedlund, Sequences with minimal block growth. Math. Syst. Theor.7 (1973) 138–153.  
  11. J.D. Currie and N. Rampersad, For each α > 2 there is an infinite binary word with critical exponent α, Electron. J. Combin.15 (2008) 5 p.  
  12. A. De Luca, Sturmian words: structure, combinatorics and their arithmetics. Theoret. Comput. Sci.183 (1997) 45–82.  
  13. D. Damanik, R. Killip and D. Lenz, Uniform spectral properties of one-dimensional quasicrystals, III. α-continuity. Commun. Math. Phys.212 (2000) 191–204.  
  14. A. Dubickas, Powers of a rational number modulo 1 cannot lie in a small interval (to appear).  
  15. S. Ferenczi and C. Mauduit, Transcendence of numbers with low complexity expansion. J. Number Theory67 (1997) 146–161.  
  16. A.S. Fraenkel, M. Mushkin and U. Tassa, Determination of [nθ] by its sequence of differences. Canad. Math. Bull.21 (1978) 441–446.  
  17. S. Ito and S. Yasutomi, On continued fractions, substitutions and characteristic sequences. Jpn J. Math.16 (1990) 287–306.  
  18. J. Justin and L. Vuillon, Return words in Sturmian and episturmian words. RAIRO-Theor. Inf. Appl.34 (2000) 343–356.  
  19. D. Krieger and J. Shallit, Every real number greater than 1 is a critical exponent. Theoret. Comput. Sci.381 (2007) 177–182.  
  20. M. Lothaire, Algebraic combinatorics on words, Encyclopedia of Mathematics and Its Applications, Vol. 90. CUP, Cambridge (2002).  
  21. K. Mahler, An unsolved problem on the powers of 3/2. J. Austral. Math. Soc.8 (1968) 313–321.  
  22. F. Mignosi, On the number of factors of Sturmian words. Theoret. Comput. Sci.82 (1991) 71–84.  
  23. M. Morse and G.A. Hedlund, Symbolic dynamics II: Sturmian sequences. Amer. J. Math.62 (1940) 1–42.  
  24. N. Pytheas Fogg, Substitutions in dynamics, arithmetics and combinatorics. Lect. Notes Math.1794 (2002).  
  25. K.B. Stolarsky, Beatty sequences, continued fractions, and certain shift operators. Canad. Math. Bull.19 (1976) 473–482.  
  26. D. Vandeth, Sturmian words and words with a critical exponent. Theoret. Comput. Sci.242 (2000) 283–300.  
  27. L. Vuillon, A characterization of Sturmian words by return words. Eur. J. Combin.22 (2001) 263–275.  

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.