Recommendations
Cites work
- scientific article; zbMATH DE number 3991618 (Why is no real title available?)
- scientific article; zbMATH DE number 3715591 (Why is no real title available?)
- scientific article; zbMATH DE number 768067 (Why is no real title available?)
- scientific article; zbMATH DE number 5051583 (Why is no real title available?)
- scientific article; zbMATH DE number 3316189 (Why is no real title available?)
- Admission control in stochastic event graphs
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Complementing and exactly covering sequences
- Complexity of trajectories in rectangular billiards
- Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\)
- Disjoint covering systems of rational Beatty sequences
- Disjointness of sequences [\(alpha_ i(\)n) + beta//i], i=1,2
- Gap problems for integer part and fractional part sequences
- Minimal symbolic flows having minimal block growth
- On the number of factors of Sturmian words
- Ordered orbits of the shift, square roots, and the devil's staircase
- Parallelogram tilings and Jacobi-Perron algorithm
- Rauzy's conjecture on billiards in the cube
- STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES
- Sequences with minimal block growth
- Sequences with minimal block growth II
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- The geometry of Markoff numbers
- The rectangle complexity of functions on two-dimensional lattices
- Two-Dimensional Periodicity in Rectangular Arrays
- Updown generation of Penrose patterns
Cited in
(17)- Periodicity and local complexity
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- Low complexity functions and convex sets in \(\mathbb{Z}^k\)
- On the upper bounds for complexities of discrete functions
- On a conjecture on bidimensional words.
- The \(\ell_p\)-function on finite Boolean lattices
- Enumeration results on linear complexity profiles and lattice profiles
- Strong cocycle triviality for \(Z^{2}\) subshifts
- The rectangle complexity of functions on two-dimensional lattices
- Double sequences of low complexity
- Nivat's conjecture and pattern complexity in algebraic subshifts
- On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture
- An alphabetical approach to Nivat's conjecture
- An algebraic geometric approach to multidimensional words
- Complexity and directional entropy in two dimensions
- A conjecture about polynomial time computable lattice-lattice functions
- Complexity of short rectangles and periodicity
This page was built for publication: The complexity of functions on lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583591)
