Simplicial Generation of Chow Rings of Matroids

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


Duration: 39:13
246 views
6

Chris Eur (Stanford University)
Geometry of Polynomials Reunion
https://simons.berkeley.edu/talks/simplicial-generation-chow-rings-matroids



Other Videos By Simons Institute for the Theory of Computing


2020-10-19Aspects of Coulomb Gases
2020-10-19Tail and Moment Bounds for Gaussian Chaoses in Banach Spaces
2020-10-14The Ethical Algorithm
2020-10-12New Tools for Analysis of Markov Chains via High-Dimensional Expansion
2020-10-12Lee-Yang Zeros and the Complexity of the Ferromagnetic Ising Model on Bounded-Degree Graphs
2020-10-12Determinantal Representations and the Principal Minor Map
2020-10-12A (Slightly) Improved Approximation Algorithm for Metric TSP
2020-10-12Zero-Free Regions for Repulsive Gasses
2020-10-12A Geometric Approach to Conic Stability of Polynomials
2020-10-12Paving Property for Strongly Rayleigh Distributions
2020-10-12Simplicial Generation of Chow Rings of Matroids
2020-10-12Classical Algorithms, Correlation Decay, and Complex Zeros of Quantum Partition Functions
2020-10-12Spectral Sets and Derivatives of The Psd Cone
2020-10-09Robustly Learning Mixtures of (Clusterable) Gaussians via the SoS Proofs to Algorithms Method
2020-10-05Richard M. Karp Distinguished Lecture – Safe Learning in Robotics
2020-10-02Deep Robust Reinforcement Learning and Regularization
2020-10-02Mixed Autonomy Traffic: A Reinforcement Learning Perspective
2020-10-02CoinDICE: Off-Policy Confidence Interval Estimation via Dual Lens
2020-10-02Rigorous Uncertainty Quantification for Off-policy Evaluation in Reinforcement Learning: a Variation
2020-10-02Is Safe Learning the Future of RL?
2020-10-01Policy Gradients Methods, Neural Policy Classes, and Distribution Shift


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing