An alphabetical approach to Nivat's conjecture

DOI10.1088/1361-6544/AB7638MaRDI QIDQ5113441zbMATH OpenOpenAlexWikidataFDO

Authors Cleber Fernando Colle, Eduardo Garibaldi

Publication date 11 June 2020

Published in Nonlinearity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1904.04897

zbMATH Keywords

combinatorics on wordscomplexity functionsymbolic dynamicsexpansive subdynamics

Mathematics Subject Classification ID

Symbolic dynamics (37B10) Combinatorial dynamics (types of periodic orbits) (37E15) Combinatorics on words (68R15) Multidimensional shifts of finite type (37B51)

Abstract: Since techniques used to address the Nivat's conjecture usually relies on Morse-Hedlund Theorem, an improved version of this classical result may mean a new step towards a proof for the conjecture. In this paper, considering an alphabetical version of the Morse-Hedlund Theorem, we show that, for a configuration $etain{A}^{mathbb{Z}^2}$ that contains all letters of a given finite alphabet $A$, if its complexity with respect to a quasi-regular set $mathcalSsubsetmathbb{Z}^2$ (a finite set whose convex hull on $mathbb{R}^2$ is described by pairs of edges with identical size) is bounded from above by $frac12|mathcalS|+|A|-1$, then $eta$ is periodic.

Recommendations

• Nivat's conjecture holds for sums of two periodic configurations
• Periodicity and local complexity
• Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
• Nivat's conjecture and pattern complexity in algebraic subshifts
• Complexity of short rectangles and periodicity

Cites work

• Complexity of short rectangles and periodicity
• Expansive Subdynamics
• Multidimensional extension of the Morse-Hedlund theorem
• Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
• On a conjecture on bidimensional words.
• Periodicity and local complexity
• Subword complexity and periodicity in two or more dimensions
• Symbolic Dynamics
• The complexity of functions on lattices
• The rectangle complexity of functions on two-dimensional lattices
• Uniqueness Theorems for Periodic Functions

Cited in

(8)

• Periodicity and local complexity
• Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
• scientific article; zbMATH DE number 1305471 (Why is no real title available?)
• Nivat's conjecture holds for sums of two periodic configurations
• Nivat's conjecture and pattern complexity in algebraic subshifts
• On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture
• Complexity of short rectangles and periodicity
• scientific article; zbMATH DE number 6456850 (Why is no real title available?)

This page was built for publication: An alphabetical approach to Nivat's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113441)