Overview

  • When is the Tutte polynomial irreducible?
  • What is its Galois group over K(y)K(y)?
  • What changes when each matroid element has an independent variable?

Definition

Let MM be a finite matroid on EE, with rank function rr and positive rank d=r(E)d=r(E). Its Tutte polynomial is

TM(x,y)=βˆ‘AβŠ†E(xβˆ’1)dβˆ’r(A)(yβˆ’1)∣Aβˆ£βˆ’r(A).T_M(x,y)=\sum_{A\subseteq E}(x-1)^{d-r(A)}(y-1)^{|A|-r(A)}.

To ask for its Galois group, regard it as a degree-dd polynomial in xx over K(y)K(y). The variable yy remains transcendental. For a connected matroid, irreducibility in characteristic zero is known; it gives a transitive action, not the full group.

For a graph, connectedness here means that its cycle matroid is connected. A connected graph need not have a connected cycle matroid: the two-edge path has Tutte polynomial x2x^2.

References 2

Independent variables

With a separate variable vev_e for each element, define

Z^M(q,v)=βˆ‘AβŠ†Eqdβˆ’r(A)∏e∈Ave.\widehat Z_M(q,\mathbf v)=\sum_{A\subseteq E}q^{d-r(A)}\prod_{e\in A}v_e.

For a connected matroid of positive rank, Bohn, Cameron, and MΓΌller prove that its group over K(v)K(\mathbf v) is SdS_d, for any field KK. Identifying all the variables is a specialization; this theorem therefore does not settle the ordinary Tutte case.

References 1

Recent cases

Goodall, Jouve, and Sereni’s 2025 preprint restates the general conjecture. Their Theorem 4.5 proves it for cycle graphs. For uniform matroids Ua,bU_{a,b}, Theorem 4.7(1) proves the group SaS_a over Q(y)\mathbb Q(y) when aβ‰₯2a\ge2 is fixed and bb is sufficiently large in terms of aa. The threshold for bb depends on aa.

The paper uses specialization, ramification, permutation groups, and the large sieve. Its general conjecture remains distinct from the cases proved in the preprint.

References 1

Example

Example

TC4(x,y)=x3+x2+x+y.T_{C_4}(x,y)=x^3+x^2+x+y.

It is irreducible over Q(y)\mathbb Q(y): a factorization in Q[x,y]\mathbb Q[x,y] would have one factor independent of yy, and that factor would divide the coefficient 11 of yy. Its discriminant is βˆ’27y2+14yβˆ’3-27y^2+14y-3, which has two distinct zeros and is not a square in Q(y)\mathbb Q(y). The group is therefore S3S_3.

At y=0y=0, the polynomial becomes x(x2+x+1)x(x^2+x+1), with group C2C_2. This example shows the change a specialization can cause.

References 2

Embedded graphs

For a graph cellularly embedded in an orientable surface, put Οƒ(A)=r(A)+Ξ³(A)/2\sigma(A)=r(A)+\gamma(A)/2, where Ξ³(A)\gamma(A) is the Euler genus of the spanning ribbon subgraph. Its ribbon graph polynomial is

RG(x,y)=βˆ‘AβŠ†E(xβˆ’1)Οƒ(E)βˆ’Οƒ(A)(yβˆ’1)∣Aβˆ£βˆ’Οƒ(A).R_G(x,y)=\sum_{A\subseteq E}(x-1)^{\sigma(E)-\sigma(A)}(y-1)^{|A|-\sigma(A)}.

For a graph with an edge and no isolated vertices, Ellis-Monaghan and collaborators prove that RGR_G is irreducible over C\mathbb C precisely when the embedded graph is connected and is not a nontrivial join. A join identifies one vertex of each of two embedded graphs in separate surface pieces. Their more general theorem treats connected even delta-matroids. This is an irreducibility result; it does not determine the full Galois group.

References 1

Questions

OpenPolynomial families

Does every connected matroid have a Tutte polynomial with full symmetric group?

Scope. Finite connected matroids M of positive rank d; Galois group of T_M(x,y) as a polynomial in x over K(y), with char(K)=0.

The proposed group is SdS_d. The multivariate version is proved; the ordinary bivariate version remains conjectural in the cited 2025 preprint beyond its established families.

References 2
Discuss this question β†’

Related topics

References

  1. Irreducibility of the Tutte polynomial of a connected matroid

    Merino, Criel and de Mier, Anna and Noy, Marc. Journal of Combinatorial Theory, Series B, 83(2), 298–304, 2001.

    Read the source
  2. Galois groups of multivariate Tutte polynomials

    Bohn, Adam and Cameron, Peter J. and MΓΌller, Peter. Journal of Algebraic Combinatorics, 36, 223–230, 2012.

    Read the source
  3. On the irreducibility and monodromy of Tutte polynomials

    Goodall, Andrew and Jouve, Florent and Sereni, Jean-SΓ©bastien. arXiv:2510.05658v1, 2025.

    Read the source
  4. Galois Theory

    Cox, David A. Edition 2. John Wiley & Sons, 2012.

    Read the source
  5. Irreducibility of the Tutte polynomial of an embedded graph

    Ellis-Monaghan, Joanna A. and Goodall, Andrew J. and Moffatt, Iain and Noble, Steven D. and Vena, LluΓ­s. Algebraic Combinatorics, 5(6), 1337–1351, 2022.

    Read the source