Hopf algebras for matroids over hyperfields

Recently, M.~Baker and N.~Bowler introduced the notion of matroids over hyperfields as a unifying theory of various generalizations of matroids. In this paper we generalize the notion of minors and direct sums from ordinary matroids to matroids over hyperfields. Using this we generalize the classical construction of matroid-minor Hopf algebras to the case of matroids over hyperfields

Fixing numbers for matroids

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism group). We prove the fixing numbers for the cycle matroid and bicircular matroid associated with 3-connected graphs are identical. Many of these results have interpretations through permutation groups, and we make this connection explicit.Comment: This is a major revision of a previous versio

Computing Algebraic Matroids

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.Comment: 15 pages; added link to references, note on page 1, and small formatting fixe