On forced periodicity of perfect colorings

DOI10.1007/s00224-023-10127-xzbMath1526.37018arXiv2301.05232MaRDI QIDQ6174652

Jarkko Kari, Pyry Herva

Publication date: 17 August 2023

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

perfect coloringsforced periodicityinfinite grid graphsmulti-dimensional symbolic dynamics

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Symbolic dynamics (37B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On periodicity of generalized two-dimensional infinite words
• Tesselation of integers
• On multiple coverings of the infinite rectangular grid with balls of constant radius
• Theory of cellular automata: a survey
• Tiling the line with translates of one tile
• On perfect coverings of two-dimensional grids
• Low-complexity tilings of the plane
• An algebraic geometric approach to Nivat's conjecture
• Aperiodic two-dimensional words of small abelian complexity
• Nivat's conjecture and pattern complexity in algebraic subshifts
• Perfect colorings of radius \(r>1\) of the infinite rectangular grid
• Cellular Automata and Groups
• An Introduction to Symbolic Dynamics and Coding
• The structure of translational tilings in $\mathbb{Z}^d$
• Periodicity and decidability of tilings of ℤ2
• Ideals, Varieties, and Algorithms
• Shorter Note: The Converse of Moore's Garden-of-Eden Theorem

This page was built for publication: On forced periodicity of perfect colorings