Archives
Keywords
transformations Coherent tree Open Access Small forcing Sierpinski's onto mapping principle Large Cardinals positive partition relation Singular Density Fodor-type reflection Reflecting stationary set Diamond for trees Erdos Cardinal Chromatic number ccc Cardinal Invariants Microscopic Approach unbounded function reflection principles Prevalent singular cardinals Singular cardinals combinatorics b-scale Ostaszewski square sap Non-saturation Was Ulam right? Subnormal ideal O-space Subtle tree property Cardinal function Constructible Universe strongly bounded groups stationary reflection ZFC construction Cohen real Uniformly homogeneous free Souslin tree diamond star xbox stick Jonsson cardinal Foundations P-Ideal Dichotomy Chang's conjecture Uniformly coherent Successor of Regular Cardinal Rainbow sets Strongly Luzin set Iterated forcing Almost Souslin regressive Souslin tree Fast club Diamond-sharp Almost countably chromatic square principles Universal Sequences polarized partition relation HOD Prikry-type forcing weak Kurepa tree countably metacompact Hereditarily Lindelöf space SNR Absoluteness Monotonically far Minimal Walks Poset Precaliber higher Baire space Countryman line Kurepa Hypothesis Martin's Axiom Luzin set nonmeager set Sigma-Prikry Rock n' Roll Entangled linear order club_AD projective Boolean algebra Forcing PFA(S)[S] square Generalized descriptive set theory stationary hitting C-sequence middle diamond 54G20 Partition relations for trees Antichain indecomposable filter incompactness Axiom R Ascent Path GMA OCA Slim tree Local Club Condensation. weak diamond Partition Relations Erdos-Hajnal graphs very good scale Filter reflection Interval topology on trees Hedetniemi's conjecture Ulam matrix coloring number Amenable C-sequence Selective Ultrafilter Respecting tree Ascending path tensor product graph Club Guessing Greatly Mahlo Singular cofinality Almost-disjoint family AIM forcing Commutative cancellative semigroups Intersection model PFA Dowker space Dushnik-Miller Sakurai's Bell inequality Analytic sets S-Space Knaster and friends Strong coloring Strongly compact cardinal Forcing with side conditions Subtle cardinal Subadditive full tree Diamond Ramsey theory over partitions specializable Souslin tree Lipschitz reduction Knaster Hindman's Theorem Fat stationary set Reduced Power Uniformization Whitehead Problem super-Souslin tree Distributive tree Commutative projection system Mandelbrot set Rado's conjecture Closed coloring Ineffable cardinal Weakly compact cardinal Souslin Tree Successor of Singular Cardinal Square-Brackets Partition Relations Nonspecial tree Well-behaved magma Postprocessing function Forcing Axioms Shelah's Strong Hypothesis Aronszajn tree free Boolean algebra L-space Parameterized proxy principle approachability ideal Vanishing levels perfectly normal Generalized Clubs weak square
Category Archives: Partition Relations
Transforming rectangles into squares, with applications to strong colorings
Abstract: It is proved that every singular cardinal $\lambda$ admits a function $\textbf{rts}:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. That is, whenever $A,B$ are cofinal subsets of $\lambda^+$, we have $\textbf{rts}[A\circledast B]\supseteq C\circledast C$, for some cofinal subset $C\subseteq\lambda^+$. As a … Continue reading
