凸集可分成任意数量的等面积等周部分
Convex fair partitions into an arbitrary number of pieces
AI总结:
论文证明了任意平面凸集可被分成m个等面积等周的凸部分,且该结果此前仅对素数幂m=p^k成立,同时讨论了高维扩展和多函数均等化技术的困难。
摘要:
我们证明了任何平面凸体均可被分成m个面积和周长均等的凸部分,其中m为任意整数且m≥2;此结果此前仅对素数幂m=p^k成立。我们还讨论了可能的高维推广以及将我们的技术扩展到均等化多个非加性函数的困难。
英文摘要:
We prove that any convex body in the plane can be partitioned into $m$ convex parts of equal areas and perimeters for any integer $m\ge 2$; this result was previously known for prime powers $m=p^k$. We also discuss possible higher-dimensional generalizations and difficulties of extending our technique to equalizing more than one non-additive function.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。