David Speyer : Matroids and Grassmannians
Matroids are combinatorial devices designed to encoded the combinatorial structure of hyperplane arrangements. Combinatorialists have developed many invariants of matroids. I will explain that there is reason to believe that most of these invariants are related to computations in the K-theory of the Grassmannian. In particular, I will explain work of mine limiting the complexity of Hacking, Keel and Tevelev's "very stable pairs", which compactify the moduli of hyperplane arrangements. This talk should be understandable both to those who don't know matroids, and to those who don't know K-theory.
- Category: Presentations
- Duration: 01:34:47
- Date: February 2, 2009 at 4:25 PM
- Tags: seminar, Department of Mathematics Seminar