Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T05:46:13.964Z Has data issue: false hasContentIssue false

Countable partitions of product spaces

Published online by Cambridge University Press:  26 February 2010

Gadi Moran
Affiliation:
Department of Mathematics, University of Haifa, Haifa, Israel
Dona Strauss
Affiliation:
Department of Pure Mathematics, University of Hull, Hull, North Humberside, England.
Get access

Extract

Problems about partitions of cartesian products are common in mathematics. For example, in finite and infinite combinatorics, they keep emerging in Ramsay theory, where one seeks to show that, if a product is partitioned into finitely many parts, one part at least must contain a subset of a certain specified kind. In the transition from finite to infinite products, one usually imposes restrictions of a topological nature on the partition, in order to obtain theorems analogous to those which are valid in the finite case. (See, e.g., [G-P], [Si], [E].)

Information

Type
Research Article
Copyright
Copyright © University College London 1980

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