BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Claremont Center for the Mathematical Sciences
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20250923T121500
DTEND;TZID=America/Los_Angeles:20250923T131000
DTSTAMP:20260510T121237
CREATED:20250811T185820Z
LAST-MODIFIED:20250813T192625Z
UID:3783-1758629700-1758633000@colleges.claremont.edu
SUMMARY:Graphical designs: combinatorics and applications (Catherine Babecki\, Caltech)
DESCRIPTION:A graphical design is a quadrature rule for a graph inspired by classical numerical integration on the sphere. Broadly speaking\, that means a graphical design is a relatively small subset of graph vertices chosen to capture the global behavior of functions from the vertex set to the real numbers. We first motivate and define graphical designs for graphs with positive edge weights. Through Gale duality\, we exhibit a combinatorial bijection between graphical designs and the faces of certain polytopes associated to a graph\, called eigenpolytopes. This polytope connection implies a variety of beautiful consequences\, including a proof of existence\, an upper bound on the cardinality of a graphical design\, methods to compute\, optimize\, and organize graphical designs\, the existence of random walks with improved convergence rates\, and complexity results for associated computational problems.  We conclude with applications to the equitable facility location problem.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-catherine-babecki-caltech/
LOCATION:Estella 2099
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR