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