Filling a box with translates of two bricks
The electronic journal of combinatorics, Tome 11 (2004) no. 1
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
We give a new proof of the following interesting fact recently proved by Bower and Michael: if a $d$-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way. We can cut the box across one of its sides into two boxes, one of which can be tiled with the first brick only and the other one with the second brick. Our proof relies on the Fourier Transform. We also show that no such result is true for translates of more than two types of bricks.
Mihail N. Kolountzakis. Filling a box with translates of two bricks. The electronic journal of combinatorics, Tome 11 (2004) no. 1. doi: 10.37236/1857
@article{10_37236_1857,
author = {Mihail N. Kolountzakis},
title = {Filling a box with translates of two bricks},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {1},
doi = {10.37236/1857},
zbl = {1066.05048},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1857/}
}
Cité par Sources :