The complexity of functions on lattices
From MaRDI portal
Publication:1583591
DOI10.1016/S0304-3975(99)00078-XzbMath1005.68118OpenAlexW2029399363MaRDI QIDQ1583591
Robert Tijdeman, Jürgen Sander
Publication date: 31 October 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00078-x
Related Items (13)
On a conjecture on bidimensional words. ⋮ Periodicity and local complexity ⋮ 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 ⋮ Complexity of short rectangles and periodicity ⋮ An alphabetical approach to Nivat’s conjecture ⋮ Complexity and directional entropy in two dimensions ⋮ Double sequences of low complexity ⋮ Strong cocycle triviality for \(Z^{2}\) subshifts ⋮ The rectangle complexity of functions on two-dimensional lattices ⋮ An algebraic geometric approach to Nivat's conjecture ⋮ Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Updown generation of Penrose patterns
- On the number of factors of Sturmian words
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- The geometry of Markoff numbers
- Disjointness of sequences [\(alpha_ i(\)n) + beta//i, i=1,2]
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Parallelogram tilings and Jacobi-Perron algorithm
- Rauzy's conjecture on billiards in the cube
- Gap problems for integer part and fractional part sequences
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta: n=1,2,\dots \}\)]
- Complexity of trajectories in rectangular billiards
- Complementing and exactly covering sequences
- STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES
- Sequences with minimal block growth II
- Minimal symbolic flows having minimal block growth
- Ordered orbits of the shift, square roots, and the devil's staircase
- Two-Dimensional Periodicity in Rectangular Arrays
- Admission control in stochastic event graphs
- Sequences with minimal block growth
- Disjoint covering systems of rational Beatty sequences
- The rectangle complexity of functions on two-dimensional lattices
This page was built for publication: The complexity of functions on lattices