Skip to main content

Circularly Squarefree Words and Unbordered Conjugates: A New Approach

  • Conference paper
  • First Online:
  • 287 Accesses

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

Abstract

Using a new approach based on automatic sequences, logic, and a decision procedure, we reprove some old theorems about circularly squarefree words and unbordered conjugates in a new and simpler way. Furthermore, we prove two new results about unbordered conjugates: we complete the classification, due to Harju and Nowotka, of binary words with the maximum number of unbordered conjugates, and we prove that for every possible number, up to the maximum, there exists a word having that number of unbordered conjugates.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)

    Book  Google Scholar 

  2. Allouche, J.P., Shallit, J.O.: The ubiquitous Prouhet-Thue-Morse sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and Their Applications. DISCMATH, pp. 1–16. Springer, London (1999)

    Google Scholar 

  3. Berstel, J.: Sur la construction de mots sans carré. Séminaire de Théorie des Nombres, pp. 18.01–18.15 (1978–1979)

    Google Scholar 

  4. Berstel, J.: Axel Thue’s Papers on Repetitions in Words: a Translation. No. 20 in Publications du Laboratoire de Combinatoire et d’Informatique Mathématique, Université du Québec à Montréal, February 1995

    Google Scholar 

  5. Bruyère, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and \(p\)-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 191–238 (1994). corrigendum, Bull. Belg. Math. Soc. 1, 577 (1994)

    MathSciNet  MATH  Google Scholar 

  6. Currie, J.: There are ternary circular square-free words of length \(n\) for \(n \ge 18\). Electron. J. Combin. 9, #N10 (2002). https://www.combinatorics.org/v9i1n10

  7. Harju, T., Nowotka, D.: Border correlation of binary words. J. Combin. Theory Ser. A 108, 331–341 (2004)

    Article  MathSciNet  Google Scholar 

  8. Harju, T., Nowotka, D.: Bordered conjugates of words over large alphabets. Electron. J. Combin. 15, #N41 (2008). https://www.combinatorics.org/ojs/index.php/eljc/article/view/v15i1n41

  9. Mousavi, H.: Automatic theorem proving in Walnut (2016), arxiv preprint arXiv:1603.06017. Software available at https://github.com/hamousavi/Walnut

  10. Shallit, J., Zarifi, R.: Circular critical exponents for Thue-Morse factors. RAIRO Inform. Théor. App. 53, 37–49 (2019)

    Article  MathSciNet  Google Scholar 

  11. Shur, A.M.: On ternary square-free circular words. Electron. J. Combin. 17, #R140 (2010). https://www.combinatorics.org/ojs/index.php/eljc/article/view/v17i1r140

  12. Thue, A.: Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1–22 (1906). reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, pp. 139–158 (1977)

    Google Scholar 

  13. Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1–67 (1912). reprinted in Selected Mathematical Papers of Axel Thue, T. Nagell, editor, Universitetsforlaget, Oslo, pp. 413–478 (1977)

    Google Scholar 

Download references

Acknowledgments

We thank Dirk Nowotka for helpful discussions. We are very grateful to the referees for helpful comments, and for reminding us about the paper [11].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jeffrey Shallit .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Clokie, T., Gabric, D., Shallit, J. (2019). Circularly Squarefree Words and Unbordered Conjugates: A New Approach. In: Mercaş, R., Reidenbach, D. (eds) Combinatorics on Words. WORDS 2019. Lecture Notes in Computer Science(), vol 11682. Springer, Cham. https://doi.org/10.1007/978-3-030-28796-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-28796-2_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-28795-5

  • Online ISBN: 978-3-030-28796-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics