An alphabetical approach to Nivat's conjecture

DOI10.1088/1361-6544/AB7638zbMATH Open1472.37052arXiv1904.04897OpenAlexW2937980452WikidataQ123257307 ScholiaQ123257307MaRDI QIDQ5113441FDOQ5113441

Authors: Cleber Fernando Colle, Eduardo Garibaldi 

Publication date: 11 June 2020

Published in: Nonlinearity (Search for Journal in Brave)

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.

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

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

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)

Cites Work

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

Cited In (8)

• Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
• Periodicity and local complexity
• Title not available (Why is that?)
• Nivat's conjecture holds for sums of two periodic configurations
• On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture
• Nivat's conjecture and pattern complexity in algebraic subshifts
• Complexity of short rectangles and periodicity
• Title not available (Why is that?)

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)