Overview
- When is the Tutte polynomial irreducible?
- What is its Galois group over ?
- What changes when each matroid element has an independent variable?
Definition
Let be a finite matroid on , with rank function and positive rank . Its Tutte polynomial is
To ask for its Galois group, regard it as a degree- polynomial in over . The variable 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 .
References 2
- MerinoDeMierNoy2001 Β· Main theoremSource
- BohnCameronMuller2012Tutte Β· Introduction and Conjecture 9Source
Independent variables
With a separate variable for each element, define
For a connected matroid of positive rank, Bohn, Cameron, and MΓΌller prove that its group over is , for any field . Identifying all the variables is a specialization; this theorem therefore does not settle the ordinary Tutte case.
References 1
- BohnCameronMuller2012Tutte Β· Theorem 1 and Conjecture 9Source
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 , Theorem 4.7(1) proves the group over when is fixed and is sufficiently large in terms of . The threshold for depends on .
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
- GoodallJouveSereni2025Tutte Β· Conjecture 1.1; Theorems 4.5 and 4.7(1); Remark 5Source
Example
Example
It is irreducible over : a factorization in would have one factor independent of , and that factor would divide the coefficient of . Its discriminant is , which has two distinct zeros and is not a square in . The group is therefore .
At , the polynomial becomes , with group . This example shows the change a specialization can cause.
References 2
- GoodallJouveSereni2025Tutte Β· Β§4.2The cycle formula; the cubic calculation is given directly.Source
- Cox2012The discriminant criterion for an irreducible cubic.Source
Embedded graphs
For a graph cellularly embedded in an orientable surface, put , where is the Euler genus of the spanning ribbon subgraph. Its ribbon graph polynomial is
For a graph with an edge and no isolated vertices, Ellis-Monaghan and collaborators prove that is irreducible over 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
- EllisMonaghanEtAl2022EmbeddedTutte Β· Equation (2), Theorems 1.1β1.2; definition of join preceding Theorem 1.1Source
Questions
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 . The multivariate version is proved; the ordinary bivariate version remains conjectural in the cited 2025 preprint beyond its established families.
References 2
- BohnCameronMuller2012Tutte Β· Conjecture 9Source
- GoodallJouveSereni2025Tutte Β· Conjecture 1.1 and Β§4Source
Related topics
Chromatic polynomials
A fixed Tutte specialization gives the chromatic polynomial up to a power and a sign.
UsesCritical points and polynomial monodromy
The group is the monodromy of projection to the y-line.
UsesSpecialization and Hilbert irreducibility
A well-chosen specialization can prove a lower bound for the generic group.
Linked from 1 articles
References
- 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 - 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 - 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 - Galois Theory
Cox, David A. Edition 2. John Wiley & Sons, 2012.
Read the source - 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
Comments
Any comments are welcome. Comments appear after the site owner approves them. Privacy policy.