Polymath Project

From Wikipedia, the free encyclopedia
  (Redirected from Polymath project)
Jump to: navigation, search

The Polymath Project is a collaboration among mathematicians to solve important and difficult mathematical problems by coordinating many mathematicians to communicate with each other on finding the best route to the solution. The project began in January 2009 on Tim Gowers' blog when he posted a problem and asked his readers to post partial ideas and partial progress toward a solution. This experiment resulted in a new answer to a difficult problem, and since then the Polymath Project has grown to describe a particular process of using an online collaboration to solve any math problem.


In January 2009 Gowers chose to start a social experiment on his blog by choosing an important unsolved mathematical problem and issuing an invitation for other people to help solve it collaboratively in the comments section of his blog.[1] Along with the math problem itself, Gowers asked a question which was included in the title of his blog post, "is massively collaborative mathematics possible?"[2][3] This post led to his creation of the Polymath Project.

Problems solved[edit]


The initial proposed problem for this project, now called Polymath1 by the Polymath community, was to find a new combinatorial proof to the density version of the Hales–Jewett theorem.[4] As the project took form, two main threads of discourse emerged. The first thread, which was carried out in the comments of Gowers's blog, would continue with the original goal of finding a combinatorial proof. The second thread, which was carried out in the comments of Terence Tao's blog, focused on calculating bounds on density of Hales-Jewett numbers and Moser numbers for low dimensions.

After seven weeks, Gowers announced on his blog that the problem was "probably solved",[5] though work would continue on both Gowers's thread and Tao's thread well into May 2009, some three months after the initial announcement. In total over 40 people contributed to the Polymath1 project. Both threads of the Polymath1 project have been successful, producing at least two new papers to be published under the pseudonym D.H.J. Polymath.[6][7][8]


This project was set up in order to try to solve the Erdős discrepancy problem. It was active for much of 2010 and had a brief revival in 2012, but did not end up solving the problem. However, in September 2015, Terence Tao, one of the participants of Polymath5, solved the problem in a pair of papers. One paper proved an averaged form of the Chowla and Elliott conjectures, making use of recent advances in analytic number theory concerning correlations of values of multiplicative functions. The other paper showed how this new result, combined with some arguments discovered by Polymath5, were enough to give a complete solution of the problem. Thus, Polymath5 ended up making a significant contribution to the solution.


The Polymath8 project was proposed to improve the bounds for small gaps between primes. It has two components:

  • Polymath8a, "Bounded gaps between primes", was a project to improve the bound H=H_1 on the least gap between consecutive primes that was attained infinitely often, by developing the techniques of Yitang Zhang. This project concluded with a bound of H = 4,680.
  • Polymath8b, "Bounded intervals with many primes", was project to improve the value of H_1 further, as well as H_m (the least gap between primes with m-1 primes between them that is attained infinitely often), by combining the Polymath8a results with the techniques of James Maynard. This project concluded with a bound of H=246, as well as additional bounds on H_m.

Both components of the Polymath8 project have been successful, producing two new papers to be published under the pseudonym D.H.J. Polymath.[9][10]


See also[edit]


  1. ^ Nielsen, Michael (2012). Reinventing discovery : the new era of networked science. Princeton NJ: Princeton University Press. pp. 1–3. ISBN 978-0-691-14890-8. 
  2. ^ Gowers, Tim. "Is massively collaborative mathematics possible?". Gowers' weblog. Retrieved 2009-03-30. 
  3. ^ Gowers, T.; Nielsen, M. (2009). "Massively collaborative mathematics". Nature 461 (7266): 879–881. Bibcode:2009Natur.461..879G. doi:10.1038/461879a. PMID 19829354. 
  4. ^ Gowers, Tim (1 February 2009). "A combinatorial approach to density Hales-Jewett". Gower's Weblog. 
  5. ^ Nielsen, Michael (2009-03-20). "The Polymath project: scope of participation". Retrieved 2009-03-30. 
  6. ^ Polymath (2010). "Deterministic methods to find primes". arXiv:1009.3956 [math.NT]. 
  7. ^ Polymath (2010). "Density Hales-Jewett and Moser numbers". arXiv:1002.0374 [math.CO]. 
  8. ^ Polymath (2009). "A new proof of the density Hales-Jewett theorem". arXiv:0910.3926 [math.CO]. 
  9. ^ Polymath (2014). "New equidistribution estimates of Zhang type". doi:10.2140/ant.2014.8.2067. 
  10. ^ Polymath (2014). "Research in the Mathematical Sciences". doi:10.1186/s40687-014-0012-7. 

Research about the polymath project[edit]

External links[edit]