Heun's method

2014-11-14T13:05:23Z

195.115.92.134: /* Derivation */

The author's title is Andera and she believes it sounds fairly great. Office supervising is exactly where her main earnings arrives from but she's currently applied for an additional one. Some time in the past he selected to reside in North Carolina and he doesn't strategy on altering it. To perform lacross is online [http://koreanyelp.com/index.php?document_srl=1798&mid=SchoolNews love psychic readings] - [http://skullrocker.com/blogs/post/10991 http://skullrocker.com] - something he would by no means give up.<br><br>My web blog - [http://galab-work.cs.pusan.ac.kr/Sol09B/?document_srl=1489804 free tarot readings]

Kanade–Lucas–Tomasi feature tracker

2013-11-21T15:57:04Z

195.115.92.134: Clarifications (ordering & missing transpositions)

[[File:De Bruijn theorem coloring.svg|thumb|A coloring of the unit cubes in a <math>\scriptstyle 6\times 6\times 6</math> box that may be used to prove the impossibility of packing it with <math>\scriptstyle 1\times 2\times 4</math> bricks]]
In a 1969 paper, Dutch mathematician [[Nicolaas Govert de Bruijn]] proved several results about packing [[congruence (geometry)|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.<ref name="db69">{{citation
| last = de Bruijn | first = N. G. | author-link = Nicolaas Govert de Bruijn
| doi = 10.2307/2316785
| journal = The American Mathematical Monthly
| mr = 0234841
| pages = 37–40
| title = Filling boxes with bricks
| volume = 76
| year = 1969}}.</ref>

==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 <math>\scriptstyle 1\times 2\times 4</math> into a <math>\scriptstyle 6\times 6\times 6</math> cube.<ref>{{citation
| last = Honsberger | first = Ross
| isbn = 9780883853009
| location = Washington, DC
| page = 69
| publisher = Mathematical Association of America
| title = Mathematical Gems II
| year = 1976}}.</ref><ref>{{citation
| last = Nienhuys | first = J. W.
| editor1-last = Kloks | editor2-first = Ling-Ju |editor2-last = Hung | editor1-first = Ton
| date = September 11, 2011
| page = 156
| title = De Bruijn's combinatorics: classroom notes
| url = http://books.google.com/books?id=AsXUY604pewC&pg=PA156}}.</ref> The cube has a volume equal to that of <math>\scriptstyle 27</math> bricks, but only <math>\scriptstyle 26</math> bricks may be packed into it; one way to see this is to partition the cube into <math>\scriptstyle 27</math> smaller cubes colored alternately black and white, and to observe that this coloring has more unit cells of one color than of the other, whereas with this coloring any placement of the <math>\scriptstyle 1\times 2\times 4</math> brick must have equal numbers of cells of each color.<ref>{{citation
| last = Watkins | first = John J.
| isbn = 9781400840922
| page = 226
| publisher = Princeton University Press
| title = Across the Board: The Mathematics of Chessboard Problems
| url = http://books.google.com/books?id=LtoSZmGzVs4C&pg=PA226
| year = 2012}}.</ref> 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 <math>\scriptstyle d</math>-dimensional rectangular box (mathematically a [[cuboid]]) has [[integer]] side lengths <math>\scriptstyle A_1 \times A_2 \times \dots \times A_d</math> and a brick has lengths <math>\scriptstyle a_1 \times a_2 \times \dots \times a_d</math>. If the sides of the brick can be multiplied by another set of integers <math>\scriptstyle b_i</math> so that <math>\scriptstyle a_1b_1,a_2b_2,\dots a_d b_d</math> are a [[permutation]] of <math>\scriptstyle A_1, A_2,\dots,A_d</math>, 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.<ref name="db69"/>

==A generalization==
Not every packing involves boxes that are multiples of bricks. For instance, as de Bruijn observes, a <math>\scriptstyle 5\times 6</math> rectangular box can be filled with copies of a <math>\scriptstyle 2\times 3</math> rectangular brick, although not with all the bricks oriented the same way. However, {{harvtxt|de Bruijn|1969}} proves that if the bricks can fill the box, then for each <math>a_i,</math> at least one of the <math>A_i</math> is a multiple. In the above example, the side of length <math>6</math> is a multiple of both <math>2</math> and <math>3</math>.<ref name="db69"/>

==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 a multiple of the next smaller side. De Bruijn calls a brick with this property ''harmonic''. For instance, the most frequently used [[brick]]s in the USA have dimensions <math>\scriptstyle 2\frac{1}{4}\times 4\times 8</math> (in inches), which is not harmonic, but a type of brick sold as "Roman brick" has the harmonic dimensions <math>\scriptstyle 2\times 4\times 12</math>.<ref>{{citation
| last = Kreh | first = R. T.
| edition = 5th
| isbn = 9780766859364
| page = 18
| publisher = Cengage Learning
| title = Masonry Skills
| url = http://books.google.com/books?id=e3gyN-TPRd4C&pg=PA18
| year = 2003}}.</ref>

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.<ref name="db69"/><ref>{{citation
| last1 = Stein | first1 = Sherman K.
| last2 = Szabó | first2 = Sándor
| isbn = 0-88385-028-1
| location = Washington, DC
| mr = 1311249
| page = 52
| publisher = Mathematical Association of America
| series = Carus Mathematical Monographs
| title = Algebra and Tiling: Homomorphisms in the Service of Geometry
| url = http://books.google.com/books?id=QOa-mnX5Y4QC&pg=PA52
| volume = 25
| year = 1994}}.</ref> 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.

{{harvtxt|Boisen|1995}} provided an alternative proof of the three-dimensional case of de Bruijn's theorem, based on the algebra of [[polynomial]]s.<ref>{{citation
| last = Boisen | first = Paul
| doi = 10.1016/0012-365X(94)00070-1
| issue = 1-3
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
| mr = 1360122
| pages = 285–287
| title = Polynomials and packings: a new proof of de Bruijn's theorem
| volume = 146
| year = 1995}}.</ref>

==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 <math>\scriptstyle 2\times 3</math> brick into the <math>\scriptstyle 5\times 6</math> box provides an example of this phenomenon.<ref name="db69"/>

[[File:7x10 box packed with 2x5 bricks.svg|thumb|An <math>\scriptstyle (a_1+a_2)\times (a_1a_2)</math> box, tiled with <math>\scriptstyle a_1\times a_2</math> bricks, for the case <math>\scriptstyle a_1=2</math> and <math>\scriptstyle a_2=5</math>]]
In the two-dimensional case, the third of de Bruijn's results is easy to visualize. A box with dimensions <math>\scriptstyle A_1=a_1</math> and <math>\scriptstyle A_2=a_1a_2</math> is easy to pack with <math>\scriptstyle a_1</math> copies of a brick with dimensions <math>\scriptstyle a_1,a_2</math>, placed side by side. For the same reason, a box with dimensions <math>\scriptstyle A_1=a_1a_2</math> and <math>\scriptstyle A_2=a_2</math> 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 <math>\scriptstyle A_1=a_1+a_2</math> and <math>\scriptstyle A_2=a_1a_2</math>. This larger box is a multiple of the brick if and only if the brick is harmonic.

==References==
{{reflist}}

==External links==
*{{mathworld|title=de Bruijn's Theorem|urlname=deBruijnsTheorem}}

[[Category:Theorems in discrete geometry]]

formulasearchengine - User contributions [en]

Heun's method

Kanade–Lucas–Tomasi feature tracker