algebra:start

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

Both sides previous revision Previous revision Next revision | Previous revision | ||

algebra:start [2018/10/22 00:53] Algebraic and Geometric Complexity |
algebra:start [2018/12/12 04:44] (current) Algebraic and Geometric Complexity |
||
---|---|---|---|

Line 3: | Line 3: | ||

- | Next meeting: Tuesday, October 9, 4:00 pm (not 4:10pm) in room 116 (the room is reserved for us). Christian Ikenmeyer will explain the concept of Young flattenings, talk about the connections between the method of shifted partial derivatives and Young flattenings, and about what has been achieved with Young flattenings so far. | + | |

+ | ===== 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 | ||

===== 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]] | * 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]] | * Bürgisser, Ikenmeyer, Panova, 2016, No occurrence obstructions in geometric complexity theory [[https://arxiv.org/abs/1604.06431|link]] | ||

Line 21: | 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? | ||

- | |||

- | ===== Past talks ===== | ||

- | |||

- | * 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 ===== | ===== MathJax ===== |

algebra/start.1540169589.txt.gz · Last modified: 2018/10/22 00:53 by Algebraic and Geometric Complexity