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