User Tools

Site Tools


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: Friday, September 7, 2:00 pm in room 116 (if the room is available). Mrinal Kumar will talk about

The usual meeting time is Tuesdays, 4:00pm-5:30pm.

We will not have a meeting during the Boolean Devices workshop.


  • 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:

  • Fulton's book link
  • Christian's thesis link
  • GCT lecture notes link

Open questions

  • Does the class of p-families of polynomially bounded Waring rank equal the class of p-families of polynomially bounded border Waring rank?
  • Is the Euclidean closure of the class VF of p-families of polynomially bounded formula size contained in VNP?


This site also supports MathJax for LaTeX. For instance, type this

\(\det X = f(\vec x)\). 

to get this: \(\det X = f(\vec x)\).

algebra/start.1536191837.txt.gz · Last modified: 2018/09/05 23:57 by Algebraic and Geometric Complexity