A new proof of the density Hales-Jewett theorem
From MaRDI portal
Publication:431641
DOI10.4007/annals.2012.175.3.6zbMath1267.11010arXiv0910.3926OpenAlexW2962844449WikidataQ56386667 ScholiaQ56386667MaRDI QIDQ431641
Publication date: 29 June 2012
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.3926
Related Items
Log-Sobolev inequality for the multislice, with applications ⋮ Another note on intervals in the Hales-Jewett theorem ⋮ Additive combinatorics and graph theory ⋮ A note on tilted Sperner families with patterns ⋮ Szemerédi's regularity lemma via martingales ⋮ Colourful categories ⋮ General position subsets and independent hyperplanes in \(d\)-space ⋮ Mathematical Arguments and Distributed Knowledge ⋮ Combinatorially rich sets in arbitrary semigroups ⋮ Long lines in subsets of large measure in high dimension ⋮ Max-norm Ramsey theory ⋮ Sets in Almost General Position ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A non-linear lower bound for planar epsilon-nets ⋮ A structure theorem for stochastic processes indexed by the discrete hypercube ⋮ On the number of points in general position in the plane ⋮ An analogue of the Erdős-Stone theorem for finite geometries ⋮ Tight lower bounds for the size of epsilon-nets ⋮ Recurrence and primitivity for IP systems with polynomial wildcards ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Explanation in mathematical conversations: an empirical investigation ⋮ Proof of the Brown–Erdős–Sós conjecture in groups ⋮ A note on multiparty communication complexity and the Hales-Jewett theorem ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ A heuristic for boundedness of ranks of elliptic curves ⋮ Primes in intervals of bounded length ⋮ About the cover: A new mathematical celebrity ⋮ MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Forbidding intersection patterns between layers of the cube ⋮ Problems and Results on Intersective Sets ⋮ The densest matroids in minor-closed classes with exponential growth rate
Cites Work
- Unnamed Item
- Unnamed Item
- Deducing the density Hales-Jewett theorem from an infinitary removal lemma
- Idempotents in compact semigroups and Ramsey theory
- A quantitative ergodic theory proof of Szemerédi's theorem
- A density version of the Hales-Jewett theorem for \(k=3\)
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
- An ergodic Szemerédi theorem for IP-systems and combinatorial theory
- An ergodic Szemerédi theorem for commuting transformations
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A density version of the Hales-Jewett theorem
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- The ergodic theoretical proof of Szemerédi’s theorem
- Density Hales-Jewett and Moser numbers
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
- Regularity and Positional Games
- On sets of integers containing k elements in arithmetic progression
- Regularity Lemma for k-uniform hypergraphs
- On a problem of Gowers
- Regular Partitions of Hypergraphs: Regularity Lemmas
- Regular Partitions of Hypergraphs: Counting Lemmas
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- A short proof of Sperner's lemma
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- On Certain Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- A new proof of Szemerédi's theorem
