User contributions for Gowers
From Polymath Wiki
Jump to navigationJump to search
9 January 2010
- 08:1708:17, 9 January 2010 diff hist +1,039 Experimental results →The seven-point hexagon
- 04:2704:27, 9 January 2010 diff hist +681 Experimental results No edit summary
- 04:2004:20, 9 January 2010 diff hist +159 m The Erdős discrepancy problem No edit summary
- 04:1704:17, 9 January 2010 diff hist +1,144 The Erdős discrepancy problem →Some definitions and notational conventions: Added definitions to do with multiplicativity
- 03:5703:57, 9 January 2010 diff hist +375 Experimental results Divided page into sections and subsections
- 03:5103:51, 9 January 2010 diff hist +630 Experimental results Added numbers up to 450
8 January 2010
- 08:4808:48, 8 January 2010 diff hist +218 The Erdős discrepancy problem →Annoted Bibliography: Added link to page of Erdős problems
- 08:4408:44, 8 January 2010 diff hist +9 m The Erdős discrepancy problem →Some definitions and notational conventions
- 08:4408:44, 8 January 2010 diff hist +636 The Erdős discrepancy problem →Some definitions and notational conventions: Began section
- 05:3005:30, 8 January 2010 diff hist +90 Experimental results No edit summary
- 04:3804:38, 8 January 2010 diff hist +285 Experimental results Continued up to 240
- 04:1404:14, 8 January 2010 diff hist +2,698 Experimental results No edit summary
- 04:0904:09, 8 January 2010 diff hist +2,382 Experimental results No edit summary
7 January 2010
- 05:2005:20, 7 January 2010 diff hist +17 The Erdős discrepancy problem →Simple observations
- 04:4004:40, 7 January 2010 diff hist +1,457 The Erdős discrepancy problem →Simple observations
- 04:2704:27, 7 January 2010 diff hist +683 The Erdős discrepancy problem No edit summary
- 04:0504:05, 7 January 2010 diff hist +214 N Experimental results New page: It would be good to have some long sequences with low discrepancy displayed nicely here (or on subsidiary pages) in tabular form, together with discussions about the structures that can be...
- 04:0404:04, 7 January 2010 diff hist +2,424 N The Erdős discrepancy problem New page: ==Introduction and statement of problem== The Erdős discrepancy problem is a problem that has been around since the 1930s and has resisted attack ever since. It is extremely easy to ...
- 03:4203:42, 7 January 2010 diff hist +153 Main Page Added Polymath5 to list of existing projects
21 October 2009
- 10:4610:46, 21 October 2009 diff hist +18 Line-free sets correlate locally with complexity-1 sets No edit summary current
9 August 2009
- 06:5606:56, 9 August 2009 diff hist +1 m The complexity class promise-BPP No edit summary current
30 July 2009
- 10:1310:13, 30 July 2009 diff hist +24 m The complexity class P No edit summary current
- 10:1310:13, 30 July 2009 diff hist +23 m An efficient algorithm exists if Cramer's conjecture holds No edit summary
- 10:1110:11, 30 July 2009 diff hist −39 Finding primes Undo revision 2134 by Gowers (Talk)
- 10:1010:10, 30 July 2009 diff hist +39 Finding primes No edit summary
- 10:0910:09, 30 July 2009 diff hist +2,301 N An efficient algorithm exists if Cramer's conjecture holds Created article
- 09:5209:52, 30 July 2009 diff hist +7 Finding primes Added Cramer link
29 July 2009
- 09:2809:28, 29 July 2009 diff hist +814 The complexity class BPP No edit summary current
- 01:4601:46, 29 July 2009 diff hist +4,374 N Pseudo-random generators (PRG) New page: Loosely speaking, a pseudorandom generator is a deterministic and efficiently computable function that cannot be distinguished in polynomial time from a random function. To see how to mak...
28 July 2009
- 16:0716:07, 28 July 2009 diff hist +165 N Talk:The complexity class DTIME New page: It would be useful to have an indication of why DTIME is interesting. Is it just a convenient abbreviation when you've got some running time that isn't a polynomial? current
- 14:4014:40, 28 July 2009 diff hist −7 m Finding primes No edit summary
- 14:3514:35, 28 July 2009 diff hist 0 m P=NP implies a deterministic algorithm to find primes No edit summary current
- 14:3314:33, 28 July 2009 diff hist +1,107 N The complexity class BPP New page: The complexity class BPP is, very roughly, the class of all problems for which there is a randomized algorithm that runs in polynomial time and almost always gives the right answer. A sl...
- 14:1914:19, 28 July 2009 diff hist +291 The complexity class NP No edit summary current
- 14:0514:05, 28 July 2009 diff hist +1,608 N The complexity class NP New page: NP is often described informally as the class of all problems for which there exists a polynomial-time verification that the answer is yes, if it is yes. For instance, the problem "Is the ...
- 13:5313:53, 28 July 2009 diff hist +3,135 N The complexity class P Created page
- 13:3613:36, 28 July 2009 diff hist +185 Finding primes No edit summary
21 May 2009
- 03:1203:12, 21 May 2009 diff hist +4,690 N Sperner.tex Created section
- 03:1103:11, 21 May 2009 diff hist +17 TeX files for first paper Added link to Sperner section
19 March 2009
- 05:2305:23, 19 March 2009 diff hist +171 A general result about density increments No edit summary
- 04:1804:18, 19 March 2009 diff hist 0 m Timeline No edit summary
- 04:1704:17, 19 March 2009 diff hist +138 Timeline No edit summary
18 March 2009
- 11:2311:23, 18 March 2009 diff hist +3,985 N A general result about density increments New page: ==Introduction== The purpose of this page is to prove a general result about density-increment strategies. It is not logically necessary as part of the proof of DHJ(3) or DHJ(k), but it h...
- 10:2910:29, 18 March 2009 diff hist +47 Main Page →Complete proofs or detailed sketches of potentially useful results: Added link to article about to be written
- 10:2810:28, 18 March 2009 diff hist +235 Main Page →The Problem
16 March 2009
- 05:2005:20, 16 March 2009 diff hist +144 Main Page →Threads and further problems
- 05:0305:03, 16 March 2009 diff hist +1,845 A general partitioning principle No edit summary
- 04:4004:40, 16 March 2009 diff hist −31 A general partitioning principle →Second step of the iteration
- 04:3304:33, 16 March 2009 diff hist +1,352 A general partitioning principle No edit summary
- 04:1004:10, 16 March 2009 diff hist 0 A general partitioning principle →Definitions and statement of result
