Indistinguishable asymptotic pairs and multidimensional Sturmian configurations
Sebastián Barbieri, Sébastien Labbé
TL;DR
This work extends the one-dimensional Sturmian characterization to multidimensional shifts by introducing indistinguishable asymptotic pairs and a flip condition with difference set $F=\{0,-e_1,\dots,-e_d\}$. The authors connect pattern complexity to indistinguishability, proving that $\#\mathcal{L}_S(x)=\#(F-S)$ characterizes such pairs, and show that uniformly recurrent pairs under the flip condition are encoded by codimension-one cut-and-project schemes, i.e., multidimensional Sturmian configurations. They establish that characteristic $d$-dimensional Sturmian configurations $c_{\alpha},c'_{\alpha}$ (for totally irrational $\alpha$) are indistinguishable and satisfy the flip condition, and prove a full characterization: every uniformly recurrent indistinguishable pair with the flip condition arises from a Sturmian pair up to affine equivalence. The results generalize Morse-Hedlund-type complexity characterizations to higher dimensions and link symbolic dynamics with geometric tiling via cut-and-project theory, raising open questions about étale limits and Nivat-type questions in higher dimensions.
Abstract
Two asymptotic configurations on a full $\mathbb{Z}^d$-shift are indistinguishable if for every finite pattern the associated sets of occurrences in each configuration coincide up to a finitely supported permutation of $\mathbb{Z}^d$. We prove that indistinguishable asymptotic pairs satisfying a "flip condition" are characterized by their pattern complexity on finite connected supports. Furthermore, we prove that uniformly recurrent indistinguishable asymptotic pairs satisfying the flip condition are described by codimension-one (dimension of the internal space) cut and project schemes, which symbolically correspond to multidimensional Sturmian configurations. Together the two results provide a generalization to $\mathbb{Z}^d$ of the characterization of Sturmian sequences by their factor complexity $n+1$. Many open questions are raised by the current work and are listed in the introduction.
