基本信息
浏览量:40
职业迁徙
个人简介
Pham is a highly inventive and prolific researcher who has already made fundamental contributions to combinatorics, probability, number theory, and theoretical computer science. While still an undergraduate, he showed with Fox and Zhao that Green's popular difference theorem, an extension of Roth's theorem on arithmetic progressions in dense sets of integers, requires tower-type bounds – the first known application of Szemerédi's regularity method that truly requires tower-type bounds. Subsequently, with Park, he proved the Kahn-Kalai conjecture on the location of phase transitions and Talagrand's conjecture on selector processes; with Conlon and Fox, he solved various long-standing conjectures of Erdős in additive combinatorics concerning subset sums and Ramsey complete sequences; and with Cook and Dembo, he developed a quantitative nonlinear large deviations theory for random hypergraphs.
研究兴趣
论文共 71 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
COMBINATORICS PROBABILITY & COMPUTING (2024)
IEEE Transactions on Information Theoryno. 99 (2023): 1-1
APPLIED SCIENCES-BASELno. 8 (2023): 4968-4968
COMPTES RENDUS MATHEMATIQUEno. 1 (2023): 869-876
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 1665-1681
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn