The complexity of functions on lattices

DOI10.1016/S0304-3975(99)00078-XzbMATH Open1005.68118OpenAlexW2029399363MaRDI QIDQ1583591FDOQ1583591

R. Tijdeman, J. W. 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

Recommendations

• Low complexity functions and convex sets in \(\mathbb{Z}^k\)
• Subword complexity and periodicity in two or more dimensions
• The rectangle complexity of functions on two-dimensional lattices
• Periodicity and local complexity
• Complexity of short rectangles and periodicity

zbMATH Keywords

convex bodiesperiodicitypatternslow complexitymulti-dimensional functions

Mathematics Subject Classification ID

Combinatorics on words (68R15) Automata sequences (11B85)

Cites Work

• Ordered orbits of the shift, square roots, and the devil's staircase
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of factors of Sturmian words
• Two-Dimensional Periodicity in Rectangular Arrays
• Title not available (Why is that?)
• Complexity of trajectories in rectangular billiards
• Sequences with minimal block growth
• Parallelogram tilings and Jacobi-Perron algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rauzy's conjecture on billiards in the cube
• Covering the positive integers by disjoint sets of the form \(\{[n\alpha+\beta]: n=1,2,\dots \}\)
• Complementing and exactly covering sequences
• Disjoint covering systems of rational Beatty sequences
• Updown generation of Penrose patterns
• Sequences with minimal block growth II
• Minimal symbolic flows having minimal block growth
• The geometry of Markoff numbers
• Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
• Combinatorics on patterns of a bidimensional Sturmian sequence
• The rectangle complexity of functions on two-dimensional lattices
• Admission control in stochastic event graphs
• STURMIAN WORDS AND AMBIGUOUS CONTEXT-FREE LANGUAGES
• Disjointness of sequences [\(alpha_ i(\)n) + beta//i], i=1,2
• Gap problems for integer part and fractional part sequences

Cited In (17)

• Periodicity and local complexity
• Low complexity functions and convex sets in \(\mathbb{Z}^k\)
• An alphabetical approach to Nivat’s conjecture
• On the upper bounds for complexities of discrete functions
• On a conjecture on bidimensional words.
• The \(\ell_p\)-function on finite Boolean lattices
• Strong cocycle triviality for \(Z^{2}\) subshifts
• The rectangle complexity of functions on two-dimensional lattices
• Enumeration results on linear complexity profiles and lattice profiles
• Double sequences of low complexity
• On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture
• Nivat's conjecture and pattern complexity in algebraic subshifts
• An algebraic geometric approach to Nivat's conjecture
• Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
• Complexity and directional entropy in two dimensions
• Complexity of short rectangles and periodicity
• An Algebraic Geometric Approach to Multidimensional Words

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)