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