23.10.2018

*Jarkko Kari (University of Turku)*

Chebyshev Laboratory Colloquium

Thursday October 23, 17:15 room 14 (14-th line V.I., 29)

We study low complexity multidimensional words and subshifts using tools of algebraic geometry. The low complexity assumption is that, for some finite shape D, the word or the subshift has at most |D| distinct patterns of shape D. We express words as multivariate formal power series over integers and notice that the low complexity assumption implies that there is an annihilating polynomial: a polynomial whose formal product with the power series is zero. We prove that the word must then be a sum of periodic words over integers, possibly with unbounded

values. As a specific application of the method we obtain an asymptotic version of the well-known Nivat’s conjecture: we can show that a two-dimensional word that has low complexity with respect to arbitrarily large rectangles D must be periodic.

10.06.2019

27.05.2019

22.05.2019