Archives
Keywords
Iterated forcing indecomposable ultrafilter Aronszajn tree higher Baire space free Souslin tree stationary reflection Uniformly homogeneous O-space Cohen real reflection principles transformations Subnormal ideal Almost countably chromatic Almost Souslin Erdos-Hajnal graphs Square-Brackets Partition Relations Postprocessing function Ascent Path Diamond Luzin set Subadditive Ramsey theory over partitions Precaliber Erdos Cardinal Whitehead Problem Rock n' Roll Diamond for trees Cardinal Invariants AIM forcing Uniformly coherent Closed coloring unbounded function Analytic sets Universal Sequences regressive Souslin tree Uniformization Fast club Successor of Singular Cardinal Constructible Universe P-Ideal Dichotomy Cardinal function Singular cardinals combinatorics incompactness Ineffable cardinal Successor of Regular Cardinal b-scale C-sequence Generalized Clubs OCA Prevalent singular cardinals specializable Souslin tree Diamond-sharp Reduced Power strongly bounded groups Reflecting stationary set Foundations free Boolean algebra Martin's Axiom Vanishing levels Ostaszewski square S-Space Forcing Axioms super-Souslin tree Small forcing square principles Greatly Mahlo Hindman's Theorem Chromatic number Was Ulam right L-space coloring number Souslin Tree tensor product graph HOD Forcing ZFC construction approachability ideal Fat stationary set Commutative cancellative semigroups Selective Ultrafilter Lipschitz reduction Distributive tree Sierpinski's onto mapping principle Hedetniemi's conjecture Open Access Rado's conjecture Kurepa Hypothesis Antichain square club_AD PFA Subtle cardinal Knaster and friends stick Hereditarily Lindelöf space Partition Relations Shelah's Strong Hypothesis Dushnik-Miller full tree ccc 54G20 Amenable C-sequence Slim tree Ulam matrix Strongly Luzin set Singular Density Dowker space Singular cofinality Generalized descriptive set theory very good scale middle diamond Absoluteness Sakurai's Bell inequality Well-behaved magma Mandelbrot set GMA Club Guessing countably metacompact Axiom R Strong coloring Fodor-type reflection positive partition relation Coherent tree Almost-disjoint family Sigma-Prikry Filter reflection Minimal Walks PFA(S)[S] sap Poset Non-saturation Chang's conjecture weak diamond Microscopic Approach Weakly compact cardinal Large Cardinals SNR nonmeager set polarized partition relation Prikry-type forcing diamond star Jonsson cardinal Rainbow sets Nonspecial tree stationary hitting Knaster weak square Subtle tree property projective Boolean algebra Local Club Condensation. xbox Parameterized proxy principle
Tag Archives: Rainbow sets
Prolific Souslin trees
In a paper from 1971, Erdos and Hajnal asked whether (assuming CH) every coloring witnessing $\aleph_1\nrightarrow[\aleph_1]^2_3$ has a rainbow triangle. The negative solution was given in a 1975 paper by Shelah, and the proof and relevant definitions may be found … Continue reading
Posted in Blog, Expository
Tagged Rainbow sets, Souslin Tree, Square-Brackets Partition Relations
Leave a comment
Polychromatic colorings
These are lectures notes of two talks Dani Livne gave in our Infinite Combinatorics seminar. I did not take notes in real-time, hence, all possible mistakes here are due to myself. Recall that a function $f:A\rightarrow B$ is said to … Continue reading
Comparing rectangles with squares through rainbow sets
In Todorcevic’s class last week, he proved all the results of Chapter 8 from his Walks on Ordinals book, up to (and including) Theorem 8.1.11. The upshots are as follows: Every regular infinite cardinal $\theta$ admits a naturally defined function … Continue reading