Archives
Keywords
Selective Ultrafilter indecomposable ultrafilter Whitehead Problem projective Boolean algebra full tree Rado's conjecture Dushnik-Miller Closed coloring Foundations Lipschitz reduction Chang's conjecture Almost Souslin Nonspecial tree Postprocessing function weak diamond Club Guessing Large Cardinals Analytic sets Ineffable cardinal Ulam matrix Constructible Universe 54G20 Reflecting stationary set Commutative cancellative semigroups Iterated forcing Diamond Successor of Regular Cardinal Uniformly coherent Chromatic number ZFC construction P-Ideal Dichotomy Sigma-Prikry Diamond-sharp square principles Shelah's Strong Hypothesis Singular cardinals combinatorics Generalized descriptive set theory weak Kurepa tree Coherent tree sap Greatly Mahlo square Parameterized proxy principle Local Club Condensation. unbounded function Slim tree Singular Density Forcing Axioms Precaliber OCA Ascent Path C-sequence incompactness Distributive tree O-space Luzin set free Boolean algebra approachability ideal Martin's Axiom Aronszajn tree Open Access Vanishing levels strongly bounded groups weak square Microscopic Approach coloring number Knaster Fast club Almost-disjoint family Uniformly homogeneous Generalized Clubs Subadditive Reduced Power Hindman's Theorem PFA(S)[S] stationary reflection Subnormal ideal Cardinal function Non-saturation Weakly compact cardinal HOD Forcing stick Filter reflection Jonsson cardinal Mandelbrot set Partition Relations reflection principles Successor of Singular Cardinal stationary hitting PFA Small forcing higher Baire space Ostaszewski square Fat stationary set Diamond for trees Fodor-type reflection Poset Kurepa Hypothesis Rock n' Roll Strong coloring countably metacompact transformations Hedetniemi's conjecture Subtle cardinal L-space Uniformization Sakurai's Bell inequality middle diamond positive partition relation Universal Sequences AIM forcing Knaster and friends regressive Souslin tree Minimal Walks Amenable C-sequence Well-behaved magma S-Space super-Souslin tree Antichain club_AD Cohen real very good scale polarized partition relation Strongly Luzin set Axiom R Erdos-Hajnal graphs Cardinal Invariants Dowker space Prikry-type forcing diamond star tensor product graph ccc Rainbow sets SNR Square-Brackets Partition Relations specializable Souslin tree Souslin Tree Almost countably chromatic GMA Erdos Cardinal nonmeager set Sierpinski's onto mapping principle Ramsey theory over partitions Singular cofinality Absoluteness free Souslin tree Subtle tree property Prevalent singular cardinals b-scale Hereditarily Lindelöf space Was Ulam right xbox
Tag Archives: Sierpinski’s onto mapping principle
Was Ulam right? I: Basic theory and subnormal ideals
Joint work with Tanmay Inamdar. Abstract. We introduce various coloring principles which generalize the so-called onto mapping principle of Sierpinski to larger cardinals and general ideals. We prove that these principles capture the notion of an Ulam matrix and allow … Continue reading
Ramsey theory over partitions III: Strongly Luzin sets and partition relations
Joint work with Menachem Kojman and Juris Steprāns. Abstract. The strongest type of coloring of pairs of countable ordinals, gotten by Todorcevic from a strongly Luzin set, is shown to be equivalent to the existence of a nonmeager set of … Continue reading
Jones’ theorem on the cardinal invariant $\mathfrak p$
This post continues the study of the cardinal invariant $\mathfrak p$. We refer the reader to a previous post for all the needed background. For ordinals $\alpha,\alpha_0,\alpha_1,\beta,\beta_0,\beta_1$, the polarized partition relation $$\left(\begin{array}{c}\alpha\\\beta\end{array}\right)\rightarrow\left(\begin{array}{cc}\alpha_0&\alpha_1\\\beta_0&\beta_1\end{array}\right)$$ asserts that for every coloring $f:\alpha\times\beta\rightarrow 2$, (at least) … Continue reading
Posted in Blog, Expository
Tagged polarized partition relation, Sierpinski's onto mapping principle
Leave a comment