Related papers: Tutte polynomials for regular oriented matroids

We introduce and study filtrations of a matroid on a linearly ordered ground set, which are particular sequences of nested sets. A given basis can be decomposed into a uniquely defined sequence of bases of minors, such that these bases have…

The Tutte polynomial is a crucial invariant of matroids. The polymatroid Tutte polynomial $\mathscr{T}_{P}(x,y)$, introduced by Bernardi et al., is an extension of the classical Tutte polynomial from matroids to polymatroids $P$. In this…

Fix two lattice paths P and Q from (0,0) to (m,r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m,r) and that remain in the region bounded by P and Q can be identified with…

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…

It is well-known that the Jones polynomial of an alternating knot is closely related to the Tutte polynomial of a special graph obtained from a regular projection of the knot. Relying on the results of Bollob\'as and Riordan, we introduce a…

An alternating dimap is an orientably embedded Eulerian directed graph where the edges incident with each vertex are directed inwards and outwards alternately. Three reduction operations for alternating dimaps were investigated by Farr. A…

In this note we introduce a family of polynomials on a matroid derived from chain Tutte polynomials which generalize the classic and ubiquitous characteristic polynomial. We show that the coefficients of these polynomials alternate and…

Given a 4-regular graph $F$, we introduce a binary matroid $M_{\tau}(F)$ on the set of transitions of $F$. Parametrized versions of the Tutte polynomial of $M_{\tau}(F)$ yield several well-known graph and knot polynomials, including the…

We introduce the notion of an arithmetic matroid, whose main example is given by a list of elements of a finitely generated abelian group. In particular we study the representability of its dual, providing an extension of the Gale duality…

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly…

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

The Tutte polynomial and Derksen's $\mathcal{G}$-invariant are the universal deletion-contraction and valuative matroid and polymatroid invariants, respectively. There are only a handful of well known invariants (like the matroid…

In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.

Motivated by the $Z$-polynomials of matroids, Ferroni, Matherne, Stevens, and Vecchi introduced the inverse $Z$-polynomial of a matroid. In this paper, we prove several fundamental properties of the inverse $Z$-polynomial, including…

A common generalization for the chromatic polynomial and the flow polynomial of a graph $G$ is the Tutte polynomial $T(G;x,y)$. The combinatorial meaning for the coefficients of $T$ was discovered by Tutte at the beginning of its…

Using a quantum field theory renormalization group-like differential equation, we give a new proof of the recipe theorem for the Tutte polynomial for matroids. The solution of such an equation is in fact given by some appropriate characters…

In the present paper, we introduce the concept of harmonic Tutte polynomials of matroids and discuss some of their properties. In particular, we generalize Greene's theorem, thereby expressing harmonic weight enumerators of codes as…

A graph $G$ is said to be $p$-periodic, if the automorphism group $Aut(G)$ contains an element of order $p$ which preserves no edges. In this paper, we investigate the behavior of graph polynomials (Negmai and Tutte) with respect to graph…

We relate matroid connectivity to Tutte-connectivity in an infinite graph. Moreover, we show that the two cycle matroids, the finite-cycle matroid and the cycle matroid, in which also infinite cycles are taken into account, have the same…

Unlike Whitney's definition of the corank-nullity generating function $T(G;x+1,y+1)$, Tutte's definition of his now eponymous polynomial $T(G;x,y)$ requires a total order on the edges of which the polynomial is a posteriori independent.…