BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20250330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260425T051630Z
UID:1752062400@ist.ac.at
DTSTART:20250709T140000
DTEND:20250709T150000
DESCRIPTION:Speaker: Gianluca Tasinato\nhosted by Johannes Fink\nAbstract: 
 This thesis investigates the interplay between algebraic and topological m
 ethods and combinatorial problems\, focusing on approximate graph colourin
 gs and mass partitioning. The unifying theme throughout the dissertation i
 s the use of continuous maps and symmetry constraints to extract combinato
 rial insights.We first explore approximate graph colouring problems and mo
 re generally promise constraint satisfaction problems. Using tools from eq
 uivariant topology in combination with the general theory of polymorphism 
 of a promise constraint satisfaction problem\, we establish hardness for s
 pecific types of approximations. In the second part\, we address mass par
 titioning problems\, where one seeks to divide geometric objects or measur
 es in Euclidean space into parts of equal size using hyperplanes. Employin
 g techniques from topological combinatorics (configuration space/test map 
 setup and Borsuk–Ulam type theorems)\, we both obtain a new equipartitio
 ning result in the  and provide a fast algorithm for computing equipartit
 ioning of point sets in 3D.
LOCATION:Sunstone Bldg / Ground floor / Big Seminar Room B (I23.EG.102) \, 
 ISTA
ORGANIZER:
SUMMARY:Gianluca Tasinato: Thesis Defense: Topological Methods in Discrete 
 Geometry and Theoretical Computer Science
URL:https://talks-calendar.ista.ac.at/events/5910
END:VEVENT
END:VCALENDAR