User contributions for Teorth
From Polymath Wiki
Jump to navigationJump to search
14 February 2009
- 09:4509:45, 14 February 2009 diff hist +2,189 N Szemerédi's combinatorial proof of Roth's theorem New page: To emphasise the similarity with DHJ, let us work here with Roth's theorem for <math>[3]^n</math>: '''Roth's theorem.''' If n is sufficiently large depending on <math>\delta > 0</math>, ...
- 09:1809:18, 14 February 2009 diff hist +1,876 N Ajtai-Szemerédi's proof of the corners theorem New page: [Cleanup needed.] Ajtai and Szemerédi found a clever proof of the corners theorem that used Szemerédi’s theorem as a lemma. This gives us a direction to explore that we have hardly to...
- 09:1509:15, 14 February 2009 diff hist +639 Furstenberg-Katznelson argument →Step 3: Creating transformations
- 08:5108:51, 14 February 2009 diff hist +76 Upper and lower bounds No edit summary
- 08:4908:49, 14 February 2009 diff hist 0 Upper and lower bounds →Larger n
- 08:4908:49, 14 February 2009 diff hist +724 Upper and lower bounds →Larger n
- 00:5400:54, 14 February 2009 diff hist +1,006 Furstenberg-Katznelson argument →Step 3: Creating transformations
- 00:0800:08, 14 February 2009 diff hist +2 Furstenberg-Katznelson argument →Step 1: Random sampling
- 00:0800:08, 14 February 2009 diff hist +166 Furstenberg-Katznelson argument No edit summary
- 00:0400:04, 14 February 2009 diff hist +4,503 N Furstenberg-Katznelson argument New page: '''Theorem DHJ(3)'''. For every <math>\delta > 0</math> there exists n such that every subset <math>A \subset [3]^n</math> of density at least <math>\delta<\math> contains a combinatorial...
13 February 2009
- 23:2523:25, 13 February 2009 diff hist +65 Main Page →Proof strategies
- 21:3221:32, 13 February 2009 diff hist +346 Main Page →Threads
- 21:1921:19, 13 February 2009 diff hist +106 Main Page →Threads
- 20:4320:43, 13 February 2009 diff hist +101 Fujimura's problem →n=4
- 20:3120:31, 13 February 2009 diff hist +2 Moser's cube problem No edit summary
- 20:3120:31, 13 February 2009 diff hist +229 Moser's cube problem No edit summary
- 20:2920:29, 13 February 2009 diff hist +870 N Moser's cube problem New page: Let <math>c'_n</math> denote the largest subset of <math>[3]^n</math> which does not contain any geometric line (which is the same as a combinatorial line, but has a second wildcard y whic...
- 20:2620:26, 13 February 2009 diff hist +102 Main Page →Threads
- 20:1820:18, 13 February 2009 diff hist 0 Upper and lower bounds →n=4
- 18:2718:27, 13 February 2009 diff hist +149 Upper and lower bounds No edit summary
- 18:2618:26, 13 February 2009 diff hist 0 Fujimura's problem No edit summary
- 18:2518:25, 13 February 2009 diff hist +109 Fujimura's problem No edit summary
- 18:2318:23, 13 February 2009 diff hist +267 Fujimura's problem No edit summary
- 18:2018:20, 13 February 2009 diff hist 0 Hyper-optimistic conjecture No edit summary
- 18:1918:19, 13 February 2009 diff hist +2,403 N Hyper-optimistic conjecture New page: [http://gowers.wordpress.com/2009/02/08/dhj-quasirandomness-and-obstructions-to-uniformity/#comment-2114 Gil Kalai] and [http://gowers.wordpress.com/2009/02/08/dhj-quasirandomness-and-obst...
- 18:1418:14, 13 February 2009 diff hist +48 Main Page →Threads
- 17:3717:37, 13 February 2009 diff hist +821 Main Page →Bibliography
- 12:4612:46, 13 February 2009 diff hist 0 Main Page →The Problem
- 10:0810:08, 13 February 2009 diff hist +1,114 Upper and lower bounds No edit summary
- 09:0409:04, 13 February 2009 diff hist +629 Fujimura's problem No edit summary
- 08:4808:48, 13 February 2009 diff hist +4 Main Page →Threads
- 08:4708:47, 13 February 2009 diff hist +112 Main Page →Threads
- 08:3808:38, 13 February 2009 diff hist +842 Fujimura's problem →General n
12 February 2009
- 22:1522:15, 12 February 2009 diff hist +206 Fujimura's problem →General n
- 22:1122:11, 12 February 2009 diff hist +3,045 N Fujimura's problem New page: Let <math>\overline{c}^\mu_n</math> the largest subset of the triangular grid :<math>\Delta_n := \{ (a,b,c) \in {\Bbb Z}_+^3: a+b+c=n \}</math> which contains no equilateral triangles. ...
- 22:0422:04, 12 February 2009 diff hist +79 Main Page →Threads
- 21:4121:41, 12 February 2009 diff hist +4,368 Upper and lower bounds →n=3
- 19:2919:29, 12 February 2009 diff hist +671 Upper and lower bounds No edit summary
- 19:2119:21, 12 February 2009 diff hist +265 Upper and lower bounds →n=2
- 19:1319:13, 12 February 2009 diff hist +3,402 N Upper and lower bounds New page: <center>'''Upper and lower bounds for <math>c_n</math> for small values of n.'''</center> == Basic constructions == For all <math>n \geq 1</math>, a basic example of a mostly line-free s...
- 18:5318:53, 12 February 2009 diff hist +54 Main Page →Threads
- 18:5218:52, 12 February 2009 diff hist +10,497 N Unsolved problems New page: '''Gowers.462:''' Incidentally, it occurs to me that we as a collective are doing what I as an individual mathematician do all the time: have an idea that leads to an interesting avenue to...
- 18:5118:51, 12 February 2009 diff hist −10,531 Main Page →Unsolved questions
- 18:5118:51, 12 February 2009 diff hist +69 Main Page →Threads
- 13:4413:44, 12 February 2009 diff hist +358 Main Page →Bibliography
11 February 2009
- 22:3322:33, 11 February 2009 diff hist +23 Main Page →The Problem
- 22:3322:33, 11 February 2009 diff hist +306 Main Page →The Problem
- 20:5020:50, 11 February 2009 diff hist +592 Main Page No edit summary
- 20:3920:39, 11 February 2009 diff hist +259 Main Page No edit summary
- 20:3320:33, 11 February 2009 diff hist +820 Main Page →The Problem
