Transforming rectangles into squares, with applications to strong colorings

DOI10.1016/j.aim.2012.06.013zbMath1270.03069arXiv1103.2838OpenAlexW2039220583MaRDI QIDQ452059

Assaf Rinot

Publication date: 19 September 2012

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

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

zbMATH Keywords

partition relationsminimal walksoff-center club guessingsquare-bracket operationsuccessor of singular cardinal

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Partition relations (03E02)

Related Items

Knaster and friends. I: Closed colorings and precalibers, Was Ulam right? II: Small width and general ideals, Complicated colorings, revisited, Strong failures of higher analogs of Hindman’s theorem, On idealized versions of \(\mathrm{Pr}_1(\mu^+,\mu^+,\mu^+,\mathrm{cf}(\mu))\), CHAIN CONDITIONS OF PRODUCTS, AND WEAKLY COMPACT CARDINALS, Transformations of the transfinite plane, STRONG COLORINGS OVER PARTITIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Club-guessing, stationary reflection, and coloring theorems
• Colouring and non-productivity of \(\aleph_ 2\)-c.c
• Partitioning pairs of countable ordinals
• Strong negative partition relations below the continuum
• Analytic colorings
• The Ostaszewski square and homogeneous Souslin trees
• Walks on ordinals and their characteristics
• Successors of singular cardinals and coloring theorems. I
• Strong negative partition above the continuum
• Successors of singular cardinals and coloring theorems II
• Partition Problems in Topology
• A new class of order types
• Chain conditions and products
• Simultaneous reflection and impossible ideals
• Getting more colors II
• A solution to the L space problem
• On the complete subgraphs of graphs defined by systems of sets
• The fine structure of the constructible hierarchy