BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69d350d617c5b
DTSTART;TZID=America/Toronto:20210325T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210325T130000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-colleen-robichaux
SUMMARY:Algebraic Combinatorics Seminar - Colleen Robichaux
CLASS:PUBLIC
DESCRIPTION:TITLE: An Efficient Algorithm for Deciding the Vanishing of Sc
 hubert\nPolynomial Coefficients\n\nSpeaker:\n Colleen Robichaux\n\nAffilia
 tion:\n University of Illinois at Urbana-Champaign\n\nZoom:\n Contact Kare
 n Yeats\n\nABSTRACT:\n\n Schubert polynomials form a basis of all polynom
 ials and appear in\nthe study of cohomology rings of flag manifolds. The v
 anishing problem\nfor Schubert polynomials asks if a coefficient of a Schu
 bert\npolynomial is zero. We give a tableau criterion to solve this proble
 m\,\nfrom which we deduce the first polynomial time algorithm. These\nresu
 lts are obtained from new characterizations of the Schubitope\, a\ngeneral
 ization of the permutahedron defined for any subset of the n x\nn grid. In
  contrast\, we show that computing these coefficients\nexplicitly is #P-co
 mplete. This is joint work with Anshul Adve and\nAlexander Yong.
DTSTAMP:20260406T062110Z
END:VEVENT
END:VCALENDAR