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
algebra:start [2018/09/17 19:13]
Algebraic and Geometric Complexity
algebra:start [2018/12/12 04:44] (current)
Algebraic and Geometric Complexity
Line 3: Line 3:
  
  
-Next meetingTuesdaySeptember 184:00 pm in room 116 (the room is reserved for us). Rafael Oliveira ​will talk about [[https://​arxiv.org/​abs/​1710.09502]].+ 
 +===== Past talks ===== 
 + 
 +  * 2018-12-11Amir YehudayoffProof complexity  
 +  * 2018-11-27: Nutan LimayeWaring rank of monomials  
 +  * 2018-11-13Vishwas 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 
  
  
 ===== Papers ===== ===== 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]]   * 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, Garg, Oliveira, Wigderson, 2017, Barriers for Rank Methods in Arithmetic Complexity [[https://​arxiv.org/​abs/​1710.09502|link]]
Line 19: Line 35:
   * GCT lecture notes [[http://​people.mpi-inf.mpg.de/​~cikenmey/​teaching/​summer17/​introtogct/​gct.pdf|link]]   * GCT lecture notes [[http://​people.mpi-inf.mpg.de/​~cikenmey/​teaching/​summer17/​introtogct/​gct.pdf|link]]
  
-===== Open problems ===== 
- 
-  * 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? 
  
 ===== MathJax ===== ===== MathJax =====
algebra/start.1537211622.txt.gz · Last modified: 2018/09/17 19:13 by Algebraic and Geometric Complexity