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}.
Recommendations
Cites work
- scientific article; zbMATH DE number 3829893 (Why is no real title available?)
- scientific article; zbMATH DE number 3829896 (Why is no real title available?)
- scientific article; zbMATH DE number 734993 (Why is no real title available?)
- Aronszajn trees and the independence of the transfer property
- Chang's conjecture for _
- Comparisons of polychromatic and monochromatic Ramsey theory
- Forcing Positive Partition Relations
- Iterated forcing and elementary embeddings
- Magidor-Malitz reflection
- More results in polychromatic Ramsey theory
- Rainbow Ramsey simple structures
- Reflecting stationary sets
- Saturated ideals
- Some remarks on uncountable rainbow Ramsey theory
- Some results in polychromatic Ramsey theory
- Successors of singular cardinals
- The proper forcing axiom and stationary set reflection
- The topological Baumgartner-Hajnal theorem
This page was built for publication: Stationary and closed rainbow subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2216031)