Skip to main content

Recurrence in Multidimensional Words

  • Conference paper
  • First Online:
Language and Automata Theory and Applications (LATA 2019)

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

Abstract

In this paper we study various modifications of the notion of uniform recurrence in multidimensional infinite words. A d-dimensional infinite word is said to be uniformly recurrent if for each \((n_1,\ldots ,n_d)\in \mathbb {N}^d\) there exists \(N\in \mathbb {N}\) such that each block of size \((N,\ldots ,N)\) contains the prefix of size \((n_1,\ldots ,n_d)\). We introduce and study a new notion of uniform recurrence of multidimensional infinite words: for each rational slope \((q_1,\ldots ,q_d)\), each rectangular prefix must occur along this slope, that is in positions \(\ell (q_1,\ldots ,q_d)\), with bounded gaps. Such words are called uniformly recurrent along all directions. We provide several constructions of multidimensional infinite words satisfying this condition, and more generally, a series of three conditions on recurrence. We study general properties of these new notions and in particular we study the strong uniform recurrence of fixed points of square morphisms.

The second author is partially supported by Russian Foundation of Basic Research (grant 18-31-00118). The last author acknowledges financial support by the Ministry of Education, Youth and Sports of the Czech Republic (project no. CZ.02.1.01/0.0/0.0/16_019/0000778).

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. Berthé, V., Vuillon, L.: Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences. Discrete Math. 223, 27–53 (2000)

    Article  MathSciNet  Google Scholar 

  2. Cassaigne, J.: Double sequences with complexity \(mn+1\). J. Autom. Lang. Combin. 4, 153–170 (1999)

    MathSciNet  MATH  Google Scholar 

  3. Cyr, V., Kra, B.: Nonexpansive \(\mathbb{Z}^2\)-subdynamics and Nivat’s conjecture. Trans. Am. Math. Soc. 367(9), 6487–6537 (2015)

    Article  MathSciNet  Google Scholar 

  4. Durand, F., Rigo, M.: Multidimensional extension of the Morse-Hedlund theorem. Eur. J. Combin. 34, 391–409 (2013)

    Article  MathSciNet  Google Scholar 

  5. Kari, J., Szabados, M.: An algebraic geometric approach to Nivat’s conjecture. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 273–285. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47666-6_22

    Chapter  Google Scholar 

  6. Nivat, M.: Invited talk at ICALP, Bologna (1997)

    Google Scholar 

  7. Vuillon, L.: Combinatoire des motifs d’une suite sturmienne bidimensionnelle. Theor. Comput. Sci 209, 261–285 (1998)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We are grateful to Mathieu Sablik for inspiring discussions.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Svetlana Puzynina .

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

Charlier, É., Puzynina, S., Vandomme, É. (2019). Recurrence in Multidimensional Words. In: Martín-Vide, C., Okhotin, A., Shapira, D. (eds) Language and Automata Theory and Applications. LATA 2019. Lecture Notes in Computer Science(), vol 11417. Springer, Cham. https://doi.org/10.1007/978-3-030-13435-8_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-13435-8_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-13434-1

  • Online ISBN: 978-3-030-13435-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics