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