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