Archives
Keywords
free Boolean algebra SNR Reduced Power transformations higher Baire space free Souslin tree PFA(S)[S] Forcing Successor of Regular Cardinal approachability ideal Erdos-Hajnal graphs specializable Souslin tree Strong coloring super-Souslin tree 54G20 Prevalent singular cardinals stationary hitting Strongly Luzin set Non-saturation Precaliber Forcing Axioms Rado's conjecture Sigma-Prikry weak Kurepa tree L-space Subnormal ideal square principles Poset Lipschitz reduction Countryman line Shelah's Strong Hypothesis Commutative cancellative semigroups HOD Dushnik-Miller Singular cofinality Generalized descriptive set theory Generalized Clubs ZFC construction Open Access xbox Antichain Club Guessing Cardinal function Aronszajn tree Weakly compact cardinal Subtle cardinal AIM forcing Prikry-type forcing Successor of Singular Cardinal nonmeager set very good scale Ramsey theory over partitions strongly bounded groups Ostaszewski square Fast club Diamond reflection principles Strongly compact cardinal O-space indecomposable ultrafilter diamond star Local Club Condensation. Singular cardinals combinatorics b-scale ccc Hereditarily Lindelöf space coloring number Postprocessing function tensor product graph middle diamond PFA Reflecting stationary set regressive Souslin tree Whitehead Problem Nonspecial tree Martin's Axiom Filter reflection Subtle tree property positive partition relation Diamond for trees Diamond-sharp Analytic sets weak square Sakurai's Bell inequality Dowker space weak diamond Uniformly coherent Selective Ultrafilter Uniformization Uniformly homogeneous Intersection model polarized partition relation countably metacompact Well-behaved magma Souslin Tree Ulam matrix square unbounded function incompactness Amenable C-sequence Constructible Universe Was Ulam right? Sierpinski's onto mapping principle Foundations Rainbow sets Iterated forcing Almost countably chromatic Commutative projection system stationary reflection Universal Sequences Square-Brackets Partition Relations Hedetniemi's conjecture Chromatic number Fat stationary set Cohen real Parameterized proxy principle Jonsson cardinal Kurepa Hypothesis Slim tree projective Boolean algebra Small forcing Closed coloring Respecting tree Almost-disjoint family Partition Relations Subadditive C-sequence Almost Souslin Greatly Mahlo Absoluteness club_AD Singular Density Luzin set full tree Minimal Walks Ascent Path GMA Large Cardinals Microscopic Approach Knaster and friends Knaster Axiom R P-Ideal Dichotomy stick Hindman's Theorem Cardinal Invariants Distributive tree Chang's conjecture Mandelbrot set Coherent tree S-Space Erdos Cardinal Rock n' Roll sap Ineffable cardinal Fodor-type reflection OCA Vanishing levels
Tag Archives: Hindman’s Theorem
Sums of triples in Abelian groups
Joint work with Ido Feldman. Abstract. Motivated by a problem in additive Ramsey theory, we extend Todorcevic’s partitions of three-dimensional combinatorial cubes to handle additional three-dimensional objects. As a corollary, we get that if the continuum hypothesis fails, then for … Continue reading
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
Posted in Groups, Partition Relations, Publications
Tagged 03E02, 03E35, 03E75, 05A17, 05D10, 11P99, 20M14, Chang's conjecture, Commutative cancellative semigroups, Erdos Cardinal, Hindman's Theorem, Jonsson cardinal, Kurepa Hypothesis, Square-Brackets Partition Relations, Weakly compact cardinal, ZFC construction
1 Comment
