21世纪的数学

hbghlyj

https://en.wikipedia.org/wiki/Ti ... matics#21st_century列出了2000年至今的数学进展

• 2002 – Manindra Agrawal, Nitin Saxena, and Neeraj Kayal of IIT Kanpur present an unconditional deterministic polynomial time algorithm to determine whether a given number is prime (the AKS primality test).
• 2002 – Preda Mihăilescu proves Catalan's conjecture.
• 2003 – Grigori Perelman proves the Poincaré conjecture.
• 2004 – the classification of finite simple groups, a collaborative work involving some hundred mathematicians and spanning fifty years, is completed.
• 2004 – Ben Green and Terence Tao prove the Green–Tao theorem.
• 2009 – Fundamental lemma (Langlands program) is proved by Ngô Bảo Châu.^[22]
• 2010 – Larry Guth and Nets Hawk Katz solve the Erdős distinct distances problem.
• 2013 – Yitang Zhang proves the first finite bound on gaps between prime numbers.^[23]
• 2014 – Project Flyspeck^[24] announces that it completed a proof of Kepler's conjecture.^{[25][26][27][28]}
• 2015 – Terence Tao solves the Erdős discrepancy problem.
• 2015 – László Babai finds that a quasipolynomial complexity algorithm would solve the Graph isomorphism problem.
• 2016 – Maryna Viazovska solves the sphere packing problem in dimension 8. Subsequent work building on this leads to a solution for dimension 24.