Related papers: Arithmetic matroids, Tutte polynomial, and toric a…
In this paper we build an Orlik-Solomon model for the canonical gradation of the cohomology algebra with integer coefficients of the complement of a toric arrangement. We give some results on the uniqueness of the representation of…
The Tutte polynomial of a connected graph was originally defined by Tutte as a sum over all spanning trees of monomials depending on a fixed linear order on the set of edges. Tuttle proved that while these monomials do depend on the linear…
We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on…
It has long been known that to a complex cubic surface or threefold one can canonically associate a principally polarized abelian variety. We give a construction which works for cubics over an arithmetic base. This answers, away from the…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
We show that the 4-variable generating function of certain orientation related parameters of an ordered oriented matroid is the evaluation at (x + u, y+v) of its Tutte polynomial. This evaluation contains as special cases the counting of…
We generalize the Tutte polynomial of a matroid to a morphism of matroids via the K-theory of flag varieties. We introduce two different generalizations, and demonstrate that each has its own merits, where the trade-off is between the ease…
This is a chapter destined for the book "Handbook of the Tutte Polynomial". The chapter is a composite. The first part is a brief introduction to Orlik-Solomon algebras. The second part sketches the theory of evaluative functions on matroid…
$q$-Matroids are defined on complemented modular support lattices. Minors of length 2 are of four types as in a "classical" matroid. Tutte polynomials $\tau(x,y)$ of matroids are calculated either by recursion over deletion/contraction of…
The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…
We use the geometry of the stellahedral toric variety to study matroids. We identify the valuative group of matroids with the cohomology ring of the stellahedral toric variety, and show that valuative, homological, and numerical equivalence…
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=$\mathbb{Z}$, and when R is a DVR, we get…
We recover the Tutte polynomial of a matroid, up to change of coordinates, from an Ehrhart-style polynomial counting lattice points in the Minkowski sum of its base polytope and scalings of simplices. Our polynomial has coefficients of…
This paper studies the properties of two kinds of matroids: (a) algebraic matroids and (b) finite and infinite matroids whose ground set have some canonical symmetry, for example row and column symmetry and transposition symmetry. For (a)…
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…
Matroids are ubiquitous in modern combinatorics. As discovered by Gelfand, Goresky, MacPherson and Serganova there is a beautiful connection between matroid theory and the geometry of Grassmannians: realizable matroids correspond to torus…
Many combinatorial and topological invariants of a hyperplane arrangement can be computed in terms of its Tutte polynomial. Similarly, many invariants of a hypertoric arrangement can be computed in terms of its arithmetic Tutte polynomial.…
By considering Tutte polynomials of Hopf algebras, we show how a Tutte polynomial can be canonically associated with combinatorial objects that have some notions of deletion and contraction. We show that several graph polynomials from the…
The Tutte polynomial is the most general invariant of matroids and graphs that can be computed recursively by deleting and contracting edges. We generalize this invariant to any class of combinatorial objects with deletion and contraction…