Generalized Knuth Equivalence for Schur Positivity

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


Duration: 55:33
429 views
2

Jonah Blasiak, Drexel University
Geometric Complexity Theory
http://simons.berkeley.edu/talks/jonah-blasiak-2014-09-16



Other Videos By Simons Institute for the Theory of Computing


2014-09-29Adventures in Linear Algebra++ and Unsupervised Learning
2014-09-29Noncommutative Polynomial Optimization under Dimension Constraints
2014-09-29Convergence of SDP Hierarchies Using Kernel Based Methods: Moment Matrices
2014-09-29The Edge of Tractability: Unique Games vs Sum of Squares
2014-09-29Positive Semidefinite Rank
2014-09-29Relative Entropy Relaxations for Signomial Optimization
2014-09-29Robust Sketching for Large-Scale Multi-Instance Conic Optimization
2014-09-19Wrap Session part 2
2014-09-19Wrap Session part 1
2014-09-19Wrap Session Discussion
2014-09-19Generalized Knuth Equivalence for Schur Positivity
2014-09-19Approaches to Bounding the Exponent of Matrix Multiplication
2014-09-19Hilbert Functions, Shallow Circuits, and Other Approaches to GCT
2014-09-19Fano Schemes of Determinants and Permanents
2014-09-19Tutorial 5: The GCT Chasm II
2014-09-19Plethysm and Lattice Point Counting
2014-09-19Tutorial 4: GCT and Matrix Multiplication
2014-09-19Dealing with Orbit Closures in Representations with Finitely Many Orbits
2014-09-19Matrix Rank – Extensions, Applications and Open Problems
2014-09-19Approximate Counting via Correlation Decay
2014-09-19A Survey of Counting Dichotomies and Holographic Algorithms


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