Galvin's problem in higher dimensions
Logic
2022-04-06 v1 Combinatorics
Abstract
It is proved that for each natural number , if , then there is a coloring of into colors that takes all colors on whenever is any set of reals which is homeomorphic to . This generalizes a theorem of Baumgartner and sheds further light on a problem of Galvin from the 1970s. Our result also complements and contrasts with our earlier result saying that any coloring of into finitely many colors can be reduced to at most colors on the pairs of some set of reals which is homeomorphic to when large cardinals exist.
Keywords
Cite
@article{arxiv.2204.01799,
title = {Galvin's problem in higher dimensions},
author = {Dilip Raghavan and Stevo Todorcevic},
journal= {arXiv preprint arXiv:2204.01799},
year = {2022}
}
Comments
6 pages, submitted