On equidissection of balanced polygons
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:KHCCB7TXrecord.jsonopen to challenge →
classification
math.CO
math.AG
keywords
balancedareascannotequalequidissectionnumberpolygontriangles
read the original abstract
In this paper we show that a lattice balanced polygon of odd area cannot be cut into an odd number of triangles of equal areas. First result of this type was obtained by Paul Monsky in 1970. He proved that a square cannot be cut into an odd number of triangles of equal areas. In 2000 Sherman Stein conjectured that the same holds for any balanced polygon. We also show connections between the equidissection problem and tropical geometry.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.