<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>The Wallace-Bolyai-Gerwien theorem states any polygon can be decomposed into a finite number of polygonal pieces that can be translated and rotated to form any polygon of equal area. The theorem was proved in the early 19th century. The minimum number of pieces necessary to form these common dissections remains an open question. In 1905, Henry Dudney demonstrated a four-piece common dissection between a square and equilateral triangle. We investigate the possible existence of a three-piece common dissection. Specifically, we prove that there does not exist a three-piece common dissection using only convex polygons.</p>
</abstract>

The Wallace-Bolyai-Gerwien theorem states any polygon can be decomposed into a finite number of polygonal pieces that can be translated and rotated to form any polygon of equal area. The theorem was proved in the early 19th century. The minimum number of pieces necessary to form these common dissections remains an open question. In 1905, Henry Dudney demonstrated a four-piece common dissection between a square and equilateral triangle. We investigate the possible existence of a three-piece common dissection. Specifically, we prove that there does not exist a three-piece common dissection using only convex polygons.

Economical Dissections

Recreational Mathematics Magazine

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

{"article-title":"Economical Dissections"}

The Wallace-Bolyai-Gerwien theorem states any polygon can be decomposed into a finite number of polygonal pieces that can be translated and rotated to form any...

Economical Dissections

Online veröffentlicht: 27. Jan. 2023

Seitenbereich: 1 - 39

DOI: https://doi.org/10.2478/rmm-2023-0001

© 2023 Trent DeGiovanni et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.