Generalized activities and the tutte polynomial
โ Scribed by Gary Gordon; Lorenzo Traldi
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 621 KB
- Volume
- 85
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
The notion of activities with respect to spanning trees in graphs was introduced by W.T. Tutte, and generalized to activities with respect to bases in matroids by H. Crapo. We present a further generalization, to activities with respect to arbitrary subsets of matroids. These generalized activities provide a unified view of several different expansions of the Tutte polynomial and the chromatic polynomial.
๐ SIMILAR VOLUMES
This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence
For any matroid M realizable over Q , we give a combinatorial interpretation of the Tutte polynomial T M (x, y) which generalizes many of its known interpretations and specializations, including Tutte's coloring and flow interpretations of T M (1t, 0), T M (0, 1t); Crapo and Rota's finite field inte
Following Crapo [2], let `(x, y)(M)=x r(M) y r(M\*) , where K=Z[x, y]. Lemma 1. `(x, y) &1 =`(&x, &y).
For each pair of algebraic numbers (x, y) and each field F, the complexity of computing the Tutte polynomial T(M; x, y) of a matroid M representable over F is determined. This computation is found to be \*P-complete except when (x&1)( y&1)=1 or when |F| divides (x&1)( y&1) and (x, y) is one of the s