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-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:20210314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20211107T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20220426T123000
DTEND;TZID=America/Los_Angeles:20220426T132000
DTSTAMP:20260426T135514
CREATED:20220127T053038Z
LAST-MODIFIED:20220421T192843Z
UID:2570-1650976200-1650979200@colleges.claremont.edu
SUMMARY:Bounds for nonzero Littlewood-Richardson coefficients (Müge Taskin\, Boğaziçi University\, Turkey)
DESCRIPTION:As  $\lambda$ runs through all integer partitions\, the set of   Schur functions $\{s_{\lambda}\}_\lambda$ forms a basis in the ring of symmetric functions. Hence the rule $$s_{\lambda}s_{\mu}=\sum c_{\lambda\,\mu}^{\gamma} s_{\gamma}$$ makes sense and the coefficients $c_{\lambda\,\mu}^{\gamma}$ are called \textit{Littlewood-Richardson (LR) coefficients}. The calculations of Littlewood-Richardson coefficients has been an important problem from the first time they were introduced\, due to their important role in representation theory of symmetric groups and enumerative geometry. \nIn this talk we will explain some of the main features of these coefficients and provide a summary of the characterizations given by Littlewood and Richardson (1934)\, Berenstein- Zelevinsky ()1988) and Knutson-Tao (1999). Then we will explain our approach to a seemingly easier problem\, that is\, the determination of  triples $(\lambda\,\mu\,\gamma)$  of partitions for which $c_{\lambda\,\mu}^{\gamma}$ is non zero. Our method describes some upper and lower bounds for triples $(\lambda\,\mu\,\gamma)$ with nonzero  $c_{\lambda\,\mu}^{\gamma}$\, by using  Young diagram combinatorics and especially\, the indispensable Dominance order. This is joint work with R. Bedii Gümüş and supported by Tübitak/1001/115F156.
URL:https://colleges.claremont.edu/ccms/event/antc-seminar-muge-taskin-bogazici-university-turkey/
LOCATION:On Zoom
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
END:VEVENT
END:VCALENDAR