Archives
Keywords
Rainbow sets Ostaszewski square Knaster Hindman's Theorem Whitehead Problem Forcing Axioms Slim tree Postprocessing function Generalized Clubs projective Boolean algebra Chromatic number SNR Constructible Universe Foundations Square-Brackets Partition Relations Cardinal Invariants O-space free Souslin tree countably metacompact specializable Souslin tree Strongly Luzin set Fat stationary set Was Ulam right Successor of Singular Cardinal Universal Sequences Jonsson cardinal Almost Souslin stationary reflection Reflecting stationary set incompactness Diamond ccc Antichain C-sequence Weakly compact cardinal diamond star Filter reflection Forcing Microscopic Approach S-Space Martin's Axiom weak diamond Mandelbrot set Almost-disjoint family Prikry-type forcing Greatly Mahlo reflection principles Ascent Path xbox sap Axiom R Local Club Condensation. Amenable C-sequence Small forcing Parameterized proxy principle coloring number square principles square Poset Subtle tree property P-Ideal Dichotomy Dowker space Subadditive middle diamond b-scale Distributive tree weak Kurepa tree Luzin set Ramsey theory over partitions Open Access Knaster and friends Non-saturation Minimal Walks unbounded function Cardinal function Subnormal ideal indecomposable ultrafilter Diamond-sharp Souslin Tree Uniformly homogeneous Strong coloring Generalized descriptive set theory weak square L-space Sierpinski's onto mapping principle Uniformization Singular cofinality transformations Dushnik-Miller free Boolean algebra AIM forcing Uniformly coherent ZFC construction Iterated forcing Lipschitz reduction Almost countably chromatic Vanishing levels polarized partition relation Aronszajn tree Precaliber Hereditarily Lindelöf space stationary hitting Singular Density Sakurai's Bell inequality OCA Fast club Analytic sets Chang's conjecture full tree Successor of Regular Cardinal Prevalent singular cardinals HOD Closed coloring Rado's conjecture Subtle cardinal Reduced Power regressive Souslin tree Ineffable cardinal Ulam matrix Coherent tree nonmeager set tensor product graph super-Souslin tree Cohen real Large Cardinals Erdos-Hajnal graphs Hedetniemi's conjecture positive partition relation PFA 54G20 Well-behaved magma GMA stick Kurepa Hypothesis Nonspecial tree Diamond for trees Commutative cancellative semigroups strongly bounded groups Erdos Cardinal Sigma-Prikry Partition Relations Absoluteness club_AD Selective Ultrafilter PFA(S)[S] Singular cardinals combinatorics Club Guessing higher Baire space very good scale approachability ideal Shelah's Strong Hypothesis Fodor-type reflection Rock n' Roll
Tag Archives: 03E55
Was Ulam right? II: Small width and general ideals
Joint work with Tanmay Inamdar. Abstract. We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam’s theorem and its extension … Continue reading
Posted in Partition Relations, Publications
Tagged 03E02, 03E35, 03E55, C-sequence, Open Access, Subnormal ideal, Ulam matrix, Was Ulam right
1 Comment
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
Knaster and friends II: The C-sequence number
Joint work with Chris Lambie-Hanson. Abstract. Motivated by a characterization of weakly compact cardinals due to Todorcevic, we introduce a new cardinal characteristic, the C-sequence number, which can be seen as a measure of the compactness of a regular uncountable … Continue reading
Openly generated Boolean algebras and the Fodor-type reflection principle
Joint work with Sakaé Fuchino. Abstract: We prove that the Fodor-type Reflection Principle (FRP) is equivalent to the assertion that any Boolean algebra is openly generated if and only if it is $\aleph _2$-projective. Previously it was known that this … Continue reading
On the consistency strength of the Milner-Sauer conjecture
Abstract: In their paper from 1981, Milner and Sauer conjectured that for any poset $\mathbb P$, if $\text{cf}(\mathbb P)$ is a singular cardinal $\lambda$, then $\mathbb P$ must contain an antichain of size $\text{cf}(\lambda)$. The conjecture is consistent and known … Continue reading
