Tutte–Grothendieck invariant

From HandWiki

In mathematics, a Tutte–Grothendieck (TG) invariant is a type of graph invariant that satisfies a generalized deletion–contraction formula. Any evaluation of the Tutte polynomial would be an example of a TG invariant.[1][2]

Definition

A graph function f is TG-invariant if:[2]

f(G)={c|V(G)|if G has no edgesxf(G/e)if e is a bridgeyf(G∖e)if e is a loopaf(G/e)+bf(G∖e)else

Above G / e denotes edge contraction whereas G \ e denotes deletion. The numbers c, x, y, a, b are parameters.

Generalization to matroids

The matroid function f is TG if:[1]

f(M1⊕M2)=f(M1)f(M2)f(M)=af(M∖e)+bf(M/e)   if e is not coloop or bridge

It can be shown that f is given by:

f(M)=a|E|−r(E)br(E)T(M;x0/b,y0/a)

where x0 is the value f takes on coloops, y0 is the value f takes on loops, E is the edge set of M; r is the rank function; and

T(M;x,y)=∑A⊂E(M)(x−1)r(E)−r(A)(y−1)|A|−r(A)

is the generalization of the Tutte polynomial to matroids.

Grothendieck group

The invariant is named after Alexander Grothendieck because of a similar construction of the Grothendieck group used in the Riemann–Roch theorem. For more details see:

References

  1. ↑ 1.0 1.1 Welsh, Dominic (1999). "The Tutte polynomial". Random Structures & Algorithms 15 (3–4): 210–228. doi:10.1002/(SICI)1098-2418(199910/12)15:3/4<210::AID-RSA2>3.0.CO;2-R. 
  2. ↑ 2.0 2.1 Goodall, Andrew (2008). "Graph polynomials and Tutte-Grothendieck invariants: an application of elementary finite Fourier analysis". arXiv:0806.4848 [math.CO].