Open Problems in Partition Regularity

Source 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 . Many of the classical theorems of Ramsey Theory 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. Our aim in this paper is to present some of the natural and appealing open problems in the area.