Rota's excluded minors conjecture is one of a number of conjectures made by the mathematician Gian-Carlo Rota. It is considered an important problem by some members of the structural combinatorics community. Rota conjectured in 1971 that, for every finite field, the family of matroids that can be represented over that field has only finitely many excluded minors.^[1] A proof of the conjecture has been announced by Geelen, Gerards, and Whittle.^[2]

Statement of the conjecture

If ${\displaystyle S}$ is a set of points in a vector space defined over a field ${\displaystyle F}$, then the linearly independent subsets of ${\displaystyle S}$ form the independent sets of a matroid ${\displaystyle M}$; ${\displaystyle S}$ is said to be a representation of any matroid isomorphic to ${\displaystyle M}$. Not every matroid has a representation over every field, for instance, the Fano plane is representable only over fields of characteristic two. Other matroids are representable over no fields at all. The matroids that are representable over a particular field form a proper subclass of all matroids.

A minor of a matroid is another matroid formed by a sequence of two operations: deletion and contraction. In the case of points from a vector space, deleting a point is simply the removal of that point from ${\displaystyle S}$; contraction is a dual operation in which a point is removed and the remaining points are projected a hyperplane that does not contain the removed points. It follows from this if a matroid is representable over a field, then so are all its minors. A matroid that is not representable over ${\displaystyle F}$, and is minor-minimal with that property, is called an "excluded minor"; a matroid ${\displaystyle M}$ is representable over ${\displaystyle F}$ if and only if it does not contain one of the forbidden minors.

For representability over the real numbers, there are infinitely many forbidden minors.^[3] Rota's conjecture is that, for every finite field ${\displaystyle F}$, there is only a finite number of forbidden minors.

Partial results

W. T. Tutte proved that the binary matroids (matroids representable over the field of two elements) have a single forbidden minor, the uniform matroid ${\displaystyle U{}_{4}^{2}}$ (geometrically, a line with four points on it).^[4][5]

A matroid is representable over the ternary field GF(3) if and only if it does not have one or more of the following four matroids as minors: a five-point line ${\displaystyle U{}_{5}^{2}}$, its dual matroid ${\displaystyle U{}_{5}^{3}}$ (five points in general position in three dimensions), the Fano plane, or the dual of the Fano plane. Thus, Rota's conjecture is true in this case as well.^[6][7] As a consequence of this result and of the forbidden minor characterization by Tutte (1958) of the regular matroids (matroids that can be represented over all fields) it follows that a matroid is regular if and only if it is both binary and ternary.^[7]

There are seven forbidden minors for the matroids representable over GF(4).^[8] They are:

• The six-point line ${\displaystyle U{}_{6}^{2}}$.
• The dual ${\displaystyle U{}_{6}^{4}}$ to the six-point line, six points in general position in four dimensions.
• A self-dual six-point rank-three matroid with a single three-point line.
• The non-Fano matroid formed by the seven points at the vertices, edge midpoints, and centroid of an equilateral triangle in the Euclidean plane. This configuration is one of two known sets of planar points with fewer than ${\displaystyle n/2}$ two-point lines.^[9]
• The dual of the non-Fano matroid.
• The eight-point matroid of a square antiprism.
• The matroid obtained by relaxing the unique pair of disjoint circuit-hyperplanes of the square antiprism.

This result won the 2003 Fulkerson Prize for its authors Jim Geelen, A. M. H. Gerards, and A. Kapoor.^[10]

For GF(5), several forbidden minors on up to 12 elements are known,^[11] but it is not known whether the list is complete.

Reported proof

Geoff Whittle announced during a 2013 visit to the UK that he, Jim Geelen, and Bert Gerards had solved Rota's Conjecture. The collaboration involved intense visits where the researchers sat in a room together, all day every day, in front of a whiteboard.^[12] It would take them years to write up their research in its entirety and publish it.^[13][14] An outline of the proof appeared 2014 in the Notices of the American Mathematical Society.^[15] Only one paper by the same authors, related to this conjecture, has subsequently appeared.^[16]

See also

• Rota's basis conjecture, a different conjecture by Rota about linear algebra and matroids

References