Transforming rectangles into squares, with applications to strong colorings

From MaRDI portal
(Redirected from Publication:452059)




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.









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)