BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Shubhangi Saraf (University of Toronto)
DTSTART:20220303T151500Z
DTEND:20220303T170000Z
DTSTAMP:20260422T065829Z
UID:CJCS/63
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/63/">Fa
 ctors of sparse polynomials: structural results and some algorithms</a>\nb
 y Shubhangi Saraf (University of Toronto) as part of Copenhagen-Jerusalem 
 Combinatorics Seminar\n\n\nAbstract\nAre factors of sparse polynomials spa
 rse? This is basic question\, and we are still quite far from understandin
 g it in general. In this talk\, I will show that this is in some sense tru
 e for multivariate polynomials when the polynomial has each variable appea
 ring only with bounded degree. Our sparsity bound uses techniques from con
 vex geometry\, such as the theory of Newton polytopes and an approximate v
 ersion of the classical Caratheodory's Theorem.  \nUsing our sparsity boun
 d\, we then show how to devise efficient deterministic factoring algorithm
 s for sparse polynomials of bounded individual degree.\nThe talk is based 
 on joint work with Vishwas Bhargav and Ilya Volkovich.\n
LOCATION:https://researchseminars.org/talk/CJCS/63/
END:VEVENT
END:VCALENDAR