Torus Quotients in the Grassmannian
K. V. Subrahmanyam (Chennai Mathematical Institute)
https://simons.berkeley.edu/talks/kv
Algebraic Methods
Other Videos By Simons Institute for the Theory of Computing
2019-01-22 | Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - A |
2019-01-22 | Ramanujan Graphs, Treelike Walks, and Mixed Characteristic Polynomials - B |
2019-01-22 | The Method of Interlacing Polynomials - B |
2019-01-22 | The Method of Interlacing Polynomials - A |
2019-01-22 | Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-B |
2019-01-22 | Real Stable Polynomials, Strongly Rayleigh Distributions, and Applications, Part I-A |
2019-01-22 | Real-Rooted Polynomials (problem session) |
2019-01-22 | Real-Rooted Polynomials |
2018-12-20 | Berkeley in the 80s, Episode 1: Shafi Goldwasser |
2018-12-07 | Fast Exact Algorithms Using Hadamard Product of Polynomials |
2018-12-07 | Torus Quotients in the Grassmannian |
2018-12-07 | Complexity of Separation of Variables and Splitting of Monomials |
2018-12-07 | Small-Depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication with Applications |
2018-12-06 | Near-Optimal Bootstrapping of Hitting Sets |
2018-12-06 | Generic vs Symbolic Behaviour, and Power Series Expansion |
2018-12-06 | Barriers for Rank Methods in Arithmetic Complexity |
2018-12-06 | Formal Series and Non-Commutative Computations |
2018-12-06 | Complete Derandomization of Identity Testing of Read-Once Formulas |
2018-12-06 | PIT Questions in Invariant Theory |
2018-12-06 | Analyzing Alternating Minimization Algorithms Using Algebraic Methods |
2018-12-05 | Algebraic Dependence is Not Hard (& Filling the GCT Chasm) |
Tags: Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Algebraic Methods
K. V. Subrahmanyam