2000
DOI: 10.1007/pl00004798
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: In 1938 Morse and Hedlund proved that a function f :

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2002
2002
2015
2015

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 15 publications
0
2
0
Order By: Relevance
“…Associated to any such symbol sequence is a dynamical system with a Z-action (the closure of its orbit under the shift) and this result can be interpreted as a condition for this dynamical system to be finite. In the context of higher dimensional symbolic dynamical systems, with symbols on the lattice Z n and a corresponding Z n -action, the question has also been raised to what extent growth restrictions on the number of local symbol patterns (in rectangular patches) enforce periodicity, see for example Sander and Tijdeman [27,28,29] and Berthé and Vuillon [2,3] for a discussion of the two dimensional case. Symbolic dynamics analogues of the patch-counting function are called "permutation numbers" or "complexity functions" in this context, cf.…”
Section: Introductionmentioning
confidence: 99%
“…Associated to any such symbol sequence is a dynamical system with a Z-action (the closure of its orbit under the shift) and this result can be interpreted as a condition for this dynamical system to be finite. In the context of higher dimensional symbolic dynamical systems, with symbols on the lattice Z n and a corresponding Z n -action, the question has also been raised to what extent growth restrictions on the number of local symbol patterns (in rectangular patches) enforce periodicity, see for example Sander and Tijdeman [27,28,29] and Berthé and Vuillon [2,3] for a discussion of the two dimensional case. Symbolic dynamics analogues of the patch-counting function are called "permutation numbers" or "complexity functions" in this context, cf.…”
Section: Introductionmentioning
confidence: 99%
“…Further partial results connected to Nivat's Conjecture and its generalizations are given in [1,6,9,[18][19][20], and we refer the reader to [5,8,12] for additional discussion.…”
mentioning
confidence: 99%