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