Hostname: page-component-77c78cf97d-5vn5w Total loading time: 0 Render date: 2026-04-23T09:45:40.276Z Has data issue: false hasContentIssue false

Image Partition Regularity of Matrices

Published online by Cambridge University Press:  12 September 2008

Neil Hindman
Affiliation:
Department of Mathematics, Howard University, Washington, D.C. 20059, U.S.A.
Imre Leader
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Cambridge University, England

Abstract

Many of the classical results of Ramsey Theory, including those of Hilbert, Schur, and van der Waerden, are naturally stated as instances of the following problem: given a u × ν matrix A with rational entries, is it true, that whenever the set ℕ of positive integers is finitely coloured, there must exist some x∈ℕν such that all entries of Ax are the same colour? While the theorems cited are all consequences of Rado's theorem, the general problem had remained open. We provide here several solutions for the alternate problem, which asks that x∈ℕν. Based on this, we solve the general problem, giving various equivalent characterizations.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable