| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 10:00 to 11:00 | Chandan Saha (IISc, Bengaluru) | Reconstruction of arithmetic circuits | ||
| 11:00 to 11:30 | -- | Tea Break | ||
| 11:30 to 12:30 | Neeraj Kayal (Microsoft Research, Bengaluru) | Reconstructing of arithmetic formula | ||
| 12:30 to 14:00 | -- | Lunch | ||
| 14:00 to 14:45 | Vineet Nair (IISc, Bengaluru) | Average-case linear matrix factorization and reconstruction of low width Algebraic Branching Programs | ||
| 14:45 to 15:15 | -- | Tea break | ||
| 15:15 to 16:00 | Shir Peleg-Schatzman (Tel Aviv University, Israel) | Sylvester-Gallai Problem for Quadratic Polynomials | ||
| 16:00 to 16:15 | -- | Short break | ||
| 16:15 to 17:00 | Abhranil Chatterjee (IMSc, Chennai) | The Arithmetic Complexity of S_{n,k}^* and Multilinear Monomial Counting and Detection |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 09:30 to 10:15 | Mrinal Kumar (Simons Institute, Univ of California, Berkeley) | Closure of VP under taking factors (Lecture 1) | ||
| 10:45 to 11:30 | Mrinal Kumar (Simons Institute, Univ of California, Berkeley) | Closure of VP under taking factors - Lecture 2 | ||
| 11:30 to 11:45 | -- | Tea break | ||
| 11:45 to 12:30 | Chi-Ning Chou (Harvard University, USA) | Some Closure Results for Polynomial Factorization and Applications | ||
| 12:00 to 12:15 | -- | Short break | ||
| 12:30 to 14:00 | -- | Lunch | ||
| 14:00 to 14:45 | Anamay Tengse (TIFR, Mumbai) | Bootstrapping Hitting Sets for Algebraic Models | ||
| 14:45 to 15:15 | -- | Tea Break | ||
| 15:15 to 16:00 | Purnata Ghosal (IIT Madras, Chennai) | Parameterized Lower Bounds on Multilinear Algebraic Models | ||
| 16:00 to 16:15 | -- | Tea break | ||
| 16:15 to 17:00 | Sumanta Ghosh | Towards blackbox identity testing of log-variate circuits |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 09:30 to 10:30 | Christian Ikenmeyer (Max Planck Institute for Software Systems, Germany ) | Introduction to Geometric Complexity Theory | ||
| 10:30 to 10:45 | -- | Tea break | ||
| 10:45 to 11:30 | Christian Ikenmeyer (Max Planck Institute for Software Systems, Germany) | Multiplicity obstructions are stronger than occurrence obstructions | ||
| 11:30 to 11:45 | -- | Short break | ||
| 11:45 to 12:30 | Nikhil Gupta (IISc, Bengaluru) | On the symmetries of and equivalence test for design polynomials | ||
| 12:30 to 14:00 | -- | Lunch | ||
| 14:00 to 14:45 | Ben Lee Volk (California Institute of Technology, USA) | Lower bounds for matrix factorization | ||
| 14:45 to 15:15 | -- | Tea Break | ||
| 15:15 to 16:00 | Anurag Pandey (Max Planck Institute for Informatics, Germany) | Approximating the (commutative) rank of symbolic matrices | ||
| 16:15 to 17:00 | -- | Open Problems session |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 09:30 to 10:15 | Ankit Garg (Microsoft Research, Bengaluru) | Invariant theory and optimization | ||
| 10:15 to 10:45 | -- | Tea Break | ||
| 10:45 to 11:30 | Rafael Oliveira (University of Toronto, Canada) | Polynomial Identity Testing via Optimization: algorithms for the null-cone problem and orbit closure intersection | ||
| 11:30 to 11:45 | -- | Short Break | ||
| 11:45 to 12:30 | Suryajith Chillara (IIT Bombay, India) | A Quadratic Size-Hierarchy Theorem for Small-Depth Multilinear Formulas | ||
| 12:30 to 14:00 | -- | Lunch | ||
| 14:00 to 14:45 | Ramya C (CMI, Chennai) | Proving super-polynomial lower bounds for syntactic multilinear branching programs: Approaches and Challenges | ||
| 15:15 to 16:15 | Zeyu Guo (IIT, Kanpur) | Deterministic Univariate Polynomial Factoring Over Finite Fields and P-schemes | ||
| 16:15 to 17:00 | Markus Bläser (Saarland University, Germany) | Testing membership in varieties, algebraic natural proofs, and geometric complexity theory |
| Time | Speaker | Title | Resources | |
|---|---|---|---|---|
| 09:30 to 10:15 | Prahladh Harsha (TIFR, Mumbai) | Small-set expansion in Grassman graph and the 2-to-2 Games Theorem (Lecture 1) | ||
| 10:15 to 10:45 | -- | Tea Break | ||
| 10:45 to 11:30 | Prahladh Harsha (TIFR, Mumbai) | Small-set expansion in Grassman graph and the 2-to-2 Games Theorem (Lecture 2) | ||
| 11:30 to 11:45 | -- | Short Break | ||
| 11:45 to 12:30 | Rajit Datta (TIFR, Mumbai) | Apolarity, Ideal Membership and Algorithms | ||
| 12:30 to 14:00 | -- | Lunch | ||
| 14:00 to 14:45 | Gorav Jindal (Aalto university, Finland) | Computing Real Roots of Sparse Polynomials | ||
| 14:45 to 15:15 | -- | Tea Break | ||
| 15:15 to 16:15 | Ashish Dwivedi (IIT - Kanpur, India ) | Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications |