English

Computing Algebraic Matroids

Combinatorics 2014-04-09 v2 Commutative Algebra Algebraic Geometry

Abstract

An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to each base, called the base degree. Decorated algebraic matroids can be computed via symbolic computation using Groebner bases, or through linear algebra in the space of differentials (with decorations calculated using numerical algebraic geometry). Both algorithms are developed here. Failure of the second algorithm occurs on a subvariety called the non-matroidal or NM- locus. Decorated algebraic matroids have widespread relevance anywhere that coordinates have combinatorial significance. Examples are computed from applied algebra, in algebraic statistics and chemical reaction network theory, as well as more theoretical examples from algebraic geometry and matroid theory.

Keywords

Cite

@article{arxiv.1403.8148,
  title  = {Computing Algebraic Matroids},
  author = {Zvi Rosen},
  journal= {arXiv preprint arXiv:1403.8148},
  year   = {2014}
}

Comments

15 pages; added link to references, note on page 1, and small formatting fixes

R2 v1 2026-06-22T03:39:31.399Z