Stein's equidissection conjecture for balanced polygons
Stein's equidissection conjecture for balanced polygons
Let be a plane polygon with clockwise oriented boundary. The polygon is balanced if its edges can be divided into pairs such that, in each pair, the edges are parallel, equal in length, and have opposite orientation. A polygon is cut into triangles when it is presented as a union of finitely many triangles whose interiors have empty intersection.
Stein's conjecture. A balanced polygon cannot be cut into an odd number of triangles of equal areas.
This conjecture generalizes results of Monsky on equidissections of squares and centrally symmetric polygons. The paper proves the corresponding result for lattice balanced polygons of odd area, while the unrestricted conjecture is not resolved here.
Sources & referencesView supporting material
Primary source
Daniil Rudenko, “On equidissection of balanced polygons”, arXiv:1206.4591 (2012).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.