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