BEGIN:VCALENDAR
CALSCALE:GREGORIAN
PRODID:iCalendar-Ruby
VERSION:2.0
BEGIN:VEVENT
DESCRIPTION: A long-standing open problem\, known as Hadwiger’s covering pr
 oblem\, asks what is the smallest natural number N(n) such that every conve
 x body in {\mathbb R}^n can be covered by a union of the interiors of at mo
 st N(n) of its translates.   In this talk\, I will discuss some history of 
 this problem and its close relatives\, and present more recent results\, in
 cluding a new general upper bound for N(n). 
DTSTAMP:20190429T142100
DTSTART:20190513T141500
CLASS:PUBLIC
LOCATION:Technische Universität Berlin\n Institut für Mathematik\n Straße d
 es 17. Juni 136\n 10623 Berlin\n Room MA 041 (Ground Floor)
SEQUENCE:0
SUMMARY:Boaz Slomka (Weizmann Institute of Science\, Rehovot Israel): On Ha
 dwiger&#x27\;s covering conjecture
UID:95690778@/www.mi.fu-berlin.de
URL:https://www.mi.fu-berlin.de/en/facetsofcomplexity/monday/20190513-L-Slo
 mka.html
END:VEVENT
END:VCALENDAR