Complexity of short rectangles and periodicity

DOI10.1016/j.ejc.2015.10.003zbMath1327.05004arXiv1307.0098OpenAlexW1918855253MaRDI QIDQ896072

Van Cyr, Bryna Kra

Publication date: 11 December 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Morse-Hedlund theoremNivat's conjecture

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

An Algebraic Geometric Approach to Multidimensional Words ⋮ On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture ⋮ Nivat's conjecture and pattern complexity in algebraic subshifts ⋮ An alphabetical approach to Nivat’s conjecture ⋮ Complexity and directional entropy in two dimensions ⋮ An algebraic geometric approach to Nivat's conjecture ⋮ On a group theoretic generalization of the Morse-Hedlund theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Periodicity and local complexity
• Multidimensional extension of the Morse-Hedlund theorem
• The complexity of functions on lattices
• Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
• On a conjecture on bidimensional words.
• Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
• Expansive Subdynamics
• The rectangle complexity of functions on two-dimensional lattices