Thursdays 5-6:30pm, Evans Hall, Room 891
Organizer: Anna Seigal (contact: "my last name" at berkeley dot edu)
Faculty Contact: Bernd Sturmfels
CCN: Math 290, 15807(8)
Invariants are quantities unchanged under group actions. Uses of invariants range from the construction of moduli spaces in algebraic geometry to approximation algorithms and computational complexity in computer science. In this seminar, we will learn some geometric invariant theory, and use it to understand recent applications of the field.
Topics will include: Hilbert's Finiteness Theorem, degree bounds of invariants, stability in geometric invariant theory, computing the ring of invariants, GL invariants of matrices and tensors, applications to scaling algorithms for tensors, complexity theory, optimization, and quantum information theory.
After the first week, the seminar will consists of two talks of 35 minutes each. The first talk will introduce concepts that will be useful for the second half.
Please join us: all are welcome.
1/24: Organizational meeting
1/31: Computing Invariants (Bernd Sturmfels) [Ref. 4 §11]
(1) H. Derksen, G. Kemper: Computational invariant theory. Encyclopaedia of Mathematical Sciences, 130. Invariant Theory and Algebraic Transformation Groups, VIII. Springer, Heidelberg, 2015.
(2) I. Dolgachev: Lectures on invariant theory. London Mathematical Society Lecture Note Series, 296. Cambridge University Press, Cambridge, 2003.
(3) J. Draisma and D. Gijswijt: Invariant Theory with Applications, Lecture Notes, 2009
(4) M. Michałek, B. Sturmfels: Invitation to Nonlinear Algebra, Lectures Notes, 2018.
(5) B. Sturmfels: Algorithms in invariant theory. Texts and Monographs in Symbolic Computation. Springer, Vienna, 2008.
(6) A. Widgerson: Interactions of Computational Complexity Theory and Mathematics, Mathematics and Computation book draft, arXiv:1710.09780 .
(7) A. Bandeira, B. Blum-Smith, J. Kileel, A. Perry, J. Weed, A. Wein: Estimation under group actions: recovering orbits from invariants, arXiv:1712.10163
(8) M. Bürgin, J. Draisma: The Hilbert null-cone on tuples of matrices and bilinear forms, Math. Z. 254 (2006), no. 4, 785–809.
(9) P. Bürgisser, A. Garg, R. Oliveira, M. Walter, A. Wigderson: Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory, Proceedings of the Innovations in Theoretical Computer Science (ITCS) 2018, pp. 24:1-24:20, 2018.
(10) P. Bürgisser, J. M. Landsberg, L. Manivel, J. Weyman : An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to VP \neq VNP, SIAM Journal on Computing 40 no. 4, 2011.
(11) E. Reinecke: Moduli Space of Cubic Surfaces (2012) thesis.
(12) C. Costello, A. Deines-Schartz, K. Lauter, and T. Yang: Constructing Abelian Surfaces for Cryptography via Rosenhain Invariants, LMS Journal of Computation and Mathematics 17 (2014) Issue A 157--180.