BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//prima-2022//speaker calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZOME
TZID:America/Vancouver
TZURL:http://tzurl.org/zoneinfo-outlook/America/Vancouver
X-LIC-LOCATION:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Vancouver:20221206T120000
DTSTART;TZID=America/Vancouver:20221206T120000
DTEND;TZID=America/Vancouver:20221206T122000

UID:20221206T120000@prima2022.primamath.org
SUMMARY:Parking Spaces in Coxeter-Catalan combinatorics
DESCRIPTION:The collection of parking functions under a natural Sn-action (which has Catalan-many orbits) has been a central object in Algebraic Combinatorics since the work of Haiman more than 30 years ago. One of the lines of research spawned around it was towards defining and studying analogous objects for real and complex reflection groups W; the main candidates are known as the W-non-nesting and W-non-crossing parking functions.
<br><br>
The W-non-nesting parking functions are relatively well understood; they form the so called algebraic W-parking-space which has a concrete interpretation as a quotient ring (of the ambient polynomial algebra over a system of homogeneous parameters that carry the reflection representation of W). The W-non-crossing parking functions on the other hand have defied unified explanations while simultaneously proving themselves central in the study of Coxeter and Artin groups (their geometric group theory and combinatorics) and in the representation theory of Dynkin quivers. One of the main open problems in the field since the early 2000's has been to give a type-independent proof of the W-isomorphism between the algebraic and the non-crossing W-parking spaces. In this talk, I will present the first such proof, solving the more general Fuss version of the problem, that proceeds by comparing a collection of recursions that are shown to be satisfied by both objects. This relies on a variety of recent techniques we introduced, in particular a parabolic decomposition of the algebraic parking space and its relation with the spectrum of Laplacian matrices for reflection arrangements.
STATUS:CONFIRMED
LOCATION:Junior Ballroom D
END:VEVENT
END:VCALENDAR
