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