De Bruijn's theorem

De Bruijn's theorem A coloring of the unit cubes in a {displaystyle 6cdot 6cdot 6} box that may be used to prove the impossibility of packing it with {displaystyle 1cdot 2cdot 4} bricks, as each brick covers 4 white and 4 black cubes but the box contains 8 more white than black cubes In a 1969 paper, Dutch mathematician Nicolaas Govert de Bruijn proved several results about packing congruent rectangular bricks (of any dimension) into larger rectangular boxes, in such a way that no space is left over. One of these results is now known as de Bruijn's theorem. According to this theorem, a "harmonic brick" (one in which each side length is a multiple of the next smaller side length) can only be packed into a box whose dimensions are multiples of the brick's dimensions.[1] Contents 1 Example 2 Boxes that are multiples of the brick 3 A generalization 4 Harmonic bricks 5 Non-harmonic bricks 6 References 7 External links Example De Bruijn was led to prove this result after his then-seven-year-old son, F. W. de Bruijn, was unable to pack bricks of dimension {displaystyle 1cdot 2cdot 4} into a {displaystyle 6cdot 6cdot 6} cube.[2][3] The cube has a volume equal to that of {displaystyle 27} bricks, but only {displaystyle 26} bricks may be packed into it. One way to see this is to partition the cube into {displaystyle 27} smaller cubes of size {displaystyle 2cdot 2cdot 2} colored alternately black and white. This coloring has more unit cells of one color than of the other, but with this coloring any placement of the {displaystyle 1cdot 2cdot 4} brick must have equal numbers of cells of each color. Therefore, any tiling by bricks would also have equal numbers of cells of each color, an impossibility.[4] De Bruijn's theorem proves that a perfect packing with these dimensions is impossible, in a more general way that applies to many other dimensions of bricks and boxes.

Boxes that are multiples of the brick Suppose that a {displaystyle d} -dimensional rectangular box (mathematically a cuboid) has integer side lengths {displaystyle A_{1}cdot A_{2}cdot dotso cdot A_{d}} and a brick has lengths {displaystyle a_{1}cdot a_{2}cdot dotso cdot a_{d}} . If the sides of the brick can be multiplied by another set of integers {displaystyle b_{i}} so that {displaystyle a_{1}b_{1},a_{2}b_{2},dots a_{d}b_{d}} are a permutation of {displaystyle A_{1},A_{2},dots ,A_{d}} , the box is called a multiple of the brick. The box can then be filled with such bricks in a trivial way with all the bricks oriented the same way.[1] A generalization Not every packing involves boxes that are multiples of bricks. For instance, as de Bruijn observes, a {displaystyle 5cdot 6} rectangular box can be filled with copies of a {displaystyle 2cdot 3} rectangular brick, although not with all the bricks oriented the same way. However, de Bruijn (1969) proves that if the bricks can fill the box, then for each {displaystyle a_{i},} at least one of the {displaystyle A_{i}} is a multiple. In the above example, the side of length {displaystyle 6} is a multiple of both {displaystyle 2} and {displaystyle 3} .[1] Harmonic bricks The second of de Bruijn's results, the one called de Bruijn's theorem, concerns the case where each side of the brick is an integer multiple of the next smaller side. De Bruijn calls a brick with this property harmonic. For instance, the most frequently used bricks in the USA have dimensions {displaystyle 2{tfrac {1}{4}}cdot 4cdot 8} (in inches), which is not harmonic, but a type of brick sold as "Roman brick" has the harmonic dimensions {displaystyle 2cdot 4cdot 12} .[5] De Bruijn's theorem states that, if a harmonic brick is packed into a box, then the box must be a multiple of the brick. For instance, the three-dimensional harmonic brick with side lengths 1, 2, and 6 can only be packed into boxes in which one of the three sides is a multiple of six and one of the remaining two sides is even.[1][6] Packings of a harmonic brick into a box may involve copies of the brick that are rotated with respect to each other. Nevertheless, the theorem states that the only boxes that can be packed in this way are boxes that could also be packed by translates of the brick.

Boisen (1995) provided an alternative proof of the three-dimensional case of de Bruijn's theorem, based on the algebra of polynomials.[7] Non-harmonic bricks The third of de Bruijn's results is that, if a brick is not harmonic, then there is a box that it can fill that is not a multiple of the brick. The packing of the {displaystyle 2cdot 3} brick into the {displaystyle 5cdot 6} box provides an example of this phenomenon.[1] An {displaystyle (a_{1}+a_{2})cdot (a_{1}a_{2})} box, tiled with {displaystyle a_{1}cdot a_{2}} bricks, for the case {displaystyle a_{1}=2} and {displaystyle a_{2}=5} In the two-dimensional case, the third of de Bruijn's results is easy to visualize. A box with dimensions {displaystyle A_{1}=a_{1}} and {displaystyle A_{2}=a_{1}cdot a_{2}} is easy to pack with {displaystyle a_{1}} copies of a brick with dimensions {displaystyle a_{1},a_{2}} , placed side by side. For the same reason, a box with dimensions {displaystyle A_{1}=a_{1}cdot a_{2}} and {displaystyle A_{2}=a_{2}} is also easy to pack with copies of the same brick. Rotating one of these two boxes so that their long sides are parallel and placing them side by side results in a packing of a larger box with {displaystyle A_{1}=a_{1}+a_{2}} and {displaystyle A_{2}=a_{1}cdot a_{2}} . This larger box is a multiple of the brick if and only if the brick is harmonic.

References ^ Jump up to: a b c d e de Bruijn, N. G. (1969), "Filling boxes with bricks", The American Mathematical Monthly, 76 (1): 37–40, doi:10.2307/2316785, JSTOR 2316785, MR 0234841. ^ Honsberger, Ross (1976), Mathematical Gems II, Washington, DC: Mathematical Association of America, p. 69, ISBN 9780883853009. ^ Nienhuys, J. W. (September 11, 2011), Kloks, Ton; Hung, Ling-Ju (eds.), De Bruijn's combinatorics: classroom notes, p. 156. ^ Watkins, John J. (2012), Across the Board: The Mathematics of Chessboard Problems, Princeton University Press, p. 226, ISBN 9781400840922. ^ Kreh, R. T. (2003), Masonry Skills (5th ed.), Cengage Learning, p. 18, ISBN 9780766859364. ^ Stein, Sherman K.; Szabó, Sándor (1994), Algebra and Tiling: Homomorphisms in the Service of Geometry, Carus Mathematical Monographs, vol. 25, Washington, DC: Mathematical Association of America, p. 52, ISBN 0-88385-028-1, MR 1311249. ^ Boisen, Paul (1995), "Polynomials and packings: a new proof of de Bruijn's theorem", Discrete Mathematics, 146 (1–3): 285–287, doi:10.1016/0012-365X(94)00070-1, MR 1360122. External links Weisstein, Eric W., "de Bruijn's Theorem", MathWorld Categories: Theorems in discrete geometry

Si quieres conocer otros artículos parecidos a De Bruijn's theorem puedes visitar la categoría Theorems in discrete geometry.

Deja una respuesta

Tu dirección de correo electrónico no será publicada.


Utilizamos cookies propias y de terceros para mejorar la experiencia de usuario Más información