``Discretely ending the year I'': Computing Algebraic MatroidsAlgebra & Discrete Mathematics
|Speaker:||Zvi Rosen, UC Berkeley|
|Start time:||Mon, Jun 9 2014, 3:10PM|
Algebraic matroids characterize the combinatorial structure of an algebraic variety. By decorating the matroid with circuit polynomials and base degrees, we capture even more information about the variety and its coordinate projections. In this talk, we will introduce algebraic matroids, discuss algorithms for their computation, and present some motivating examples.
This is part I of the ``Discretely ending the year event'' Part II is the key note speaker followed by reception.