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