Low complexity functions and convex sets in \(\mathbb{Z}^k\)

DOI10.1007/PL00004798zbMath1022.37011OpenAlexW2128212236WikidataQ106102318 ScholiaQ106102318MaRDI QIDQ1968575

Jürgen Sander, Robert Tijdeman

Publication date: 20 November 2002

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00004798

zbMATH Keywords

convex setsSturmian sequencesseparation theorem

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorics on words (68R15) Symbolic dynamics (37B10)

Related Items (4)

On a conjecture on bidimensional words. ⋮ Double sequences of low complexity ⋮ The rectangle complexity of functions on two-dimensional lattices ⋮ Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture

This page was built for publication: Low complexity functions and convex sets in \(\mathbb{Z}^k\)