Linearizing Algebraic Matroids
Zvi Rosen, Jessica Sidman, Louis Theran
Abstract
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with an isomorphic linear matroid if one exists. We describe an explicit construction that produces a linear representation over an algebraically closed field of characteristic zero starting with the data used in applications. We will also discuss classical examples of algebraic matroids in the modern language of polynomial ideals, illustrating how the existence of an isomorphic linear matroid depends on properties of the field.
