This is an old revision of the document!
Algebraic and Geometric Complexity Theory Reading/Discussion Group
You can edit this page using the wiki syntax.
Next meeting: Tuesday, November 13, 4:00 pm (not 4:10pm) in room 116 (the room is reserved for us). Vishwas Bhargav will talk about Deterministic Factorization of Sparse Polynomials of Bounded Individual Degree.
Papers
Allender, Gal, Mertz, 2014, Dual VP classes
link
Bürgisser, Ikenmeyer, Panova, 2016, No occurrence obstructions in geometric complexity theory
link
Kumar, 2018, On top fan-in vs formal degree for depth-3 arithmetic circuits
link
Efremenko, Garg, Oliveira, Wigderson, 2017, Barriers for Rank Methods in Arithmetic Complexity
link
Efremenko, Landsberg, Schenck, Weyman, 2016, The method of shifted partial derivatives cannot separate the permanent from the determinant
link
Oeding, 2016, Border ranks of monomials
link
Bläser, Ikenmeyer, Jindal, Lysikov, 2018, Generalized Matrix Completion and Algebraic Natural Proofs
link
Introductions to the representation theory of the general linear group are for example given here:
Past talks
2018-11-27: Nutan Limaye, Waring rank of monomials
2018-11-13: Vishwas Bhargava, Deterministic Factorization of Sparse Polynomials of Bounded Individual Degree
2018-10-23: Christian Ikenmeyer, Young flattenings
2018-10-09: Eric Allender, Dual VP classes
2018-10-02: Christian Ikenmeyer, No occurrence obstructions in geometric complexity theory
2018-09-25: Mrinal Kumar, Generalized matrix completion and algebraic natural proofs
-
2018-09-07: Mrinal Kumar, On top fan-in vs formal degree for depth-3 arithmetic circuits
2018-09-04: Christian Ikenmeyer, Introduction to the representation theory of the general linear group
MathJax
This site also supports MathJax for LaTeX.
For instance, type this
\(\det X = f(\vec x)\).
to get this:
\(\det X = f(\vec x)\).