BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Shubhangi Saraf (Rutgers University) DTSTART:20220120T151500Z DTEND:20220120T170000Z DTSTAMP:20260422T070059Z UID:CJCS/53 DESCRIPTION:Title: Fa ctors of sparse polynomials: structural results and some algorithms\nb y Shubhangi Saraf (Rutgers University) as part of Copenhagen-Jerusalem Com binatorics Seminar\n\n\nAbstract\nAre factors of sparse polynomials sparse ? This is basic question\, and we are still quite far from understanding i t in general. In this talk\, I will show that this is in some sense true f or multivariate polynomials when the polynomial has each variable appearin g only with bounded degree. Our sparsity bound uses techniques from convex geometry\, such as the theory of Newton polytopes and an approximate vers ion of the classical Caratheodory's Theorem. \nUsing our sparsity bound\, we then show how to devise efficient deterministic factoring algorithms f or 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/53/ END:VEVENT END:VCALENDAR