User Tools

Site Tools


algebra:start

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Last revision Both sides next revision
algebra:start [2018/09/05 23:14]
Algebraic and Geometric Complexity
algebra:start [2018/12/12 04:43]
Algebraic and Geometric Complexity [Past talks]
Line 1: Line 1:
-====== Algebraic and Geometric Complexity ======+====== Algebraic and Geometric Complexity ​Theory Reading/​Discussion Group ====== 
 +You can edit this page using the [[https://​www.dokuwiki.org/​wiki:​syntax|wiki syntax]]. 
 + 
 + 
 +Next meeting: Tuesday, December 11, **4:00 pm** (not 4:10pm) in room 116 (the room is reserved for us). Amir Yehudayoff will talk about his research.  
 + 
 +===== Papers ===== 
 + 
 +  * Bhargava, Saraf, Volkovich, 2018, Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree [[https://​arxiv.org/​abs/​1808.06655|link]] 
 +  * Allender, Gal, Mertz, 2014, Dual VP classes [[https://​eccc.weizmann.ac.il/​report/​2014/​122/​|link]] 
 +  * Bürgisser, Ikenmeyer, Panova, 2016, No occurrence obstructions in geometric complexity theory [[https://​arxiv.org/​abs/​1604.06431|link]] 
 +  * Kumar, 2018, On top fan-in vs formal degree for depth-3 arithmetic circuits [[https://​arxiv.org/​abs/​1804.03303|link]] 
 +  * Efremenko, Garg, Oliveira, Wigderson, 2017, Barriers for Rank Methods in Arithmetic Complexity [[https://​arxiv.org/​abs/​1710.09502|link]] 
 +  * Efremenko, Landsberg, Schenck, Weyman, 2016, The method of shifted partial derivatives cannot separate the permanent from the determinant [[https://​arxiv.org/​abs/​1609.02103|link]] 
 +  * Oeding, 2016, Border ranks of monomials [[https://​arxiv.org/​abs/​1608.02530|link]] 
 +  * Bläser, Ikenmeyer, Jindal, Lysikov, 2018, Generalized Matrix Completion and Algebraic Natural Proofs [[https://​eccc.weizmann.ac.il/​report/​2018/​064/​download|link]] 
 + 
 +Introductions to the representation theory of the general linear group are for example given here: 
 +  * Fulton'​s book [[https://​books.google.com/​books/​about/​Young_Tableaux.html?​id=U9vZal2HCcoC|link]] 
 +  * Christian'​s thesis [[http://​digital.ub.uni-paderborn.de/​hsx/​download/​pdf/​540974|link]] 
 +  * GCT lecture notes [[http://​people.mpi-inf.mpg.de/​~cikenmey/​teaching/​summer17/​introtogct/​gct.pdf|link]] 
 + 
 + 
 +===== Past talks ===== 
 + 
 +  * 2018-12-11: Amir Yehudayoff, Proof complexity  
 +  * 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-18: Rafael Oliveira, Barriers for Rank Methods in Arithmetic Complexity [[https://​arxiv.org/​abs/​1710.09502]]. 
 +  * 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 [[http://​www.mathjax.org|MathJax]] for LaTeX. 
 +For instance, type this <​code>​\(\det X = f(\vec x)\). </​code>​ 
 +to get this: 
 +\(\det X = f(\vec x)\). 
  
-test 
algebra/start.txt · Last modified: 2018/12/12 04:44 by Algebraic and Geometric Complexity