BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: It is sometimes possible to represent a complicated polytope a
s a projection of a much simpler polytope. To quantify this phenomenon\, th
e extension complexity of a polytope P is defined to be the minimum number
of facets in a (possibly higher-dimensional) polytope from which P can be o
btained as a (linear) projection. In this talk\, we discuss some results on
the extension complexity of random d-dimensional polytopes (obtained as co
nvex hulls of random points on either on the unit sphere or in the unit bal
l)\, and on the extension complexity of polygons with all vertices on a com
mon circle. Joint work with Matthew Kwan and Yufei Zhao.
DTSTAMP:20200921T170300
DTSTART:20201116T141500
CLASS:PUBLIC
LOCATION:online
SEQUENCE:0
SUMMARY:Lisa Sauermann (IAS\, Princeton): On the extension complexity of lo
w-dimensional polytopes
UID:107735875@www.facetsofcomplexity.de
URL:http://www.facetsofcomplexity.de/monday/20201116-L-Lisa-Sauermann.html
END:VEVENT
END:VCALENDAR