BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: We introduce a family of polytopes\, called primitive zonotope
 s\, which can be seen as a generalization of the permutahedron of type $B_d
 $. We discuss connections to the largest diameter of lattice polytopes and 
 to the computational complexity of multicriteria matroid optimization. Comp
 lexity results and open questions are also presented. In particular\, we an
 swer a question raised in 1986 by Colbourn\, Kocay\, and Stinson by showing
  that deciding whether a given sequence is the degree sequence of a 3-hyper
 graph is computationally prohibitive. Based on joint works with Asaf Levin 
 (Technion)\, George Manoussakis (Ben Gurion)\, Syed Meesum (IMSc Chennai)\,
  Shmuel Onn (Technion)\, and Lionel Pounin (Paris XIII). 
DTSTAMP:20181105T173500
DTSTART:20180625T141500
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:Antoine Deza (Université Paris Sud) On lattice polytopes\, convex m
 atroid optimization\, and degree sequences of hypergraphs
UID:89808488@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20180625-L-Dez
 a.html
END:VEVENT
END:VCALENDAR