BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Non-Closure Properties of Read-Once Oblivious Algebraic Branching 
 Programs - Prateek Dwivedi (University of Copenhagen)
DTSTART:20260327T140000Z
DTEND:20260327T150000Z
UID:TALK246031@talks.cam.ac.uk
CONTACT:Tom Gur
DESCRIPTION:A central question in algebraic complexity theory is understan
 ding the behaviour of polynomial computation models under basic algebraic 
 operations. While closure under addition and multiplication holds for most
  of the standard models like algebraic circuits\, closure under factorisat
 ion remains subtle. In this talk\, we will discuss a new result which prov
 es that the well-studied model called read-once oblivious algebraic branch
 ing programs (ROABPs) is not closed under factoring. This result offers a 
 contrasting perspective to recent breakthrough work that gave a unified fr
 amework for proving closure under factorisation in other regimes. We will 
 also discuss similar non-closure properties of ROABPs under other natural 
 operations such as powering and symmetric composition.\n\nThis is based on
  joint work with Andrews\, Armand\, Hansen\, Limaye\, Srinivasan\, and Tav
 enas.
LOCATION:Computer Laboratory\, William Gates Building\, Room SS03
END:VEVENT
END:VCALENDAR