BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Plone.org//NONSGML plone.app.event//EN
X-WR-TIMEZONE:Europe/Madrid
BEGIN:VEVENT
SUMMARY:Computational geometry seminars: J. Pfeifle
DTSTART;TZID=Europe/Madrid;VALUE=DATE-TIME:20160607T123000
DTEND;TZID=Europe/Madrid;VALUE=DATE-TIME:20160610T133000
DTSTAMP;VALUE=DATE-TIME:20210619T054751Z
UID:57a8cbb276214d3d84f6d61bad7807d9@www.mat.upc.edu
CREATED;VALUE=DATE-TIME:20160601T102332Z
DESCRIPTION:The simplexity of a convex d-polytope P with n vertices is the
minimum number of simplices necessary to triangulate P without using new
vertices. In dimension 3 and above\, bounds for the simplexity are scarce\
, even in such well-studied cases as the d-dimensional cube.\n\nOne genera
l method for obtaining bounds on the simplexity is doing linear optimizati
on over the universal polytope U(P). However\, since U(P) lives in \n(d+1)
-dimensional space\, these linear programs quickly become infeasible compu
tationally. On the other hand\, if P is symmetric\, we can use techniques
from the representation theory of finite groups to simplify the computatio
ns.\n\nIn the Tuesday session\, we'll give a crash course on the basics of
representation theory\, and apply these tools to the problem at hand on F
riday.
LAST-MODIFIED;VALUE=DATE-TIME:20160602T232124Z
LOCATION:Room S215 Omega Building\, Campus Nord UPC (equiv.: Room 215 Floo
r -2)
URL:https://mat.upc.edu/ca/activitats/computational-geometry-seminars-j-pf
eifle
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Madrid
X-LIC-LOCATION:Europe/Madrid
BEGIN:DAYLIGHT
DTSTART;VALUE=DATE-TIME:20160327T030000
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR