Abstract
We apply linear algebra and algebraic geometry to study infinite multidimensional words of low pattern complexity. By low complexity we mean that for some finite shape, the number of distinct sub-patterns of that shape that occur in the word is not more than the size of the shape. We are interested in discovering global regularities and structures that are enforced by such low complexity assumption. We express the word as a multivariate formal power series over integers. We first observe that the low pattern complexity assumption implies that there is a non-zero polynomial whose formal product with the power series is zero. We call such polynomials the annihilators of the word. The annihilators form an ideal, and using Hilbert’s Nullstellensatz we construct annihilators of simple form. In particular, we prove a decomposition of the word as a sum of finitely many periodic power series. We consider in more details a particular interesting example of a low complexity word whose periodic decomposition contains necessarily components with infinitely many distinct coefficients. We briefly discuss applications of our technique in the Nivat’s conjecture and the periodic tiling problem. The results reported here have been first discussed in a paper that we presented at ICALP 2015.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beauquier, D., Nivat, M.: On Translating One Polyomino to Tile the Plane. Discrete & Computational Geometry 6 (1991)
Cyr, V., Kra, B.: Complexity of short rectangles and periodicity (2013) (submitted). arXiv: 1307.0098 [math.DS]
Cyr, V., Kra, B.: Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat’s conjecture. Trans. Amer. Math. Soc. (2013) (to appear)
Epifanio, C., Koskas, M., Mignosi, F.: On a conjecture on bidimensional words. Theor. Comput. Sci. (1–3), 299 (2003)
Kari, Jarkko, Szabados, Michal: An algebraic geometric approach to nivat’s conjecture. In: Halldórsson, Magnús M., Iwama, Kazuo, Kobayashi, Naoki, Speckmann, Bettina (eds.) ICALP 2015. LNCS, vol. 9135, pp. 273–285. Springer, Heidelberg (2015)
Lagarias, J.C., Wang, Y.: Tiling the Line with Translates of One Tile. Inventiones Mathematicae 124, 341–365 (1996)
Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press (1995)
Morse, M., Hedlund, G.A.: Symbolic Dynamics. American Journal of Mathematics 60(4), 815–866 (1938)
Nivat, M.: Invited talk at ICALP, Bologna (1997)
Quas, A., Zamboni, L.Q.: Periodicity and local complexity. Theor. Comput. Sci. 319(1–3), 229–240 (2004)
Sander, J.W., Tijdeman, R.: The complexity of functions on lattices. Theor. Comput. Sci. 246(1–2), 195–225 (2000)
Sander, J.W., Tijdeman, R.: The rectangle complexity of functions on two-dimensional lattices. Theor. Comput. Sci. 270(1–2), 857–863 (2002)
Szegedy, M.: Algorithms to tile the infnite grid with finite clusters. In: FOCS, pp. 137–147. IEEE Computer Society (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Kari, J., Szabados, M. (2015). An Algebraic Geometric Approach to Multidimensional Words. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-23021-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23020-7
Online ISBN: 978-3-319-23021-4
eBook Packages: Computer ScienceComputer Science (R0)