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