Dealing with Orbit Closures in Representations with Finitely Many Orbits

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=ecbONIVSA7A


Duration: 56:11
253 views
3

Jerzy Weyman, University of Connecticut
Geometric Complexity Theory
http://simons.berkeley.edu/talks/jerzy-weyman-2014-09-18



Other Videos By Simons Institute for the Theory of Computing


2014-09-19Tutorial 3: Geometric Invariant Theory
2014-09-19Orbit Closures
2014-09-19Generalized Knuth Equivalence for Schur Positivity
2014-09-19A Survey of Recent Results on Depth Reduction and Lower Bounds for Arithmetic Circuits
2014-09-19Essentially Optimal Interactive Certificates in Linear Algebra
2014-09-19Tutorial 1: The GCT Chasm I
2014-09-19Tutorial 2: Algorithmic Invariant Theory
2014-09-19Asymptotic Spectra: Old and New Insights
2014-09-19Inequalities and Reductions for Nonzero Kronecker Coefficients
2014-09-19A Study of the Representations Supported by the Orbit Closure of the Determinant
2014-09-19Dealing with Orbit Closures in Representations with Finitely Many Orbits
2014-09-19Geometry, Invariants, and the Elusive Search for Complexity Lower Bounds
2014-09-12Matrix Rigidity
2014-09-12Writing Down Polynomials via Representation Theory II
2014-09-12Condition
2014-09-12Tensor Decomposition II
2014-09-12Matrix Multiplication
2014-09-12Real Algebraic Geometry
2014-09-12Matrix Factorizations
2014-09-12Solving Polynomials II
2014-09-12Writing Down Polynomials via Representation Theory I


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithms and Complexity in Algebraic Geometry
Jerzy Weyman