ArticleslgStudy

science

Rota's conjecture

Rota's conjecture is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Rota's conjecture rather than just read about it. In short: Rota's excluded minors conjecture is one of a number of conjectures made by the mathematician Gian-Carlo Rota. Some members of the structural combinatorics community consider it an important problem.

Key takeaways

  • Rota's conjecture belongs to science; place it in that map before memorising details.
  • Learn the definition first, then one example that makes the definition concrete.
  • Connect Rota's conjecture to a quantity you can measure, compute or draw — that is where exam questions come from.
  • Reproduce the core statement of Rota's conjecture from memory before moving on to harder problems.

Reference excerpt

Rota's excluded minors conjecture is one of a number of conjectures made by the mathematician Gian-Carlo Rota. Some members of the structural combinatorics community consider it an important problem. 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. A proof of the conjecture was announced, but not published, in 2014 by Geelen, Gerards, and Whittle.

Statement of the conjecture If S {\displaystyle S} is a set of points in a vector space defined over a field F {\displaystyle F} , then the linearly independent subsets of S {\displaystyle S} form the independent sets of a matroid M {\displaystyle M} ; S {\displaystyle S} is said to be a representation of any matroid isomorphic to M {\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 S {\displaystyle S} ; contraction is a dual operation in which a point is removed and the remaining points are projected onto a hyperplane that does not contain the removed point. It follows from this that if a matroid is representable over a field, then so are all its minors. A matroid that is not representable over F {\displaystyle F} , and is minor-minimal with that property, is called an "excluded minor"; a matroid M {\displaystyle M} is representable over F {\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. Rota's conjecture is that, for every finite field F {\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 U

4 2 {\displaystyle U{}_{4}^{2}} (geometrically, a line with four points on it). 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 U

5 2 {\displaystyle U{}_{5}^{2}} , its dual matroid U

5 3 {\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. 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. There are seven forbidden minors for the matroids representable over GF(4). They are:

The six-point line U

6 2 {\displaystyle U{}_{6}^{2}} . The dual U

6 4 {\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 n / 2 {\displaystyle n/2} two-point lines. 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. For GF(5), several forbidden minors on up to 12 elements are known, 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. It would take them years to write up their research in its entirety and publish it. An outline of the proof appeared 2014 in the Notices of the American Mathematical Society. Only one paper by the same authors, related to this conjecture, has subsequently appeared.

References

Worked examples

Example 1 — a first encounter with Rota's conjecture

Start with the simplest possible case. Write down what Rota's conjecture claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Rota's conjecture before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Rota's conjecture ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Rota's conjecture

In research
Rota's conjecture appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry
Engineering practice reuses Rota's conjecture in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom
Rota's conjecture is common in secondary-school and first-year university syllabi. It links to neighbouring topics Conjectures, Matroid theory, so understanding it makes those chapters shorter.
In everyday life
Look for Rota's conjecture outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Rota's conjecture” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Rota's conjecture in 20 minutes

  1. Read the reference excerpt below once, without taking notes.
  2. Close the page and write down what Rota's conjecture means in your own words.
  3. Compare your version with the excerpt and mark what you missed.
  4. Work through the three examples above with pen and paper.
  5. Explain Rota's conjecture out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Rota's conjecture in simple terms?

Rota's excluded minors conjecture is one of a number of conjectures made by the mathematician Gian-Carlo Rota. Some members of the structural combinatorics community consider it an important problem.

Why does Rota's conjecture matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Rota's conjecture?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Rota's conjecture.

Tags

  • Conjectures
  • Matroid theory

Keep exploring