Difference between revisions of "Main Page"

From Polymath1Wiki
Jump to: navigation, search
(-198)
Line 1: Line 1:
== Threads and further problems==
+
hDHOOf  <a href="http://kyjmdzvhqcrz.com/">kyjmdzvhqcrz</a>, [url=http://tqwqpvtsifxg.com/]tqwqpvtsifxg[/url], [link=http://riqpijdmrbbl.com/]riqpijdmrbbl[/link], http://lckrghakqopc.com/
 
+
* (1-199) [http://gowers.wordpress.com/2009/02/01/a-combinatorial-approach-to-density-hales-jewett/ A combinatorial approach to density Hales-Jewett] (inactive)
+
* (200-299) [http://terrytao.wordpress.com/2009/02/05/upper-and-lower-bounds-for-the-density-hales-jewett-problem/ Upper and lower bounds for the density Hales-Jewett problem] (inactive)
+
* (300-399) [http://gowers.wordpress.com/2009/02/06/dhj-the-triangle-removal-approach/ The triangle-removal approach] (inactive)
+
* (400-499) [http://gowers.wordpress.com/2009/02/08/dhj-quasirandomness-and-obstructions-to-uniformity Quasirandomness and obstructions to uniformity] (inactive)
+
* (500-599) [http://gowers.wordpress.com/2009/02/13/dhj-possible-proof-strategies/#more-441/ Possible proof strategies] (inactive)
+
* (600-699) [http://terrytao.wordpress.com/2009/02/11/a-reading-seminar-on-density-hales-jewett/ A reading seminar on density Hales-Jewett] (inactive)
+
* (700-799) [http://terrytao.wordpress.com/2009/02/13/bounds-for-the-first-few-density-hales-jewett-numbers-and-related-quantities/ Bounds for the first few density Hales-Jewett numbers, and related quantities] (inactive)
+
* (800-849) [http://gowers.wordpress.com/2009/02/23/brief-review-of-polymath1/ Brief review of polymath1] (inactive)
+
* (850-899) [http://gowers.wordpress.com/2009/03/02/dhj3-851-899/ DHJ(3): 851-899] (active)
+
* (900-999) [http://terrytao.wordpress.com/2009/03/04/dhj3-900-999-density-hales-jewett-type-numbers/ DHJ(3): 900-999 (Density Hales-Jewett type numbers)] (active)
+
 
+
[http://blogsearch.google.com/blogsearch?hl=en&ie=UTF-8&q=polymath1&btnG=Search+Blogs Here is a further list of blog posts related to the Polymath1 project].  [http://en.wordpress.com/tag/polymath1/ Here is wordpress's list]. Here is a [[timeline]] of progress so far.
+
 
+
A spreadsheet containing the latest upper and lower bounds for <math>c_n</math> can be found [http://spreadsheets.google.com/ccc?key=p5T0SktZY9DsU-uZ1tK7VEg here].  Here are the proofs of our [[upper and lower bounds]] for these constants.
+
 
+
We are also collecting bounds for [[Fujimura's problem]], motivated by a [[hyper-optimistic conjecture]].
+
 
+
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]].
+
  
 
== Proof strategies ==
 
== Proof strategies ==

Revision as of 08:51, 9 March 2009

hDHOOf <a href="http://kyjmdzvhqcrz.com/">kyjmdzvhqcrz</a>, [url=http://tqwqpvtsifxg.com/]tqwqpvtsifxg[/url], [link=http://riqpijdmrbbl.com/]riqpijdmrbbl[/link], http://lckrghakqopc.com/

Proof strategies

It is natural to look for strategies based on one of the following:

Related theorems

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.

Important concepts related to possible proofs

Complete proofs or detailed sketches of potentially useful results

Attempts at proofs of DHJ(3)

Bibliography

Density Hales-Jewett

  1. H. Furstenberg, Y. Katznelson, “A density version of the Hales-Jewett theorem for k=3“, Graph Theory and Combinatorics (Cambridge, 1988). Discrete Math. 75 (1989), no. 1-3, 227–241.
  2. H. Furstenberg, Y. Katznelson, “A density version of the Hales-Jewett theorem“, J. Anal. Math. 57 (1991), 64–119.
  3. R. McCutcheon, “The conclusion of the proof of the density Hales-Jewett theorem for k=3“, unpublished.

Coloring Hales-Jewett theorem

  1. A. Hales, R. Jewett, Regularity and positional games, Trans. Amer. Math. Soc. 106 1963 222--229. MR143712
  2. N. Hindman, E. Tressler, "The first non-trivial Hales-Jewett number is four", preprint.
  3. P. Matet, "Shelah's proof of the Hales-Jewett theorem revisited", European J. Combin. 28 (2007), no. 6, 1742--1745. MR2339499
  4. S. Shelah, "Primitive recursive bounds for van der Waerden numbers", J. Amer. Math. Soc. 1 (1988), no. 3, 683--697. MR 929498

Roth's theorem

  1. E. Croot, "Szemeredi's theorem on three-term progressions, at a glance, preprint.

Behrend-type constructions

  1. M. Elkin, "An Improved Construction of Progression-Free Sets ", preprint.
  2. B. Green, J. Wolf, "A note on Elkin's improvement of Behrend's construction", preprint.
  3. K. O'Bryant, "Sets of integers that do not contain long arithmetic progressions", preprint.

Triangles and corners

  1. M. Ajtai, E. Szemerédi, Sets of lattice points that form no squares, Stud. Sci. Math. Hungar. 9 (1974), 9--11 (1975). MR369299
  2. I. Ruzsa, E. Szemerédi, Triple systems with no six points carrying three triangles. Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, pp. 939--945, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978. MR519318
  3. J. Solymosi, A note on a question of Erdős and Graham, Combin. Probab. Comput. 13 (2004), no. 2, 263--267. MR 2047239

Kruskal-Katona theorem

  1. P. Keevash, "Shadows and intersections: stability and new proofs", preprint.