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