Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 06, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Sergey Avvakumov (IST Austria)

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 result was previously known only for prime powers m = p^k.
I'll sketch the proof for m = p^k and explain some of the ideas of the general proof using the first non prime power m = 6 as an example.

Joint work with Arseniy Akopyan and Roman Karasev.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login