Indistinguishable asymptotic pairs and multidimensional Sturmian configurations

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.

arXiv commentv1: 46 pages, 13 delightful figures. v2: 48 pages (many fixes thanks to referee report). v3: 48 pages (improved proof of Lemma 5.9 and more fixes)

References in corpus (6)

• Equivalence of relative Gibbs and relative equilibrium measures for actions of countable amenable groups
• Equivalence classes of codimension one cut-and-project nets
• Gibbsian representations of continuous specifications: the theorems of Kozlov and Sullivan revisited
• A d-dimensional extension of Christoffel words
• Markov partitions for toral ${\mathbb{Z}}^2$-rotations featuring Jeandel-Rao Wang shift and model sets
• A characterization of Sturmian sequences by indistinguishable asymptotic pairs