Speaker: Sergey Avvakumov (IST Austria)
Title: Convex fair partitions into an arbitrary number of pieces
Any convex body in the plane can be partitioned into m convex parts of
equal areas and perimeters for any integer m ≥ 2.
This was first proved for prime powers m = p^k using equivariant obstruction theory.
The theory fails, however, in the non prime power case.
I'll present a proof for the first non prime power m = 6 and sketch its generalization to arbitrary m.
Joint work with Arseniy Akopyan and Roman Karasev.