Skip to main content
SpringerLink
Log in

Abelian Complexity of Thue-Morse Word over a Ternary Alphabet

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

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

Included in the following conference series:

Abstract

In this paper, we study the Thue-Morse word on a ternary alphabet. We establish some properties on special factors of this word and prove that it is 2-balanced. Moreover, we determine its Abelian complexity function.

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

Access this chapter

Log in via an institution
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. Allouche, J.P., Arnold, A., Berstel, J., Brlek, S., Jockush, W., Plouffe, S., Sagan, B.E.: A relative of the thue-morse sequence. Disc. Math. 139, 455–461 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Allouche, J.P., Peyrière, J., Wen, Z.-X., Wen, Z.-Y.: Hankel determinants of the thue-morse sequense. Ann. Inst. Fourier 48(1), 1–27 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Allouche, J.P., Shallit, J.: The Ubiquitous Prouhet-Thue-Morse Sequence. In: Ding, C., Helleseth, T., Niederreiter, H. (eds.) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science, pp. 1–16. Springer, London (1999)

    Google Scholar 

  4. Balkovà, L., Břinda, K., Turek, O.: Abelian complexity of infinite words associated with non-simple parry number. Theor. Comput. Sci. 412, 6252–6260 (2011)

    Article  MATH  Google Scholar 

  5. Cassaigne, J.: Facteurs spéciaux. Bull. Belg. Math. 4, 67–88 (1997)

    MathSciNet  MATH  Google Scholar 

  6. Cassaigne, J., Kaboré, I.: Abelian complexity and frequencies of letters in infinite words. Int. J. Found. Comput. Sci. 27(05), 631–649 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  7. Cassaigne, J., Richomme, G., Saari, K., Zamboni, L.Q.: Avoiding abelian powers in binary wordswith bounded abelian complexity. Int. J. Found. Comput. Sci. 22(2011), 905–920 (2011)

    Article  MATH  Google Scholar 

  8. Chen, J., Lü, X., Wu, W.: On the k-abelian complexity of the cantor sequence. arXiv: 1703.04063 (2017)

  9. Coven, E.M., Hedlund, G.A.: Sequences with minimal block growth. Math. Syst. Theo. 7, 138–153 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  10. Curie, J., Rampersad, N.: Recurrent words with constant abelian complexity. Adv. Appl. Math. 47, 116–124 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gottschalk, W.H.: Substitution on minimal sets. Trans. Amer. Math. Soc. 109, 467–491 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lü, X., Chen, J., Wen, Z., Wu, W.: On the abelian complexity of the rudin-shapiro sequence. J. Math. Anal. Appl. 451, 822–838 (2017)

    Article  MathSciNet  Google Scholar 

  13. Madill, B., Rampersad, N.: The abelian complexity of the paperfolding word. Disc. Math. 313, 831–838 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  14. Massé, A.B., Brlek, S., Garon, A., Labbé, S.: Combinatorial properties of \(f\)-palindromes in the thue-morse sequence. Pure Math. Appl. 19, 39–52 (2008)

    MathSciNet  MATH  Google Scholar 

  15. Parreau, A., Rigo, M., Rowland, E., Vandomme, E.: A new approach to the \(2-\)regularity of the \(l-\)abelian complexity of \(2-\)automatic sequences. Electron. J. Combin. 22, 1–27 (2015)

    MathSciNet  MATH  Google Scholar 

  16. Richomme, G., Saari, K., Zamboni, L.Q.: Balance and abelian complexity of the tribonacci word. Adv. Appl. Math. 45, 212–231 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Richomme, G., Saari, K., Zamboni, L.Q.: Abelian complexity in minimal subshifts. J. London Math. Soc. 83, 79–95 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  18. Štarosta, S.: Generalised thue-morse word and palindromic richness. Kybernetika 48(3), 361–370 (2012)

    MathSciNet  MATH  Google Scholar 

  19. Thue, A.: Über unendliche zeichenreihen. Norske Vid. Selsk. Skr. Mat. Nat. Kl. 7, 1–22 (1906)

    MATH  Google Scholar 

  20. Thue, A.: Über die gegenseilige lage gleicher teile gewisser zeichenreihen. Norske Vid. Selsk. Skr. Mat. Nat. Kl. 1, 139–158 (1912)

    MATH  Google Scholar 

  21. Turek, O.: Balance and abelian complexity of a certain class of infinite ternary words. RAIRO Theor. Inf. Appl. 44, 313–337 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  22. Turek, O.: Abelian complexity and abelian co-decomposition. Theor. Comput. Sci. 469, 77–91 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. Turek, O.: Abelian complexity of the tribonacci word. J. Integer Seq. 18, 212–231 (2015)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. UFR–Sciences et Techniques, Université NAZI BONI, 01 BP 1091, Bobo-Dioulasso 01, Burkina Faso

    Idrissa Kaboré & Boucaré Kientéga

Authors
  1. Idrissa Kaboré
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Boucaré Kientéga
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Idrissa Kaboré .

Editor information

Editors and Affiliations

  1. Université du Québec à Montréal, Montreal, Québec, Canada

    Srečko Brlek

  2. Université du Québec à Montréal, Montreal, Québec, Canada

    Francesco Dolce

  3. Université du Québec à Montréal, Montreal, Québec, Canada

    Christophe Reutenauer

  4. Université du Québec à Montréal, Montreal, Québec, Canada

    Élise Vandomme

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Kaboré, I., Kientéga, B. (2017). Abelian Complexity of Thue-Morse Word over a Ternary Alphabet. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, É. (eds) Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science(), vol 10432. Springer, Cham. https://doi.org/10.1007/978-3-319-66396-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66396-8_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66395-1

  • Online ISBN: 978-3-319-66396-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation