- 1 The Problem
- 2 Basic definitions
- 3 Useful background materials
- 4 Threads and further problems
- 5 Proof strategies
- 6 Related theorems
- 7 Important concepts related to possible proofs
- 8 Complete proofs or detailed sketches of potentially useful results
- 9 Attempts at proofs of DHJ(3)
- 10 Generalizing to DHJ(k)
- 11 Bibliography
The basic problem to be considered by the Polymath1 project is to explore a particular combinatorial approach to the density Hales-Jewett theorem for k=3 (DHJ(3)), suggested by Tim Gowers. The original proof of DHJ(3) used arguments from ergodic theory.
Useful background materials
Here is some background to the project. There is also a general discussion on massively collaborative "polymath" projects. This is a cheatsheet for editing the wiki. Finally, here is the general Wiki user's guide.
Threads and further problems
- Is massively collaborative mathematics possible? (inactive)
- (1-199) A combinatorial approach to density Hales-Jewett (inactive)
- (200-299) Upper and lower bounds for the density Hales-Jewett problem (inactive)
- (300-399) The triangle-removal approach (inactive)
- (400-499) Quasirandomness and obstructions to uniformity (inactive)
- (500-599) Possible proof strategies (inactive)
- (600-699) A reading seminar on density Hales-Jewett (inactive)
- (700-799) Bounds for the first few density Hales-Jewett numbers, and related quantities (inactive)
- (800-849) Brief review of polymath1 (inactive)
- (850-899) DHJ(3): 851-899 (inactive)
- (900-999) DHJ(3): 900-999 (Density Hales-Jewett type numbers) (active)
- (1000-1049) Problem solved (probably) (active)
- Polymath1 and open collaborative mathematics (active)
Here is a further list of blog posts related to the Polymath1 project. Here is wordpress's list. Here is a timeline of progress so far.
There is also a chance that we will be able to improve the known bounds on Moser's cube problem.
Here are some unsolved problems arising from the above threads.
Here is a tidy problem page.
It is natural to look for strategies based on one of the following:
- Szemerédi's original proof of Szemerédi's theorem.
- Szemerédi's combinatorial proof of Roth's theorem.
- Ajtai-Szemerédi's proof of the corners theorem.
- The density increment method.
- The triangle removal lemma.
- Ergodic-inspired methods.
- The Furstenberg-Katznelson argument.
- Use of equal-slices measure.
- Carlson's theorem.
- The Carlson-Simpson theorem.
- Folkman's theorem.
- The Graham-Rothschild theorem.
- The colouring Hales-Jewett theorem.
- The Kruskal-Katona theorem.
- Roth's theorem.
- The IP-Szemerédi theorem.
- Sperner's theorem.
- Szemerédi's regularity lemma.
- Szemerédi's theorem.
- The triangle removal lemma.
All these theorems are worth knowing. The most immediately relevant are Roth's theorem, Sperner's theorem, Szemerédi's regularity lemma and the triangle removal lemma, but some of the others could well come into play as well.
- Complexity of a set
- Concentration of measure
- Influence of variables
- Obstructions to uniformity
Complete proofs or detailed sketches of potentially useful results
- The multidimensional Sperner theorem
- Line-free sets correlate locally with complexity-1 sets
- Correlation with a 1-set implies correlation with a subspace (Superseded)
- A Fourier-analytic proof of Sperner's theorem
- A second Fourier decomposition related to Sperner's theorem
- A Hilbert space lemma
- A Modification of the Ajtai-Szemerédi argument
Attempts at proofs of DHJ(3)
- An outline of a density-increment argument (ultimately didn't work)
- A second outline of a density-increment argument (seems to be OK but more checking needed)
Generalizing to DHJ(k)
- DHJ(k) implies multidimensional DHJ(k)
- Line free sets correlate locally with dense sets of complexity k-2
Here is a Bibliography of relevant papers in the field.