BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20261101T133035
DTSTART;TZID=America/Detroit:20261102T160000
DTEND;TZID=America/Detroit:20261102T170000
SUMMARY:Workshop / Seminar:How plabic graphs describe weakly separated collections
DESCRIPTION:Two k-element subsets I\,J of {1\,2\,…\,n} are weakly separated if the sets I\J and J\I (when drawn on a circle with vertices 1\,2\,…\,n) can be separated by a chord. A maximal weakly separated collection is a set of pairwise weakly-separated k-element subsets of {1\,2\,…\,n} that is not contained in any larger set with this property. This definition gives rise to natural combinatorial questions: How big is a maximal weakly separated collection? How many are there? How are they related to each other?\n\nI will outline how Oh\, Posknikov\, Speyer answered most of these questions via a bijection between maximal weakly separated collections in a positroid and move-equivalent plabic graphs. Along the way\, we’ll meet some fun combinatorial objects related to plabic graphs including bounded affine permutations\, Grassmann necklaces\, positroids\, and plabic tilings.
UID:154396-21917646@events.umich.edu
URL:https://events.umich.edu/event/154396
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 3866
CONTACT:
END:VEVENT
BEGIN:VEVENT
DTSTAMP:20261102T113259
DTSTART;TZID=America/Detroit:20261102T160000
DTEND;TZID=America/Detroit:20261102T170000
SUMMARY:Workshop / Seminar:ISRMT Seminar: On Hirota's discrete KP equation - from geometry to multiple bi-orthogonal polynomials
DESCRIPTION:Abstract: We generalize the well known connection between the Toda lattice equation\, Pade approximants and orthogonal polynomials to the level of the Hirota system. We first present incidence geometric meaning of the multidimensional consistency of the system and its relation to Zamoldchikov's tetrahedron equation. Then we show how Hermite-Pade approximants and multiple orthogonal polynomials provide certain solutions to the Hirota system and its linear problem. Finally\, we extend the construction to the case of bi-moments and quasi-determinants.
UID:153397-21915803@events.umich.edu
URL:https://events.umich.edu/event/153397
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:Off Campus Location
CONTACT:
END:VEVENT
END:VCALENDAR