Using matroid duality and the critical problem, we show that certain evaluations of the Tutte polynomial of a matroid represented as a matrix over a finite field GF(q) can be interpreted as weighted sums over pairs f; g of functions defined from the ground set to GF(q) whose difference f g is the restriction of a linear functional on the column space of the matrix. Similar interpretations are given for the characteristic polynomial evaluated at q. These interpre-tations extend and elaborate interpretations for Tutte and chromatic polynomials of graphs due to Goodall and Matiyasevich
Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AMS Subject Classication: 05B35, 05C10 Abstract. Using matroid duality and the critical problem, we ...
AbstractLet G be a matrix and M(G) be the matroid defined by linear dependence on the set E of colum...
Let M be a finite matroid with rank function r. We will write AM when we mean that A is a subset of ...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do n...
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do no...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel conn...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
AMS Subject Classication: 05B35, 05C10 Abstract. Using matroid duality and the critical problem, we ...
AbstractLet G be a matrix and M(G) be the matroid defined by linear dependence on the set E of colum...
Let M be a finite matroid with rank function r. We will write AM when we mean that A is a subset of ...
AbstractFor any matroidMrealizable over Q, we give a combinatorial interpretation of the Tutte polyn...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
The multivariate Tutte polynomial (known to physicists as the Potts-model partition function) can be...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do n...
It is known that, in general, the coboundary polynomial and the Möbius polynomial of a matroid do no...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel conn...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
Arithmetic matroids arising from a list A of integral vectors in Zn are of recent interest and the a...
AbstractThe recently introduced chain and sheaf polynomials of a graph are shown to be essentially e...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...