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