Skip to main content

A Square Root Map on Sturmian Words

(Extended Abstract)

  • Conference paper
  • First Online:
Combinatorics on Words (WORDS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9304))

Included in the following conference series:

  • International Conference on Combinatorics on Words
  • 448 Accesses

Abstract

We introduce a square root map on Sturmian words and study its properties. Given a Sturmian word of slope \(\alpha \), there exists exactly six minimal squares in its language. A minimal square does not have a square as a proper prefix. A Sturmian word s of slope \(\alpha \) can be written as a product of these six minimal squares: \(s = X_1^2 X_2^2 X_3^2 \cdots \). The square root of s is defined to be the word \(\sqrt{s} = X_1 X_2 X_3 \cdots \). We prove that \(\sqrt{s}\) is also a Sturmian word of slope \(\alpha \). Moreover, we describe how to find the intercept of \(\sqrt{s}\) and an occurrence of any prefix of \(\sqrt{s}\) in s. Related to the square root map, we characterize the solutions of the word equation \(X_1^2 X_2^2 \cdots X_m^2 = (X_1 X_2 \cdots X_m)^2\) in the language of Sturmian words of slope \(\alpha \) where the words \(X_i^2\) are minimal squares of slope \(\alpha \).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Khinchin, A.Ya.: Continued Fractions. Dover Publications, New York (1997)

    Google Scholar 

  2. Berstel, J.: On the index of Sturmian words. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Jewels Are Forever, pp. 287–294. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  3. Cassels, J.W.S.: An Introduction to Diophantine Approximation. Cambridge Tracts in Mathematics and Mathematical Physics, vol. 45. Cambridge University Press, Cambridge (1957)

    MATH  Google Scholar 

  4. Damanik, D., Lenz, D.: Powers in Sturmian sequences. Eur. J. Comb. 24, 377–390 (2003). doi:10.1016/S0304-3975(99)90294-3

    Article  MathSciNet  MATH  Google Scholar 

  5. Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and Its Applications, vol. 90. Cambridge University Press, Cambridge (2002)

    Book  MATH  Google Scholar 

  6. Peltomäki, J.: Characterization of repetitions in Sturmian words: a new proof. Inform. Process. Lett. 115(11), 886–891 (2015). doi:10.1016/j.ipl.2015.05.011

    Article  MathSciNet  Google Scholar 

  7. Pytheas Fogg, N.: Substitutions in Dynamics, Arithmetics and Combinatorics. Lecture Notes in Mathematics, vol. 1794. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  8. Saari, K.: Everywhere \(\alpha \)-repetitive sequences and Sturmian words. Eur. J. Comb. 31, 177–192 (2010). doi:10.1016/j.ejc.2009.01.004

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We thank our supervisors Juhani Karhumäki and Luca Zamboni for suggesting that the square root map might preserve the language of a Sturmian word.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jarkko Peltomäki .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Peltomäki, J., Whiteland, M. (2015). A Square Root Map on Sturmian Words. In: Manea, F., Nowotka, D. (eds) Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science(), vol 9304. Springer, Cham. https://doi.org/10.1007/978-3-319-23660-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23660-5_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23659-9

  • Online ISBN: 978-3-319-23660-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics