We look forward to seeing you in person in 3401 Siebel Center for Computer Science.
Abstract: Recent years have seen a surge in algebraic methods for the design of faster algorithms for computationally intractable problems, such as matroid intersection, finding long simple cycles in graphs, and certain network design tasks. The algebraic tools employed to this end include e.g. group algebras, (tensor products of) exterior algebras, apolar algebras and Waring decompositions.
In this talk, I will survey these developments, outline connections both within algebra as well as to established combinatorial techniques (e.g. Color-Coding or representative families), and highlight some central open questions concerning the abovementioned algebraic protagonists.
