๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


The Tutte polynomial
โœ Dominic Welsh ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

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

An Interpretation for the Tutte Polynomi
โœ V Reiner ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

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

A Convolution Formula for the Tutte Poly
โœ W. Kook; V. Reiner; D. Stanton ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 75 KB

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).

Bicycle Dimension and Special Points of
โœ Dirk Vertigan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 308 KB

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