BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Kwan (Stanford University)
DTSTART:20200713T130000Z
DTEND:20200713T140000Z
DTSTAMP:20260423T035528Z
UID:EPC/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/14/">Ext
 ension complexity of low-dimensional polytopes</a>\nby Matthew Kwan (Stanf
 ord University) as part of Extremal and probabilistic combinatorics webina
 r\n\n\nAbstract\nSometimes\, it is possible to represent a complicated pol
 ytope as a projection of a much simpler polytope. To quantify this phenome
 non\, the extension complexity of a polytope P is defined to be the minimu
 m number of facets in a (possibly higher-dimensional) polytope from which 
 P can be obtained as a linear projection. In this talk we discuss some ext
 remal and probabilistic questions about this notion. This is a joint work 
 with Lisa Sauermann and Yufei Zhao.\n
LOCATION:https://researchseminars.org/talk/EPC/14/
END:VEVENT
END:VCALENDAR