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