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