BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//eventon.com NONSGML v1.0//EN
BEGIN:VEVENT
UID:60a1900491150
DTSTAMP:20210516T223500
DTSTART:20191031T160000
DTEND:20191031T170000
LOCATION:Mathematical Institute
SUMMARY:Pure Maths Colloquium – Arnau Padrol (Jussieu)
DESCRIPTION: On Moser's shadow problem In a famous list of problems in combinatorial geometry from 1966\, Leo Moser asked for the largest s(n) such that every 3-dimensional convex polyhedron with n vertices has a 2-dimensional shadow with at least s(n) vertices. I will describe the main steps towards the answer\, which[..]
END:VEVENT
END:VCALENDAR