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
DTSTART:20260327T140000Z
DTEND:20260327T150000Z
UID:TALK246016@talks.cam.ac.uk
CONTACT:Ioannis Markakis
DESCRIPTION:A central question in algebraic complexity theory is understan
 ding the\nbehaviour of polynomial computation models under basic algebraic
 \noperations. While closure under addition and multiplication holds for\nm
 ost of the standard models like algebraic circuits\, closure under\nfactor
 isation remains subtle. In this talk\, we will discuss a new result\nwhich
  proves that the well-studied model called read-once oblivious\nalgebraic 
 branching programs (ROABPs) is not closed under factoring.\nThis result of
 fers a contrasting perspective to recent breakthrough work that gave a uni
 fied framework for proving closure under factorisation in other regimes. W
 e will also discuss similar non-closure properties of ROABPs under other n
 atural operations such as powering and symmetric composition.\n\nThis is b
 ased on joint work with Andrews\, Armand\, Hansen\, Limaye\,\nSrinivasan\,
  and Tavenas.
LOCATION:SS03\, Computer Laboratory
END:VEVENT
END:VCALENDAR