Some remarks on uncountable rainbow Ramsey theory
Jing Zhang

TL;DR
This paper explores advanced rainbow Ramsey theorems at large cardinals, revealing new independence results, constructions, and questions about their behavior under various set-theoretic assumptions and forcings.
Contribution
It demonstrates that certain rainbow Ramsey properties do not characterize large cardinals, provides simplified models, and investigates their indestructibility under forcing.
Findings
Rainbow Ramsey properties do not characterize weak compactness.
Constructed a model where a specific rainbow partition relation fails.
Showed indestructibility of certain colorings under strongly proper forcing.
Abstract
We discuss the rainbow Ramsey theorems at limit cardinals and successors of singular cardinals, addressing some questions in \cite{MR2354904} and \cite{MR2902230}. In particular, we show for inaccessible , does not characterize weak compactness and for singular , implies for any and for any . We also provide a simplified construction of a model for originally constructed in \cite{MR2902230} and show the witnessing coloring is indestructible under strongly proper forcings but destructible under some c.c.c forcing. Finally, we conclude with some remarks and questions on possible generalizations to rainbow partition relations for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Mathematical and Theoretical Analysis
