Comments on: Polymath4: Referee report obtained http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/ Massively collaborative mathematical projects Sun, 19 May 2013 02:40:38 +0000 hourly 1 http://wordpress.com/ By: muondo http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-3262 Mon, 13 Jun 2011 16:23:15 +0000 http://polymathprojects.org/?p=223#comment-3262 a little hard for me,but a very good work!

]]> By: Polymath4 « Euclidean Ramsey Theory http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-3217 Wed, 01 Jun 2011 20:22:25 +0000 http://polymathprojects.org/?p=223#comment-3217 [...] The proofs for the article “Deterministic methods to find primes” will appear in Mathematics of Computation but not with a pseudonym. Apparently Mathematics of Computation had a problem with that. The authors will be Ernie Croot, Harald Helfgott and Terence Tao. See this post. [...]

]]> By: Terence Tao http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-3215 Wed, 01 Jun 2011 17:49:03 +0000 http://polymathprojects.org/?p=223#comment-3215 I just returned the proofs to Mathematics of Computation; there were no changes except for the author names (unfortunately, they would not accept a pseudonym authorship, as it disrupted their bibliographic system). Instead, Ernie, Harald, and myself will now be primary authors.

]]> By: Terence Tao http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2869 Fri, 25 Feb 2011 02:15:42 +0000 http://polymathprojects.org/?p=223#comment-2869 The paper has now been accepted, and the published version has been placed on the arXiv.

Gil: I am not so familiar with this aspect of complexity theory, so did not figure out how to write a proper remark about the implications of full derandomisation. I’ll put the remark on the wiki instead (which we already link to regarding the oracle counterexample showing that P=BPP is not sufficient).

]]> By: Weekly picks « Mathblogging.org developer.blog http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2860 Mon, 21 Feb 2011 19:43:08 +0000 http://polymathprojects.org/?p=223#comment-2860 [...] week started off with good news for Polymath4, the referee report is out and looks good. Monday could not get enough of Valentine’s Day mathematics and M@atematicamente had a sweet [...]

]]> By: Gil Kalai http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2857 Sun, 20 Feb 2011 18:46:28 +0000 http://polymathprojects.org/?p=223#comment-2857 Regarding the paragraph: “Given that there is a probabilistic algorithm to locate primes in time polynomial in the digits, it may seem that the conjecture P = BPP would be able to quickly imply a
fast algorithm to locate primes. Unfortunately, to use the P = BPP conjecture, one
would presumably need to obtain a bounded-error probabilistic polynomial (BPP) time
algorithm for solving the above decision problem (or some closely related problem), and
it is not clear how to achieve this.”

Maybe we should mention in one sentence that the required result will follow from “Full derandomization” http://blog.computationalcomplexity.org/2006/07/full-derandomization.html which itself follows from some very harsh hardness result. Then there was a comment (but I forgot where) by Avi Wigderson that full derandomization is much more than needed because of some unary nature of the problem which implies that less harsh hardness result (for turing machines rather than circuits) would suffice.

]]> By: Harald Helfgott http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2856 Sun, 20 Feb 2011 14:45:42 +0000 http://polymathprojects.org/?p=223#comment-2856 I was supported by grant EPSRC EP-054919/1 at the time. That grant is actually somewhat specific to another project, but it would be better to mention it even if I was not using it for this purpose. (“While working on the project, H. A. Helfgott was staying at his parents’”, while truthful, would be non-standard.)

]]> By: Ernie Croot http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2847 Wed, 16 Feb 2011 17:56:20 +0000 http://polymathprojects.org/?p=223#comment-2847 My current NSF grant is DMS-1001111, and while working on the project I was supported by NSA grant.

]]> By: Terence Tao http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2843 Tue, 15 Feb 2011 12:33:35 +0000 http://polymathprojects.org/?p=223#comment-2843 Ah, thanks! I updated the PDF type, but actually I realise the main problem was that I linked to the wrong web page (that showed diffs and revision history rather than the files themselves). I now have a better link

https://svnbackup.xp-dev.com/svn/Finding_primes/

and specifically

https://svnbackup.xp-dev.com/svn/Finding_primes/polymath.pdf

for the most recent version. (I also placed it on my blog at

http://terrytao.files.wordpress.com/2011/02/polymath.pdf

in case the other link does not work well.) I’ve now implemented all the referee changes; I’ll wait for a few days to see if the other contributors have something to say and then will send back the revision.

]]> By: Scott Morrison http://polymathprojects.org/2011/02/14/polymath4-referee-report-obtained/#comment-2842 Tue, 15 Feb 2011 12:15:21 +0000 http://polymathprojects.org/?p=223#comment-2842 It might be that someone typing


svn propset svn:mime-type "application/pdf" fast_strassen.pdf

(and similarly for other PDFs) will fix this problem. I’m not sure about this particular web interface, but for some I’ve used this is the required trick.

]]>