<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Dissection_problem</id>
	<title>Dissection problem - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://debianws.lexgopc.com/wiki143/index.php?action=history&amp;feed=atom&amp;title=Dissection_problem"/>
	<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Dissection_problem&amp;action=history"/>
	<updated>2026-05-04T16:07:20Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.1</generator>
	<entry>
		<id>http://debianws.lexgopc.com/wiki143/index.php?title=Dissection_problem&amp;diff=2080270&amp;oldid=prev</id>
		<title>imported&gt;David Eppstein: /* Equilateral-triangle squaring problem */ Image violates both WP:WATERMARK and MOS:ANIMATION; swap out with another image that has neither problem</title>
		<link rel="alternate" type="text/html" href="http://debianws.lexgopc.com/wiki143/index.php?title=Dissection_problem&amp;diff=2080270&amp;oldid=prev"/>
		<updated>2025-04-02T05:05:22Z</updated>

		<summary type="html">&lt;p&gt;&lt;span class=&quot;autocomment&quot;&gt;Equilateral-triangle squaring problem: &lt;/span&gt; Image violates both &lt;a href=&quot;/wiki143/index.php?title=WP:WATERMARK&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;WP:WATERMARK (page does not exist)&quot;&gt;WP:WATERMARK&lt;/a&gt; and &lt;a href=&quot;/wiki143/index.php?title=MOS:ANIMATION&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;MOS:ANIMATION (page does not exist)&quot;&gt;MOS:ANIMATION&lt;/a&gt;; swap out with another image that has neither problem&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{short description|Geometric problems involving the partition of a figure}}&lt;br /&gt;
{{CS1 config|mode=cs2}}&lt;br /&gt;
In [[geometry]], a &amp;#039;&amp;#039;&amp;#039;dissection problem &amp;#039;&amp;#039;&amp;#039; is the problem of partitioning a geometric [[shape|figure]] (such as a [[polytope]] or [[Ball (mathematics)|ball]]) into smaller pieces that may be rearranged into a new figure of equal content. In this context, the partitioning is called simply a &amp;#039;&amp;#039;&amp;#039;dissection&amp;#039;&amp;#039;&amp;#039; (of one polytope into another). It is usually required that the dissection use only a finite number of pieces. Additionally, to avoid [[set-theoretic]] issues related to the [[Banach–Tarski paradox]] and [[Tarski&amp;#039;s circle-squaring problem]], the pieces are typically required to be [[Pathological (mathematics)|well-behaved]]. For instance, they may be restricted to being the [[Closure (topology)|closures]] of disjoint [[open set]]s.&lt;br /&gt;
&lt;br /&gt;
==Polygon dissection problem==&lt;br /&gt;
The [[Bolyai–Gerwien theorem]] states that any [[polygon]] may be dissected into any other polygon of the same area, using interior-disjoint polygonal pieces.  It is not true, however, that any [[polyhedron]] has a dissection into any other polyhedron of the same volume using polyhedral pieces (see [[Dehn invariant]]). This process &amp;#039;&amp;#039;is&amp;#039;&amp;#039; possible, however, for any two [[Honeycomb (geometry)|honeycombs]] (such as [[cube]]) in three dimension and any two [[zonohedra]] of equal volume (in any dimension).&lt;br /&gt;
&lt;br /&gt;
A partition into [[triangle]]s of equal area is called an [[equidissection]]. Most polygons cannot be equidissected, and those that can often have restrictions on the possible numbers of triangles. For example, [[Monsky&amp;#039;s theorem]] states that there is no odd equidissection of a [[square]].&amp;lt;ref&amp;gt;{{Citation |last=Stein |first=Sherman K. |date=March 2004 |title=Cutting a Polygon into Triangles of Equal Areas |journal=The Mathematical Intelligencer |volume=26 |issue=1 |pages=17–21 |doi=10.1007/BF02985395 |zbl=1186.52015|s2cid=117930135 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==Equilateral-triangle squaring problem==&lt;br /&gt;
[[File:Hinged haberdasher square.svg|thumb|Four-piece hinged dissection of an equilateral triangle into a square]]&lt;br /&gt;
Among [[dissection puzzle]]s, an example is the Haberdasher&amp;#039;s Puzzle, posed by puzzle writer [[Henry Dudeney]] in 1902.&amp;lt;ref&amp;gt;{{citation |first=Henry E. |last=Dudeney |title=Puzzles and Prizes |year=1902 |journal=[[Sunday Dispatch|Weekly Dispatch]]}} - The puzzle appeared in the April 6 issue of this column. A discussion followed on April 20, and the solution appeared on May 4.&amp;lt;/ref&amp;gt;  It seeks a dissection from [[equilateral triangle]] into a [[square]]. Dudeney provided a [[hinged dissection]] with four pieces. In 2024, [[Erik Demaine]], Tonan Kamata, and Ryuhei Uehara published a preprint claiming to prove that no dissection with fewer pieces exists.&amp;lt;ref&amp;gt;{{cite arxiv|title=Dudeney&amp;#039;s Dissection is Optimal|first1=Erik D.|last1=Demaine|first2=Tonan|last2=Kamata|first3=Ryuhei|last3=Uehara|eprint=2412.03865|class=cs.CG|date=December 5, 2024|mode=cs2}}&amp;lt;/ref&amp;gt;&amp;lt;ref&amp;gt;{{cite journal&lt;br /&gt;
|journal=Scientific American&lt;br /&gt;
|title=Mathematicians Find Proof to 122-Year-Old Triangle-to-Square Puzzle&lt;br /&gt;
|author=Lyndie Chiou&lt;br /&gt;
|date=2025-03-27&lt;br /&gt;
|url=https://www.scientificamerican.com/article/mathematicians-find-proof-to-122-year-old-triangle-to-square-puzzle/&lt;br /&gt;
|editor=Clara Moskowitz&lt;br /&gt;
}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Hilbert&amp;#039;s third problem]]&lt;br /&gt;
&lt;br /&gt;
==References==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
==External links==&lt;br /&gt;
*[[David Eppstein]], [http://www.ics.uci.edu/~eppstein/junkyard/distile/ Dissection Tiling].&lt;br /&gt;
&lt;br /&gt;
[[Category:Discrete geometry]]&lt;br /&gt;
[[Category:Euclidean geometry]]&lt;br /&gt;
[[Category:Geometric dissection]]&lt;br /&gt;
[[Category:Polygons]]&lt;br /&gt;
[[Category:Polyhedra]]&lt;br /&gt;
[[Category:Polytopes]]&lt;br /&gt;
[[Category:Mathematical problems]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{geometry-stub}}&lt;/div&gt;</summary>
		<author><name>imported&gt;David Eppstein</name></author>
	</entry>
</feed>