De Bruijn's theorem

De Bruijn's theorem

De Bruijn's theorem is a theorem concerning computational geometry and packing problems attributed to Nicolaas Govert de Bruijn.

Theorem

A box can be packed with a brick a×ab×abc if and only if the box has dimensions ap×abq×abcr for some natural numbers p, q, r.[1]

References

  1. ^ Weisstein, Eric W. "de Bruijn's Theorem." From MathWorld. Retrieved on 2009-10-18

Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • De Bruijn–Erdős theorem — See: De Bruijn–Erdős theorem (incidence geometry) De Bruijn–Erdős theorem (graph theory) This disambiguation page lists mathematics articles associated with the same title. If an internal link led …   Wikipedia

  • De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… …   Wikipedia

  • De Bruijn–Erdős theorem (incidence geometry) — See also: De Bruijn–Erdős theorem (graph theory) In incidence geometry, the De Bruijn–Erdős theorem, originally published by Nicolaas Govert de Bruijn and Paul Erdős (1948), states a lower bound on the number of lines determined by n points… …   Wikipedia

  • Nicolaas Govert de Bruijn — Born 9 July 1918 (1918 07 09) (age 93) …   Wikipedia

  • De Bruijn — is a Dutch surname. It may refer to: Chantal de Bruijn Cornelis de Bruijn, Dutch artist and traveler Daniëlle de Bruijn Inge de Bruijn, Dutch swimmer Nicolaas Govert de Bruijn, Dutch mathematician Maarten de Bruijn Nick de Bruijn Pi de Bruijn In… …   Wikipedia

  • Nicolaas Govert de Bruijn — Pour les articles homonymes, voir De Bruijn. De Bruijn à Oberwolfach, dans les années 1960 Nicolaas Govert de Bruijn (né le 9 juillet 1918) est un mathématicien …   Wikipédia en Français

  • Sylvester–Gallai theorem — The Sylvester–Gallai theorem asserts that given a finite number of points in the Euclidean plane, either all the points are collinear; or there is a line which contains exactly two of the points. This claim was posed as a problem by J. J.… …   Wikipedia

  • Four color theorem — Example of a four colored map A four colori …   Wikipedia

  • Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician …   Wikipedia

  • Tychonoff's theorem — For other theorems named after Tychonoff, see Tychonoff s theorem (disambiguation). In mathematics, Tychonoff s theorem states that the product of any collection of compact topological spaces is compact. The theorem is named after Andrey… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”