Partition regular equations

Abstract

Abstract A finite or infinite matrix A with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector x with Ax = 0. Many of the classical theorems of Ramsey theory, such as van der Waerden's theorem or Schur's theorem, may naturally be interpreted as assertions that particular matrices are partition regular. While in the finite case partition regularity is well understood, very little is known in the infinite case. In this survey paper we will review some finite results and then proceed to discuss some features of the infinite case. Introduction Let A be an m × n matrix with rational entries. We say that A is partition regular if for every finite colouring of the natural numbers ℕ = {1, 2,…} there is a monochromatic vector x ∈ ℕ n with Ax = 0. In other words, A is partition regular if for every positive integer k , and every function c : ℕ → {1,…, k }, there is a vector x = ( x 1 ,…, x n ) ∈ ℕ n with c ( x 1 ) = … = c(x n ) such that Ax = 0. We may also speak of the ‘system of equations Ax = 0’ being partition regular. Many of the classical results of Ramsey theory may naturally be considered as statements about partition regularity. For example, Schur's theorem [11], that in any finite colouring of the natural numbers we may solve x + y = z in one colour class, is precisely the assertion that the 1×3 matrix (1,1, −1) is partition regular.