Transforming rectangles into squares, with applications to strong colorings
From MaRDI portal
(Redirected from Publication:452059)
Abstract: It is proved that every singular cardinal admits a function that transforms rectangles into squares. Namely, for every cofinal subsets of , there exists a cofinal subset of , such that covers CxC. When combined with a recent result of Eisworth, this shows that Shelah's notion of strong coloring coincides with the classical negative partition relation .
Recommendations
Cites work
- scientific article; zbMATH DE number 3933984 (Why is no real title available?)
- scientific article; zbMATH DE number 734993 (Why is no real title available?)
- A new class of order types
- A solution to the L space problem
- Analytic colorings
- Chain conditions and products
- Club-guessing, stationary reflection, and coloring theorems
- Colouring and non-productivity of \(\aleph_ 2\)-c.c
- Getting more colors. II
- On the complete subgraphs of graphs defined by systems of sets
- Partition Problems in Topology
- Partitioning pairs of countable ordinals
- Simultaneous reflection and impossible ideals
- Strong negative partition above the continuum
- Strong negative partition relations below the continuum
- Successors of singular cardinals and coloring theorems II
- Successors of singular cardinals and coloring theorems. I
- The Ostaszewski square and homogeneous Souslin trees
- The fine structure of the constructible hierarchy
- Walks on ordinals and their characteristics
Cited in
(12)- Complicated colorings, revisited
- Knaster and friends. I: Closed colorings and precalibers
- STRONG COLORINGS OVER PARTITIONS
- Strong failures of higher analogs of Hindman's theorem
- Getting more colors I
- Strongest transformations
- Transformations of the transfinite plane
- On idealized versions of \(\mathrm{Pr}_1(\mu^+,\mu^+,\mu^+,\mathrm{cf}(\mu))\)
- Chain conditions of products, and weakly compact cardinals
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions
- How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking
- Was Ulam right? II: Small width and general ideals
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)