A density version of the Carlson-Simpson theorem
From MaRDI portal
Publication:479520
DOI10.4171/JEMS/484zbMath1304.05001arXiv1209.4985OpenAlexW2963317607MaRDI QIDQ479520
Pandelis Dodos, Konstantinos Tyros, Vassilis Kanellopoulos
Publication date: 5 December 2014
Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.4985
Related Items (7)
Szemerédi's regularity lemma via martingales ⋮ A disjoint unions theorem for trees ⋮ Measurable events indexed by words ⋮ Carlson-Simpson's lemma and applications in reverse mathematics ⋮ A concentration inequality for product spaces ⋮ Combinatorial Structures on van der Waerden sets ⋮ Measurable events indexed by products of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial theorems in sparse random sets
- Measurable events indexed by products of trees
- Idempotents in compact semigroups and Ramsey theory
- Density theorems for finitistic trees
- A dual form of Ramsey's theorem
- An ergodic Szemerédi theorem for commuting transformations
- A Ramsey theorem for trees
- Two new extensions of the Hales-Jewett theorem
- A density version of the Hales-Jewett theorem
- Set-polynomials and polynomial extension of the Hales-Jewett theorem
- Some unifying principles in Ramsey theory
- Elemental methods in ergodic Ramsey theory
- Remarks on a Ramsey theory for trees
- A density version of the Halpern-Läuchli theorem
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Partition theorems for left and right variable words
- A Simple Proof of the Density Hales–Jewett Theorem
- Regularity and Positional Games
- A Partition Theorem for the Infinite Subtrees of a Tree
- Partition Theorems for Spaces of Variable Words
- Markov Processes and Ramsey Theory for Trees
- Dense Subsets of Products of Finite Trees
- A Partition Theorem
- Ramsey's Theorem for n-Parameter Sets
This page was built for publication: A density version of the Carlson-Simpson theorem
