← All problems

Stein's equidissection conjecture for balanced polygons

14 years old · traced to

Let BB be a plane polygon with clockwise oriented boundary. The polygon BB 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.

References
  1. Daniil Rudenko, “On equidissection of balanced polygons”, arXiv:1206.4591 (2012).

Progress summary

Refreshed
Open

The conjecture remains open: only a restricted grid-polygon case is known, and no newer proof or counterexample was found.

Stein formulated the conjecture in 2000: a balanced polygon cannot be divided into an odd number of equal-area triangles. The unrestricted statement remains unresolved.

Known results

  • Monsky, 1970: equal-area triangulations of a square have an even number of triangles.
  • Monsky, 1990: the analogous result holds for centrally symmetric polygons.
  • Bekker and Netsvetaev, 1994: a higher-dimensional analogue.
  • Stein, 1999, and Praton, 2002: odd- and even-area polyomino cases, respectively.

June–August 2012 partial result

Daniil Rudenko’s paper, submitted June 20, 2012 and last revised August 3, 2012, proves the conjecture for lattice balanced polygons of odd integer area. It does not address the unrestricted case, and no later proof, counterexample, or substantive challenge was found.

Current status (as of November 2026): Stein’s unrestricted conjecture remains open; Rudenko’s odd-area lattice case is the latest recorded advance, with no recorded counterexample or complete proof.

Sources

Solutions 0

No solutions have been posted yet.