International audienceF. Jaeger has shown that up to a $\pm$ sign the evaluation at $(j,j^2)$ of the Tutte polynomial of a ternary matroid can be expressed in terms of the dimension of the bicycle space of a representation over $GF(3)$. We give a short algebraic proof of this result, which moreover yields the exact value of $\pm$, a problem left open in Jaeger's paper. It follows that the computation of $t(j,j^2)$ is of polynomial complexity for a ternary matroid
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a gra...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
Vertigan has shown that if $M$ is a binary matroid, then $|T_M(-\iota,\iota)|$, the modulus of the T...
AbstractFor each pair of algebraic numbers (x,y) and each fieldF, the complexity of computing the Tu...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
We show that computing the Tutte polynomial of a linear matroid of dimension k on kO(1) points over ...
AbstractIt follows from a fundamental (1958) result of Tutte that a binary matroid is representable ...
AbstractIn this paper we prove a stronger version of a result of Ralph Reid characterizing the terna...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
We consider a specialization YM (q; t) of the Tutte polynomial of a matroid M which is inspired by a...
AbstractGiven a matroid M and its Tutte polynomial TM(x,y), TM(0,1) is an invariant of M with variou...
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a gra...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...
Vertigan has shown that if $M$ is a binary matroid, then $|T_M(-\iota,\iota)|$, the modulus of the T...
AbstractFor each pair of algebraic numbers (x,y) and each fieldF, the complexity of computing the Tu...
Let M be a matroid representable over GF(q), and let t(M, x, y) denote its Tutte polynomial. We pres...
This chapter examines the complexity of evaluating graph polynomials, related to the Tutte polynomia...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
We show that computing the Tutte polynomial of a linear matroid of dimension k on kO(1) points over ...
AbstractIt follows from a fundamental (1958) result of Tutte that a binary matroid is representable ...
AbstractIn this paper we prove a stronger version of a result of Ralph Reid characterizing the terna...
AbstractThe main results of the paper unify and generalize several theorems of the literature on Tut...
The Tutte polynomial of a graph or a matroid, named after W. T. Tutte, has the important universal p...
We consider a specialization YM (q; t) of the Tutte polynomial of a matroid M which is inspired by a...
AbstractGiven a matroid M and its Tutte polynomial TM(x,y), TM(0,1) is an invariant of M with variou...
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a gra...
Let M be a matroid and let t(M; ξ, η) be the Tutte polynomial of M. The lower and upper bound of t(M...
Matroids are combinatorial objects that capture abstractly the essence of dependence. The Tutte poly...