A periodic regular tiling of the plane by black and white squares is k-universal if it contains all possible k x k blocks of black and white tiles. There is a 4 x 4 periodic tiling that is 2-universal; this paper looks for the smallest 3-universal tiling and obtains a 64 x 32 periodic tiling that is
Universal tilings of the plane by 0–1-matrices
✍ Scribed by Knut Dehnhardt; Heiko Harborth
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 673 KB
- Volume
- 73
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
A tiling of the plane by black and white unit squares of the square lattice is called (a, b)-universal if the tiling is built up by horizontal and vertical translations of a fundamental (m, n)-rectangle, and if every one of the possible 2ub different (a, b)-rectangles of black and white unit squares occurs somewhere in the tiling. If the fundamental (m, n)-rectangle is as small as possible (that is, with mn = 2"') then the tiling is called optimal (a, b)-universal. It is the purpose of this paper to prove the existence of optimal (a, b)-universal tilings for all a, b 5 2.
📜 SIMILAR VOLUMES
The high-re~lution spectra ofH2'60, H2"O. HDr60. HD'aO. D2r60, and D2 180 isolated in argon and krypton matrices are reporkd in the IO-60 cm-r region. The high resolution is obtained by observin\_e very ddu te mixtures of watcr in the rare gases. NO discrete absorbancrs attributable to pure argon or
This note provides bounds for the maximal number of ones allowed in an N x N 0-1 matrix, N = 2 n, in which there are no 'forbidden rectangles' of a special type. ## 1. Introduction The density of a 0-1 matrix is defined as the number of l's that occur in it. A typical problem in extremal combinato