• Click on the titles of individual talks for abstract, slides and archived video.

–
Coffee and Check-In
–
Opening Remarks
–
Invariant Theory for Computer Scientists

Avi Wigderson (Institute for Advanced Study, Princeton)
Video
–
Break
–
The GCT Program: Recent Developments and Some Concrete Open Problems

Ketan Mulmuley (The University of Chicago)
Video
–
Lunch
–
Geometric Complexity Theory: No Occurrence Obstructions for Determinant vs Permanent

Peter Bürgisser (Technical University of Berlin)
Video
–
Break
–
Orbits of Monomials and Factorization into Products of Linear Forms

Pascal Koiran (Ecole Normale Supérieure de Lyon)
Video
–
Proof Complexity Lower Bounds from Graph Expansion and Combinatorial Games

Jakob Nordström (University of Copenhagen)
Video
–
Coffee and Check-In
–
Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication

Virginia Williams (Massachusetts Institute of Technology)
Video
–
Break
–
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree

Vishwas Bhargava (Rutgers University)
Video
–
An Instance of Symbolic Determinant Identity Testing via *-algebras

Youming Qiao (University of Technology, Sydney)
Video
–
Lunch
–
Kronecker and Plethysm Coefficients in Geometric Complexity Theory: Permanent vs Determinant and Matrix Powering

Greta Panova (University of Southern California)
Video
–
Break
–
Recent Progress on Representation Theoretic Multiplicities in GCT

Christian Ikenmeyer (University of Warwick)
Video
–
Generalized Matrix Completion and Algebraic Natural Proofs

Markus Bläser (Universität des Saarlandes)
Video
–
Reception
–
Coffee and Check-In
–
Proper Learning Algorithms from Lower Bounds for Arithmetic Circuits

Neeraj Kayal (Microsoft Research India)
Video
–
Break
–
Fine-Grained Algorithms and Complexity of Solving Polynomial Systems of Equations

Ryan Williams (Massachusetts Institute of Technology)
Video
–
An Improved Depth Reduction for Syntactically Multilinear Circuits

Mrinal Kumar (Harvard University)
Video
–
Lunch
–
Reconstruction of Non-Degenerate Homogeneous Depth Three Circuits

Chandan Saha (Indian Institute of Science)
Video
–
Break
–
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits

Michael Forbes (University of Illinois at Urbana-Champaign)
Video
–
Algebraic Dependence is Not Hard (& Filling the GCT Chasm)

Nitin Saxena (IIT Kanpur)
Video
–
Open Problem Session
–
Coffee and Check-In
–
Analyzing Alternating Minimization Algorithms Using Algebraic Methods

Ankit Garg (Microsoft Research India)
Video
–
PIT Questions in Invariant Theory

Rafael Mendes de Oliveira (University of Waterloo)
Video
–
Break
–
Complete Derandomization of Identity Testing of Read-Once Formulas

Ilya Volkovich (University of Michigan)
Video
–
Formal Series and Non-Commutative Computations

Guillaume Malod (Université Paris Diderot)
Video
–
Lunch
–
Barriers for Rank Methods in Arithmetic Complexity

Klim Efremenko (Ben Gurion University)
Video
–
Break
–
Generic vs Symbolic Behaviour, and Power Series Expansion

Visu Makam (Institute for Advanced Study)
Video
–
Near-Optimal Bootstrapping of Hitting Sets

Ramprasad Saptharishi (Tata Institute of Fundamental Research, Mumbai)
Video
–
Coffee and Check-In
–
Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications

Nutan Limaye (Indian Institute of Technology Bombay)
Video
–
Break
–
Complexity of Separation of Variables and Splitting of Monomials

Leonid Gurvits (City University of New York)
Video
–
Lunch
–
Torus Quotients in the Grassmannian

K. V. Subrahmanyam (Chennai Mathematical Institute)
Video
–
Break
–
Fast Exact Algorithms Using Hadamard Product of Polynomials

Vikraman Arvind (Institute of Mathematical Sciences)
Video