Deducing the density Hales-Jewett theorem from an infinitary removal lemma
From MaRDI portal
Publication:639342
DOI10.1007/s10959-011-0373-4zbMath1235.60031arXiv0903.1633OpenAlexW2022702239WikidataQ124914380 ScholiaQ124914380MaRDI QIDQ639342
Publication date: 20 September 2011
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.1633
Dynamical systems and their relations with probability theory and stochastic processes (37A50) Ramsey theory (05D10) Exchangeability for stochastic processes (60G09)
Related Items (7)
Another note on intervals in the Hales-Jewett theorem ⋮ Concentration estimates for functions of finite high‐dimensional random arrays ⋮ A new proof of the density Hales-Jewett theorem ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A structure theorem for stochastic processes indexed by the discrete hypercube ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deducing the multidimensional Szemerédi theorem from an infinitary removal lemma
- Idempotents in compact semigroups and Ramsey theory
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- A dual form of Ramsey's theorem
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- An ergodic Szemerédi theorem for commuting transformations
- Symmetries on random arrays and set-indexed processes
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A density version of the Hales-Jewett theorem
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- On the norm convergence of non-conventional ergodic averages
- On sets of integers containing k elements in arithmetic progression
- The counting lemma for regular k‐uniform hypergraphs
- Probabilistic Symmetries and Invariance Principles
This page was built for publication: Deducing the density Hales-Jewett theorem from an infinitary removal lemma