Transforming rectangles into squares, with applications to strong colorings

From MaRDI portal
Publication:452059

DOI10.1016/J.AIM.2012.06.013zbMATH Open1270.03069arXiv1103.2838OpenAlexW2039220583MaRDI QIDQ452059FDOQ452059


Authors: Assaf Rinot Edit this on Wikidata


Publication date: 19 September 2012

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: It is proved that every singular cardinal lambda admits a function RTS:[lambda+]2ightarrow[lambda+]2 that transforms rectangles into squares. Namely, for every cofinal subsets A,B of lambda+, there exists a cofinal subset C of lambda+, such that RTS[AxB] covers CxC. When combined with a recent result of Eisworth, this shows that Shelah's notion of strong coloring Pr1(lambda+,lambda+,lambda+,cf(lambda)) coincides with the classical negative partition relation lambda+otightarrow[lambda+]lambda+2.


Full work available at URL: https://arxiv.org/abs/1103.2838




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Transforming rectangles into squares, with applications to strong colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452059)