Face module for realizable Z-matroids

In this work, we define the face module for a realizable matroid over Z. Its Hilbert series is, indeed, the expected specialization of the Grothendieck - Tutte polynomial defined by Fink and Moci. This work will appear in 'Contributions to Discrete Mathematics'Comment: 16 pages, 4 figures, 1 Tabl

Matroids over a ring

We introduce the notion of a matroid M over a commutative ring R, assigning to every subset of the ground set an R-module according to some axioms. When R is a field, we recover matroids. When R D Z, and when R is a DVR, we get (structures which contain all the data of) quasi-arithmetic matroids, and valuated matroids, i.e. tropical linear spaces, respectively. More generally, whenever R is a Dedekind domain, we extend all the usual properties and operations holding for matroids (e.g., duality), and we explicitly describe the structure of the matroids over R. Furthermore, we compute the Tutte-Grothendieck ring of matroids over R. We also show that the Tutte quasi-polynomial of a matroid over Z can be obtained as an evaluation of the class of the matroid in the Tutte-Grothendieck ring

Interlace Polynomials for Multimatroids and Delta-Matroids

We provide a unified framework in which the interlace polynomial and several related graph polynomials are defined more generally for multimatroids and delta-matroids. Using combinatorial properties of multimatroids rather than graph-theoretical arguments, we find that various known results about these polynomials, including their recursive relations, are both more efficiently and more generally obtained. In addition, we obtain several interrelationships and results for polynomials on multimatroids and delta-matroids that correspond to new interrelationships and results for the corresponding graphs polynomials. As a tool we prove the equivalence of tight 3-matroids and delta-matroids closed under the operations of twist and loop complementation, called vf-safe delta-matroids. This result is of independent interest and related to the equivalence between tight 2-matroids and even delta-matroids observed by Bouchet.Comment: 35 pages, 3 figure

The multivariate arithmetic Tutte polynomial

We introduce an arithmetic version of the multivariate Tutte polynomial, and (for representable arithmetic matroids) a quasi-polynomial that interpolates between the two. A generalized Fortuin-Kasteleyn representation with applications to arithmetic colorings and flows is obtained. We give a new and more general proof of the positivity of the coefficients of the arithmetic Tutte polynomial, and (in the representable case) a geometrical interpretation of them.Comment: 21 page

Tutte's dichromate for signed graphs

We introduce the ``trivariate Tutte polynomial" of a signed graph as an invariant of signed graphs up to vertex switching that contains among its evaluations the number of proper colorings and the number of nowhere-zero flows. In this, it parallels the Tutte polynomial of a graph, which contains the chromatic polynomial and flow polynomial as specializations. The number of nowhere-zero tensions (for signed graphs they are not simply related to proper colorings as they are for graphs) is given in terms of evaluations of the trivariate Tutte polynomial at two distinct points. Interestingly, the bivariate dichromatic polynomial of a biased graph, shown by Zaslavsky to share many similar properties with the Tutte polynomial of a graph, does not in general yield the number of nowhere-zero flows of a signed graph. Therefore the ``dichromate" for signed graphs (our trivariate Tutte polynomial) differs from the dichromatic polynomial (the rank-size generating function). The trivariate Tutte polynomial of a signed graph can be extended to an invariant of ordered pairs of matroids on a common ground set -- for a signed graph, the cycle matroid of its underlying graph and its frame matroid form the relevant pair of matroids. This invariant is the canonically defined Tutte polynomial of matroid pairs on a common ground set in the sense of a recent paper of Krajewski, Moffatt and Tanasa, and was first studied by Welsh and Kayibi as a four-variable linking polynomial of a matroid pair on a common ground set.Comment: 53 pp. 9 figure