BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: The associahedron has a natural extension called the multiasso
 ciahedron. It is a vertex-decomposable simplicial sphere (in other words\, 
 a "combinatorially nice" sphere). Since at least 2003\, people tried to con
 struct simplicial polytopes\, whose boundary is this simplicial complex\, w
 ith limited success. In this talk\, I will reveal (at least) three combinat
 orial "known-to-be-challenging" computational problems which should be indi
 spensably faced to solve this problem. 
DTSTAMP:20181112T182000
DTSTART:20181119T160000
CLASS:PUBLIC
LOCATION:Technische Universität Berlin Institut für Mathematik Straße des 1
 7. Juni 136 10623 Berlin Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Jean-Philippe Labbé (Freie Universität Berlin): (At least) three ha
 rd problems behind the multiassociahedron
UID:94624970@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20181119-C-Lab
 be.html
END:VEVENT
END:VCALENDAR