Stationary and Closed Rainbow subsets
Logic
2021-02-03 v1 Combinatorics
Abstract
We study the structured rainbow Ramsey theory at uncountable cardinals. When compared to the usual rainbow Ramsey theory, the variation focuses on finding a rainbow subset that not only is of a certain cardinality but also satisfies certain structural constraints, such as being stationary or closed in its supremum. In the process of dealing with cardinals greater than , we uncover some connections between versions of Chang's Conjectures and instances of rainbow Ramsey partition relations, addressing a question raised in \cite{zhang}.
Cite
@article{arxiv.2007.05935,
title = {Stationary and Closed Rainbow subsets},
author = {Shimon Garti and Jing Zhang},
journal= {arXiv preprint arXiv:2007.05935},
year = {2021}
}
Comments
20 pages