Maekawa's theorem: Difference between revisions
{{Mathematics of paper folding}} |
-cat |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
{{short description|Result about flat-foldable origami crease patterns}} |
|||
[[File:Kawasaki's theorem.jpg|thumb|280px|In this one-vertex crease pattern, the number of mountain folds (the five folds with the colored side out) differs by two from the number of valley folds (the three folds with the white side out)]] |
[[File:Kawasaki's theorem.jpg|thumb|280px|In this one-vertex crease pattern, the number of mountain folds (the five folds with the colored side out) differs by two from the number of valley folds (the three folds with the white side out)]] |
||
'''Maekawa's theorem''' is a [[theorem]] in the [[mathematics of paper folding]] named after [[Jun Maekawa]]. It relates to flat-foldable [[origami]] [[crease pattern]]s and states that at every [[Vertex (geometry)|vertex]], the numbers of valley and mountain folds always differ by two in either direction.<ref>{{citation|last1=Kasahara|first1=K.|last2=Takahama|first2=T.|title=Origami for the Connoisseur|publisher=Japan Publications|location=New York|year=1987}}.</ref> The same result was also discovered by Jacques Justin<ref>{{citation|last=Justin|first=J.|title=Mathematics of origami, part 9|journal=British Origami|date=June 1986|pages=28–30}}.</ref> and, even earlier, by S. Murata.<ref>{{citation |
'''Maekawa's theorem''' is a [[theorem]] in the [[mathematics of paper folding]] named after [[Jun Maekawa]]. It relates to flat-foldable [[origami]] [[crease pattern]]s and states that at every [[Vertex (geometry)|vertex]], the numbers of valley and mountain folds always differ by two in either direction.<ref>{{citation|last1=Kasahara|first1=K.|last2=Takahama|first2=T.|title=Origami for the Connoisseur|publisher=Japan Publications|location=New York|year=1987}}.</ref> The same result was also discovered by Jacques Justin<ref>{{citation|last=Justin|first=J.|title=Mathematics of origami, part 9|journal=British Origami|date=June 1986|pages=28–30}}.</ref> and, even earlier, by S. Murata.<ref>{{citation |
||
| Line 17: | Line 18: | ||
| pages = 215–224 |
| pages = 215–224 |
||
| series = Congressus Numerantium |
| series = Congressus Numerantium |
||
| title = Proceedings of the Twenty- |
| title = Proceedings of the Twenty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994) |
||
| volume = 100 |
| volume = 100 |
||
| year = 1994}}. See in particular Theorem 3.1 and Corollary 3.2.</ref> The same result can also be seen by considering which side of the sheet of paper is uppermost in each region of the folded shape. |
| year = 1994}}. See in particular Theorem 3.1 and Corollary 3.2.</ref> The same result can also be seen by considering which side of the sheet of paper is uppermost in each region of the folded shape. |
||
| Line 30: | Line 31: | ||
==External links== |
==External links== |
||
*{{mathworld|title=Maekawa's Theorem|urlname=MaekawasTheorem}} |
*{{mathworld|title=Maekawa's Theorem|urlname=MaekawasTheorem}} |
||
| ⚫ | |||
[[Category:Paper folding]] |
|||
[[Category:Recreational mathematics]] |
|||
{{Mathematics of paper folding}} |
{{Mathematics of paper folding}} |
||
| ⚫ | |||
Latest revision as of 19:37, 22 October 2023
Maekawa's theorem is a theorem in the mathematics of paper folding named after Jun Maekawa. It relates to flat-foldable origami crease patterns and states that at every vertex, the numbers of valley and mountain folds always differ by two in either direction.[1] The same result was also discovered by Jacques Justin[2] and, even earlier, by S. Murata.[3]
Parity and coloring
[edit]One consequence of Maekawa's theorem is that the total number of folds at each vertex must be an even number. This implies (via a form of planar graph duality between Eulerian graphs and bipartite graphs) that, for any flat-foldable crease pattern, it is always possible to color the regions between the creases with two colors, such that each crease separates regions of differing colors.[4] The same result can also be seen by considering which side of the sheet of paper is uppermost in each region of the folded shape.
Related results
[edit]Maekawa's theorem does not completely characterize the flat-foldable vertices, because it only takes into account the numbers of folds of each type, and not their angles. Kawasaki's theorem gives a complementary condition on the angles between the folds at a vertex (regardless of which folds are mountain folds and which are valley folds) that is also necessary for a vertex to be flat-foldable.
References
[edit]- ^ Kasahara, K.; Takahama, T. (1987), Origami for the Connoisseur, New York: Japan Publications.
- ^ Justin, J. (June 1986), "Mathematics of origami, part 9", British Origami: 28–30.
- ^ Murata, S. (1966), "The theory of paper sculpture, II", Bulletin of Junior College of Art (in Japanese), 5: 29–37.
- ^ Hull, Thomas (1994), "On the mathematics of flat origamis" (PDF), Proceedings of the Twenty-Fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), Congressus Numerantium, vol. 100, pp. 215–224, MR 1382321. See in particular Theorem 3.1 and Corollary 3.2.