基本信息
浏览量:93
职业迁徙
个人简介
Nets Hawk Katz is the IBM 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".
He is the author of several important 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 {\displaystyle \mathbb {Z} /p\mathbb {Z} }{\displaystyle \mathbb {Z} /p\mathbb {Z} } grows substantially under either addition or multiplication. More precisely, if {\displaystyle A}A is a set such that {\displaystyle \max(|A\cdot A|,|A+A|)\leq K|A|}{\displaystyle \max(|A\cdot A|,|A+A|)\leq K|A|}, then {\displaystyle A}A has size at most {\displaystyle K^{C}}{\displaystyle K^{C}} or at least {\displaystyle p/K^{C}}{\displaystyle p/K^{C}} where {\displaystyle C}C is a constant that depends on {\displaystyle A}A. 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 Izabella Łaba and Terence Tao he proved that the upper Minkowski dimension of Kakeya sets in 3 dimensions is strictly greater than 5/2, and jointly with Terence Tao he established new bounds in large dimensions.
In 2010, 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 {\displaystyle N}N points in the plane has at least {\displaystyle cN/\log N}{\displaystyle cN/\log N} distinct distances.
In early 2011, in joint work with Michael Bateman, he improved the best known bounds in the cap set problem: if {\displaystyle A}A is a subset of {\displaystyle (\mathbb {Z} /3\mathbb {Z} )^{n}}{\displaystyle (\mathbb {Z} /3\mathbb {Z} )^{n}} of cardinality at least {\displaystyle 3^{n}/n^{1+c}}{\displaystyle 3^{n}/n^{1+c}}, where {\displaystyle c>0}c>0, then {\displaystyle A}A contains three elements in a line.
In 2012, he was named a Guggenheim fellow.During 2011-2012, he was the managing editor of the Indiana University Mathematics Journal.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. In 2015, he received the Clay Research Award.
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".
He is the author of several important 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 {\displaystyle \mathbb {Z} /p\mathbb {Z} }{\displaystyle \mathbb {Z} /p\mathbb {Z} } grows substantially under either addition or multiplication. More precisely, if {\displaystyle A}A is a set such that {\displaystyle \max(|A\cdot A|,|A+A|)\leq K|A|}{\displaystyle \max(|A\cdot A|,|A+A|)\leq K|A|}, then {\displaystyle A}A has size at most {\displaystyle K^{C}}{\displaystyle K^{C}} or at least {\displaystyle p/K^{C}}{\displaystyle p/K^{C}} where {\displaystyle C}C is a constant that depends on {\displaystyle A}A. 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 Izabella Łaba and Terence Tao he proved that the upper Minkowski dimension of Kakeya sets in 3 dimensions is strictly greater than 5/2, and jointly with Terence Tao he established new bounds in large dimensions.
In 2010, 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 {\displaystyle N}N points in the plane has at least {\displaystyle cN/\log N}{\displaystyle cN/\log N} distinct distances.
In early 2011, in joint work with Michael Bateman, he improved the best known bounds in the cap set problem: if {\displaystyle A}A is a subset of {\displaystyle (\mathbb {Z} /3\mathbb {Z} )^{n}}{\displaystyle (\mathbb {Z} /3\mathbb {Z} )^{n}} of cardinality at least {\displaystyle 3^{n}/n^{1+c}}{\displaystyle 3^{n}/n^{1+c}}, where {\displaystyle c>0}c>0, then {\displaystyle A}A contains three elements in a line.
In 2012, he was named a Guggenheim fellow.During 2011-2012, he was the managing editor of the Indiana University Mathematics Journal.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. In 2015, he received the Clay Research Award.
研究兴趣
论文共 72 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
user-5da93e5d530c70bec9508e2b(2016)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn