443
Views
1
CrossRef citations to date
0
Altmetric
Articles

Modifications of Tutte–Grothendieck invariants and Tutte polynomials

Abstract

Generalized Tutte–Grothendieck invariants are mappings from the class of matroids to a commutative ring that are characterized recursively by contraction–deletion rules. Well known examples are Tutte, chromatic, tension and flow polynomials. In general, the rule consists of three formulas valid separately for loops, isthmuses, and the ordinary elements. We show that each generalized Tutte–Grothendieck invariant thus also Tutte polynomials on matroids can be transformed so that the contraction–deletion rule for loops (isthmuses) coincides with the general case.

1 Introduction

A generalized Tutte–Grothendieck invariant (shortly a T–G invariant) Φ is a mapping from the class of finite matroids to a commutative ring (R,+,,0,1) such that Φ(M)=Φ(M) if M is isomorphic to M and there are constants α1,β1,α2,β2R such that (1) Φ(M)=1if the ground set of M is empty,Φ(M)=α1Φ(Me)if e is an isthmus of M,Φ(M)=β1Φ(Me)if e is a loop of M,Φ(M)=α2Φ(Me)+β2Φ(Me)otherwise,(1) for every matroid M and every element e of M (see [Citation1–5]). We also say that Φ is determined by the quadruple (α1,β1,α2,β2). In certain sense, all T–G invariants can be derived from the Tutte polynomial of M (2) T(M;x,y)=AE(x1)r(E)r(A)(y1)r(E)r(EA),(2) where E and r denote the ground set and rank function of M, respectively (see [Citation1]). This invariant encodes many properties of graphs and has applications in combinatorics, knot theory, statistical physics and coding theory (see cf. [Citation1,6–8]).

If e is a loop or an isthmus of M, then Me=Me. Thus the second (third) row of (1) is contained in the fourth row if α1=α2+β2 (β1=α2+β2). In this case we call Φ an isthmus-smooth (loop-smooth) T–G invariant.

We show that any T–G invariant can be transformed to an isthmus-smooth T–G invariant and to a loop-smooth T–G invariant. The transformations are studied in framework of matroid duality. Furthermore, we discuss modifications of duality and convolution formulas known for the Tutte polynomial. Notice that transformations into isthmus-smooth invariants are used by decomposition formulas of T–G invariants in [Citation3].

2 General modifications

By (2), T(M;x,y) is a sum of polynomials xr1yr2 where r1r(M), r2r(M). Hence all denominators in a polynomial T̃(M;x1,y1,x2,y2)=x2r(M)y2r(M)T(M;x1x2,y1y2) vanish. Thus all fractions in formula α2r(M)β2r(M)T(M;α1α2,β1β2) are only formal and we do not need to assume any restriction for α1,β1,α2,β2R.

Lemma 1

Let α1,β1,α2,β2 be arbitrary elements of a commutative ring (R,+,,0,1). Then α2r(M)β2r(M)T(M;α1α2,β1β2) is the unique T–G invariant determined by quadruple (α1,β1,α2,β2).

The proof of Lemma 1 is left to the reader. It suffices to use induction on |E|, (1), and that T(M;x,y) is determined by (x,y,1,1) (see cf. [Citation1]). Notice that a simpler form of Lemma 1 was proved in [Citation9] (see also [Citation1, Corollary 6.2.6]).

Theorem 1

If Φ is a T–G invariant determined by (α1,β1,α2,β2) and ξR, then Φξis(M)=(ξβ2)r(M)ξ(α1α2)r(M)Φ(M)is an isthmus-smooth T–G invariant such that for every matroid M, Φξis(M)=1if E=,Φξis(M)=(ξβ1(α1α2))Φξis(Me)if e is a loop of M,Φξis(M)=ξβ2α2Φξis(Me)+ξβ2(α1α2)Φξis(Me)otherwise.

Proof

Define by ζ1=ξβ2, ζ2=ξ(α1α2). Then Φξis(M)=ζ1r(M)ζ2r(M)Φ(M) for each matroid M. By Lemma 1, Φ(M)=α2r(M)β2r(M)T(M;α1α2,β1β2), whence Φξis(M)=(ζ1α2)r(M)(ζ2β2)r(M)T(M;ζ1α1ζ1α2,ζ2β1ζ2β2).Thus by Lemma 1, Φξis is a T–G invariant determined by (ζ1α1,ζ2β1,ζ1α2,ζ2β2). Furthermore, Φξis is isthmus-smooth because ζ1α1=ζ1α2+ζ2β2.

We call Φξis the ξ-isthmus-smooth modification of Φ. If Φ is an isthmus-smooth invariant (i.e., if α1=α2+β2), then Φξis(M)=(ξβ2)|E|Φ(M) for every matroid M.

Theorem 2

If Φ is a T–G invariant determined by (α1,β1,α2,β2) and ξR, then Φξls(M)=(ξα2)r(M)ξ(β1β2)r(M)Φ(M)is a loop-smooth T–G invariant such that for every matroid M, Φξls(M)=1if E=,Φξls(M)=(ξα1(β1β2))Φξls(Me)if e is an isthmus of M,Φξls(M)=ξα2(β1β2)Φξls(Me)+ξα2β2Φξls(Me)otherwise.

Proof

Dual form of the proof of Theorem 1.

We call Φξls the ξ-loop-smooth modification of Φ. If Φ is an isthmus invariant, then Φξls(M)=(ξα2)|E|Φ(M) for every matroid M.

If Φ is a T–G invariant determined by (α1,β1,α2,β2), then denote by Φ the T–G invariant determined by (β1,α1,β2,α2). Clearly, Φ=(Φ). By Lemma 1 and the duality formula T(M;x,y)=T(M;y,x) (see cf. [Citation1]), (3) Φ(M)=Φ(M).(3) Notice that Φξls=((Φ)ξis), whence Φξis=((((Φ))ξis))=((Φ)ξls). Thus (4) Φξls=((Φ)ξis) and Φξis=((Φ)ξls).(4)

If R contains no zero divisors, we can extend R into its quotient field and allow ξ to be any element of R (or the quotient field of R) in Theorems 1 and 2.

Theorem 1 (2) has no sense if β2=0 (α2=0) or α1=α2 (β1=β2). If β2=0 (α2=0), then Φ(M) is easy to evaluate because by (1), Φ(M)=β1r(M)α1iMα2r(M)iM (Φ(M)=α1r(M)β1lMβ2r(M)lM), where iM (lM) denotes the number of isthmuses (loops) in M. If α=α1=α20, then we can replace in Lemma 1 formal fraction α1α2 by 1 whence Φ(M)=αr(M)β2r(M)T(M;1,β1β2). Thus by (3), Φ(M)=α2r(M)βr(M)T(M;α1α2,1) if β=β1=β20. Notice that to evaluate T(M;1,y) and T(M;x,1) is in general as difficult as to evaluate T(M;x,y) (see [10–12] for more details).

3 Modifications of the Tutte polynomial

Suppose that Z[x,y] is the ring of polynomials of variables x and y with integral coefficients and let Φ(M)=T(M;x,y). Then Φ(M) is a T–G invariant determined by (x,y,1,1) (see cf. [Citation1]). Let R be a commutative ring containing Z[x,y] and let ξR. By Theorem 1, the ξ-isthmus-smooth modification of the Tutte polynomial of M is (5) Tξis(M;x,y)=ξ|E|(x1)r(M)T(M;x,y)(5) and satisfies Tξis(M;x,y)=1if E=,Tξis(M;x,y)=ξy(x1)Tξis(Me;x,y)if e is a loop of M,Tξis(M;x,y)=ξTξis(Me;x,y)+ξ(x1)Tξis(Me;x,y)otherwise.By Theorem 2, the ξ-loop-smooth modification of the Tutte polynomial of M is (6) Tξls(M;x,y)=ξ|E|(y1)r(M)T(M;x,y)(6) and satisfies Tξls(M;x,y)=1if E=,Tξls(M;x,y)=ξx(y1)Tξls(Me;x,y)if e is an isthmus,Tξls(M;x,y)=ξ(y1)Tξls(Me;x,y)+ξTξls(Me;x,y)otherwise.By (3), Tξls(M;x,y)=(Tξls)(M;x,y), and by (4), (Tξls)(M;x,y)=(T)ξis(M;x,y). By (1) and (2), T(M;x,y)=T(M;y,x), whence (T)ξis(M;x,y)=Tξis(M;y,x), i.e., we have a variant of the duality formula (7) Tξls(M;x,y)=Tξis(M;y,x).(7)

Kook, Reiner, and Stanton [Citation13] introduced the convolution formula T(M;x,y)=AET(MA;x,0)T(M|A;0,y),(where M|A and MA denote the restriction of M to A and the contraction of A from M, respectively). Suppose that ξ0. Then by (5) and (6), T(M;x,y)=AEξ|E|(1)r(MA)Tξls(MA;x,0)(1)r(M|A)Tξis(M|A;0,y).Since r(M|A)=|A|r(A), r(MA)=r(M)r(A), and 2r(A)r(M)|A| has the same parity as r(M)+|A|, we get a variant of the convolution formula (8) T(M;x,y)=ξ|E|(1)r(M)AE(1)|A|Tξls(MA;x,0)Tξis(M|A;0,y).(8)

References

  • BrylawskiT., OxleyJ., The Tutte polynomial and its applications WhiteN.Matroid Applications1992Cambridge University Press Cambridge 123–225
  • ChenB., Dual complementary polynomials of graphs and combinatorial-geometric interpretation on the values of tutte polynomial at positive integers, European J. Combin., 36 2014 206–230
  • KocholM., Splitting formulas for Tutte-Grothendieck invariants, J. Combin. Theory Ser. B, 125 2017 114–131
  • TraldiL., A dichromatic polynomial for weighted graphs and link polynomials, Proc. Amer. Math. Soc., 106 1989 279–286
  • ZaslavskyT., Strong Tutte functions of matroids and graphs, Trans. Amer. Math. Soc., 334 1992 317–347
  • BeaudinL., Ellis-MonaghanJ., PangbornG., ShrockR., A little statistical mechanics for the graph theorist, Discrete Math., 310 2010 2037–2053
  • JacksonB., SokalA.D., Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids, J. Combin. Theory Ser. B, 99 2009 869–903
  • WelshD.J.A. Complexity: Knots, Colourings and Counting London Math. Soc. Lecture Notes Series, vol. 186 1993Cambridge University Press Cambridge
  • OxleyJ.G., WelshD.J.A., The Tutte polynomial and percolation BondyJ.A., MurtyU.S.R.Graph Theory and Related Topics1979Academic Press New York 329–339
  • GoldbergL.A., JerrumM., Inapproximability of the tutte polynomial, Inform. Comput., 206 2008 908–929
  • JaegerF., VertiganD.L., WelshD.J.A., On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Cambridge Philos. Soc., 108 1990 35–53
  • VertiganD., The computational complexity of Tutte invariants for planar graphs, SIAM J. Comput., 135 2005 690–712
  • KookW., ReinerV., StantonD., A convolution formula for the Tutte polynomial, J. Combin. Theory Ser. B, 76 1999 297–300