BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Zuzana Patáková (Charles University\, Prague)
DTSTART:20201103T181500Z
DTEND:20201103T184500Z
DTSTAMP:20260423T024830Z
UID:LA-CoCo/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/LA-CoCo/13/"
 >Shellability is NP-complete</a>\nby Zuzana Patáková (Charles University
 \, Prague) as part of LA Combinatorics and Complexity Seminar\n\n\nAbstrac
 t\n<i><a href="https://en.wikipedia.org/wiki/Shelling_(topology)">Shellabi
 lity</a></i> is an important notion that lead to such mathematical discove
 ries as the Dehn-Sommerville relations\, the\nUpper Bound Theorem\, and ch
 aracterization of topology of the Bruhat order.\nRoughly speaking\, a simp
 licial complex is shellable if it can be build\ninductively while controll
 ing its topological properties.\nIn this talk we show that starting from d
 imension two\, deciding\nshellability is <b>NP</b>-complete.\n\nJoint work
  with Xavier Goaoc\, Pavel Paták\, Martin Tancer\, and Uli\nWagner.\n
LOCATION:https://researchseminars.org/talk/LA-CoCo/13/
END:VEVENT
END:VCALENDAR