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