Partition Regularity in the Naturals and the Rationals

20 May 2014
14:30
Abstract
A system of linear equations is called partition regular if, whenever the naturals are finitely coloured, there is a monochromatic solution of the equations. Many of the classical theorems of Ramsey Theory may be phrased as assertions that certain systems are partition regular. What happens if we are colouring not the naturals but the (non-zero) integers, rationals, or reals instead? After some background, we will give various recent results.
  • Combinatorial Theory Seminar