Comparisons of polychromatic and monochromatic Ramsey theory
From MaRDI portal
Publication:2869909
DOI10.2178/JSL.7803130zbMATH Open1345.03088arXiv1203.1126OpenAlexW2140496094MaRDI QIDQ2869909FDOQ2869909
Publication date: 7 January 2014
Published in: The Journal of Symbolic Logic (Search for Journal in Brave)
Abstract: We compare the strength of polychromatic and monochromatic Ramsey theory in several set-theoretic domains. We show that the rainbow Ramsey theorem does not follow from ZF, nor does the rainbow Ramsey theorem imply Ramsey's theorem over ZF. Extending the classical result of Erd{"o}s and Rado we show that the axiom of choice precludes the natural infinite exponent partition relations for polychromatic Ramsey theory. We introduce rainbow Ramsey ultrafilters, a polychromatic analogue of the usual Ramsey ultrafilters. We investigate the relationship of rainbow Ramsey ultrafilters with various special classes of ultrafilters, showing for example that every rainbow Ramsey ultrafilter is nowhere dense but rainbow Ramsey ultrafilters need not be rapid. This entails comparison of polychromatic and monochromatic Ramsey theory in some countable combinatorial settings. Finally we give new characterizations of the bounding and dominating numbers and the covering and uniformity numbers of the meager ideal which are in the spirit of polychromatic Ramsey theory.
Full work available at URL: https://arxiv.org/abs/1203.1126
Recommendations
Cites Work
Cited In (3)
This page was built for publication: Comparisons of polychromatic and monochromatic Ramsey theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869909)
