Partition regularity

In combinatorics, a branch of mathematics, partition regularity is one notion of largeness for a collection of sets.

Given a set X, a collection of subsets 𝕊⊂𝒫(X) is called partition regular if every set A in the collection has the property that, no matter how A is partitioned into finitely many subsets, at least one of the subsets will also belong to the collection. That is, for any A∈𝕊, and any finite partition A=C1∪C2∪⋯∪Cn, there exists an i ≤ n such that Ci belongs to 𝕊. Ramsey theory is sometimes characterized as the study of which collections 𝕊 are partition regular.

Examples

This generalizes Ramsey's theorem, as each [A]n is a barrier. (Nash-Williams, 1965)

Diophantine equations

A Diophantine equation P(𝐱)=0 is called partition regular if the collection of all infinite subsets of ℕ containing a solution is partition regular. Rado's theorem characterises exactly which systems of linear Diophantine equations 𝐀𝐱=𝟎 are partition regular. Much progress has been made recently on classifying nonlinear Diophantine equations.