Nonexpansive Z^2 subdynamics and Nivat's conjecture

TL;DR

This paper studies the dynamics of two-dimensional subshifts and proves a weak form of Nivat's conjecture, showing that low rectangular complexity implies periodicity of the associated sequences.

Contribution

It establishes a connection between rectangular complexity bounds and periodicity in two-dimensional symbolic dynamics, advancing understanding of Nivat's conjecture.

Findings

If $P_{ ext{eta}}(n,k) \\leq nk/2$, then eta is periodic.

Periodic sequences correspond to specific expansive subspaces.

The results provide a partial proof of Nivat's conjecture in two dimensions.

Abstract

For a finite alphabet $\A$ and $\eta\colon \Z\to\A$, the Morse-Hedlund Theorem states that $\eta$ is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$, and this statement is naturally studied by analyzing the dynamics of a $\Z$-action associated to $\eta$. In dimension two, we analyze the subdynamics of a $\ZZ$-action associated to $\eta\colon\ZZ\to\A$ and show that if there exist $n,k\in\N$ such that the $n\times k$ rectangular complexity $P_{\eta}(n,k)$ satisfies $P_{\eta}(n,k)\leq nk$, then the periodicity of $\eta$ is equivalent to a statement about the expansive subspaces of this action. As a corollary, we show that if there exist $n,k\in\N$ such that $P_{\eta}(n,k)\leq \frac{nk}{2}$, then $\eta$ is periodic. This proves a weak form of a conjecture of Nivat in the combinatorics of words.