论文信息 - The rectangle complexity of functions on two-dimensional lattices

The rectangle complexity of functions on two-dimensional lattices

Let X be a non-empty set. Let f:Z2X. All vectors which occur have integer coefficients, and for =(a1,a2), =(b1,b2) we write or 0. A -block is a set of the form B(){Z2| 0 such that the -complexity of f does not exceed b1b2. In this paper, we prove the statement for b=(n,2) where n is any positive integer.

J. W. Sander | Robert Tijdeman | R. Tijdeman | J. Sander

[1] Laurent Vuillon,et al. Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequences , 2000, Discret. Math..

[2] Laurent Vuillon,et al. Combinatorics of patterns of a bidimensional Sturmian sequence. , 1998 .

[3] Robert Tijdeman,et al. Low complexity functions and convex sets in $\mathbb{Z}^k$ , 2000 .

[4] J. W. Sander,et al. The complexity of functions on lattices , 2000, Theor. Comput. Sci..