[math-fun] Erdos "minimize count of distinct distances" problem (pretty much) solved
this seems a breakthrough. The proof technique they use probably has many more applications but it seems mysterious why/how it works so well: http://arxiv.org/pdf/1011.4105v3
Terry Tao wrote about this paper, and also about Dvir's earlier paper where he applied a similar method to the finite-field Kakeya problem. http://terrytao.wordpress.com/2010/11/20/the-guth-katz-bound-on-the-erdos-di... http://terrytao.wordpress.com/2008/03/24/dvirs-proof-of-the-finite-field-kak... AA On Wed, Nov 16, 2011 at 7:18 AM, Warren Smith <warren.wds@gmail.com> wrote:
this seems a breakthrough. The proof technique they use probably has many more applications but it seems mysterious why/how it works so well:
http://arxiv.org/pdf/1011.4105v3
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
participants (2)
-
Alon Amit -
Warren Smith