TOPICS
Search

Balanced Polygon


A balanced polygon is a plane polygon whose oriented boundary vectors parallel to any fixed direction have sum zero (Stein 2000, Krachun 2026). Equivalently, after subdivision of its edges, its oriented boundary segments can be paired into opposite vectors. Every centrally symmetric polygon and every polyomino is balanced.

An equidissection is a dissection into triangles of equal area. Krachun (2026, Theorem 2) proved that every equidissection of a balanced polygon contains an even number of triangles, resolving Stein's conjecture (Stein 2000). The theorem permits arbitrary real coordinates for the vertices of the dissection. It includes the impossibility of dissecting a square into an odd number of equal-area triangles.


See also

Dissection, Polygon, Polyomino

Explore with Wolfram|Alpha

References

Krachun, D. "A Proof of Stein's Equidissection Conjecture." 15 Nov 2026. https://arxiv.org/abs/2611.20240v1.Stein, S. "A Generalized Conjecture about Cutting a Polygon into Triangles of Equal Areas." Disc. Comput. Geom. 24, 141-145, 2000. https://doi.org/10.1007/s004540010021.

Cite this as:

Weisstein, Eric W. "Balanced Polygon." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BalancedPolygon.html

Subject classifications