Nivat’s Conjecture Holds for Sums of Two Periodic Configurations

DOI10.1007/978-3-319-73117-9_38zbMath1453.05005arXiv1710.05360OpenAlexW2963997554MaRDI QIDQ5127196

Michal Szabados

Publication date: 21 October 2020

Published in: SOFSEM 2018: Theory and Practice of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial problemlow complexity configurations

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture ⋮ On periodic decompositions and nonexpansive lines ⋮ Decidability and periodicity of low complexity tilings