BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Colleen Robichaux (UCLA)
DTSTART:20260528T210000Z
DTEND:20260528T220000Z
DTSTAMP:20260604T163856Z
UID:ucla_comb_sem/89
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/ucla_comb_se
 m/89/">Polynomial Identity Testing in Combinatorics</a>\nby Colleen Robich
 aux (UCLA) as part of UCLA Combinatorics Seminar\n\nLecture held in MS 620
 1.\n\nAbstract\nPolynomial identity testing (PIT) is the problem of decidi
 ng if two multivariate polynomials are the same. In this talk\, I will giv
 e an introduction to PIT and illustrate how it may be leveraged to solve c
 ombinatorial decision problems. In particular\, we will see how PIT may be
  used to solve the Schubert vanishing problem. Lastly we will discuss how 
 these ideas extend towards counting problems. This includes joint work wit
 h Igor Pak.\n
LOCATION:https://researchseminars.org/talk/ucla_comb_sem/89/
END:VEVENT
END:VCALENDAR