Archives
Keywords
Fat stationary set Almost countably chromatic Sakurai's Bell inequality Constructible Universe Baumgartner's square Ostaszewski square 54G20 Diamond-sharp Greatly Mahlo approachability ideal Ineffable cardinal Non-saturation Shelah's Strong Hypothesis Entangled linear order Sierpinski's onto mapping principle Ramsey theory over partitions super-Souslin tree Generalized descriptive set theory positive partition relation strongly bounded groups Diamond Kurepa Hypothesis projective Boolean algebra Commutative cancellative semigroups Slim tree Closed coloring transformations Erdos-Hajnal graphs Mandelbrot set Respecting tree stationary reflection Parameterized proxy principle Prevalent singular cardinals Subtle cardinal Diamond for trees Cohen real Minimal Walks countably metacompact Filter reflection GMA unbounded function Forcing Axioms nonmeager set sap weak Kurepa tree Jonsson cardinal free Boolean algebra perfectly normal Subadditive Well-behaved magma P-Ideal Dichotomy Forcing Precaliber Knaster Local Club Condensation. Small forcing Universal Sequences reflection principles diamond star club_AD stick Generalized Clubs Knaster and friends Analytic sets Singular Density Hereditarily Lindelöf space Distributive tree C-sequence ZFC construction Reflecting stationary set Strong coloring Ascent Path L-space AIM forcing Singular cofinality regressive Souslin tree Was Ulam right? Uniformly coherent incompactness indecomposable filter Cardinal function Large Cardinals weak square square OCA Antichain full tree Successor of Regular Cardinal Rock n' Roll xbox Dowker space Successor of Singular Cardinal Luzin set Uniformization weak diamond Rainbow sets very good scale Rado's conjecture Almost-disjoint family Forcing with side conditions Reduced Power stationary hitting Coherent tree Lipschitz reduction Partition relations for trees SNR specializable Souslin tree Erdos Cardinal ccc Sigma-Prikry Monotonically far Countryman line square principles Hindman's Theorem Uniformly homogeneous Partition Relations b-scale Postprocessing function Subnormal ideal Hedetniemi's conjecture tensor product graph Prikry-type forcing Ulam matrix Fodor-type reflection Iterated forcing HOD Absoluteness Ascending path Weakly compact cardinal Square-Brackets Partition Relations Vanishing levels polarized partition relation free Souslin tree Club Guessing Martin's Axiom Intersection model Dushnik-Miller Nonspecial tree Microscopic Approach Souslin Tree Subtle tree property Singular cardinals combinatorics O-space Interval topology on trees Commutative projection system Open Access PFA(S)[S] Amenable C-sequence Strongly Luzin set Whitehead Problem Strongly compact cardinal Chromatic number middle diamond coloring number Axiom R PFA Fast club Selective Ultrafilter Almost Souslin higher Baire space Poset S-Space Foundations Aronszajn tree Cardinal Invariants Chang's conjecture
Blog Archives
Partition relations for trees II: Entangled linear orders
Joint work with Tanmay Inamdar. Abstract. We find new sufficient conditions for the existence of entangled linear orders. The constructions use anti-Ramsey colourings for trees, and they provide a fine control on the extent of entangledness. As an application, from … Continue reading
Posted in Partition Relations, Preprints
Tagged Aronszajn tree, Entangled linear order, Partition relations for trees, Strongly Luzin set
Comments Off on Partition relations for trees II: Entangled linear orders
Partition relations for trees I: Incomparable trees
Joint work with Tanmay Inamdar. Abstract. Todorcevic proved that Martin’s axiom implies that every two coherent $\aleph_1$-Aronszajn trees are comparable. Here, from cardinal arithmetic assumptions, we obtain the failure of the analogous statement for higher trees. In particular, for every … Continue reading
Posted in Partition Relations, Publications
Tagged Lipschitz reduction, Partition relations for trees
Comments Off on Partition relations for trees I: Incomparable trees
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
Walks on uncountable ordinals and non-structure theorems for higher Aronszajn lines
Joint work with Tanmay Inamdar. Abstract. We investigate global structural properties of linear orders of a fixed infinite size. It is classical that the countable linear orders and the continuum-sized orders exhibit contrasting behaviours. Modern results show that strong extensions … Continue reading
Posted in Basis problems, Partition Relations, Preprints
Tagged Aronszajn tree, Ascending path, Club Guessing, Countryman line, Entangled linear order, Minimal Walks, Monotonically far, Partition relations for trees, Strong coloring, Subtle tree property, Vanishing levels, ZFC construction
2 Comments
A club guessing toolbox I
Joint work with Tanmay Inamdar. Abstract. Club guessing principles were introduced by Shelah as a weakening of Jensen’s diamond. Most spectacularly, they were used to prove Shelah’s ZFC bound on the power of the first singular cardinal. These principles have … Continue reading
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, Kurepa Hypothesis, Open Access, Subnormal ideal, Ulam matrix, Was Ulam right?
2 Comments
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