We study an operation in matroid theory that allows one to transition a given matroid into
another with more bases via relaxing a stressed subset. This framework provides a new …

We define and study category $\mathcal O $ for a symplectic resolution, generalizing the
classical BGG category $\mathcal O $, which is associated with the Springer resolution. This …

In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of
closely related graph polynomials such as the chromatic, flow, reliability, and shelling …

We introduce a presentation of the Chow ring of a matroid by a new set of generators, called
“simplicial generators.” These generators are analogous to nef divisors on projective toric …

The deletion–contraction algorithm is perhapsthe most popular method for computing a host
of fundamental graph invariants such as the chromatic, flow, and reliability polynomials in …

The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the
Tutte polynomial from graphs to hypergraphs, and more generally from matroids to …

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 …

For a list of elements in a finitely generated abelian group and an abelian group, we
introduce and study an associated-Tutte polynomial, defined by counting the number of …

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a
method for computing the Tutte polynomial by solving a related enumerative problem. As a …

This work discusses the extraction of meaningful invariants of combinatorial objects from
coalgebra or bialgebra structures. The Tutte polynomial is an invariant of graphs well known …