Nets Katz: Difference between revisions
No edit summary |
|||
| Line 23: | Line 23: | ||
| doi=10.1007/s00039-004-0451-1 |
| doi=10.1007/s00039-004-0451-1 |
||
| title=A sum-product estimate in finite fields, and applications |
| title=A sum-product estimate in finite fields, and applications |
||
| journal=Geometric |
| journal=Geometric and Functional Analysis |
||
| volume=14 | issue=1 | year=2004 | pages= |
| volume=14 | issue=1 | year=2004 | pages=27–57 |
||
| arxiv=math/0301343 | mr=2053599}} |
| arxiv=math/0301343 | mr=2053599}} |
||
Revision as of 17:04, 30 January 2016
Nets Hawk Katz is professor of mathematics at the California Institute of Technology. He was a professor of mathematics at Indiana University Bloomington until March 2013.
Katz earned a B.A. in mathematics from Rice University in 1990 at the age of 17. He received his Ph.D. in 1993 under Dennis DeTurck at the University of Pennsylvania, with a dissertation titled "Noncommutative Determinants and Applications".[1]
He is the author some results in combinatorics (especially additive combinatorics), harmonic analysis and other areas. In 2003, jointly with Jean Bourgain and Terence Tao, he proved that any subset of Z/pZ grows substantially under either addition or multiplication. More precisely, if A is a set such that both A.A and A + A have cardinality at most K|A| then A has size at most K^C or at least p/K^C. This result was followed by the subsequent work of Bourgain, Sergei Konyagin and Glibichuk, establishing that every approximate field is almost a field.
Somewhat earlier he was involved in establishing new bounds in connection with the dimension of Kakeya sets. Jointly with Laba and Tao he proved that the Hausdorff dimension of Kakeya sets in 3 dimensions is strictly greater than 5/2, and jointly with Tao he established new bounds in large dimensions.
In 2010, Nets Katz along with Larry Guth published the results of their collaborative effort to solve the Erdős distinct distances problem, in which they found a "near-optimal" result, proving that a set of N points in the plane has at least cN/log N distinct distances[2] .[3]
In early 2011, in joint work with Michael Bateman, he improved the best known bounds in the cap set problem: if A is a subset of (Z/3Z)^n of cardinality at least 3^n/n^{1 + c}, where c > 0, then A contains three elements in a line.
In 2012, he was named a Guggenheim fellow.[4] During 2011-2012, he was the managing editor of the Indiana University Mathematics Journal.[5][6] In 2014 he was an invited speaker at the International Congress of Mathematicians at Seoul and gave a talk The flecnode polynomial: a central object in incidence geometry.[7] In 2015 he received the Clay Research Award.[8]
Work
- Katz, Nets Hawk; Tao, Terence (2002). "New bounds for Kakeya problems". J. Anal. Math. 87: 231–263. doi:10.1007/BF02868476. MR 1945284.
- Bourgain, Jean; Katz, Nets Hawk; Tao, Terence (2004). "A sum-product estimate in finite fields, and applications". Geometric and Functional Analysis. 14 (1): 27–57. arXiv:math/0301343. doi:10.1007/s00039-004-0451-1. MR 2053599.
External links
References
- ^ Nets Hawk Katz at the Mathematics Genealogy Project.
- ^ L. Guth, N. Katz (2010). "On the Erdos distinct distance problem in the plane". arXiv:1011.4105v3 [math.CO].
- ^ Tao, Terence (20 Nov 2010), The Guth-Katz bound on the Erdős distance problem, retrieved 3 Apr 2012
- ^ "2012 Fellows by field in the United States and Canada". John Simon Guggenheim Memorial Foundation. Retrieved 5 June 2012.
- ^ "Editorial Board". Indiana University Mathematics Journal. Retrieved 5 June 2012.
- ^ "Nets Katz". John Simon Guggenheim Memorial Foundation. Retrieved 5 June 2012.
- ^ Katz, Nets Hawk (13 April 2013). "The flecnode polynomial: a central object in incidence geometry". arXiv.org.
- ^ Clay Research Award 2015