基本信息
浏览量:46
职业迁徙
个人简介
Awards
Sloan Research Fellowship
NSF CAREER Award
Research
I enjoy searching for the largest and best combinatorial objects. Oftentimes the search brings problems of algebraic and geometric flavour, which I especially like.
Below are some of the topics and basic problems that I have played with in the past:
Turán problems: What is the maximum number of edges in an n-vertex graph containing no copy of a fixed graph G?
Geometric selection theorems: Given a large cloud of points in Rd, how to best approximate it by a constant-sized set of points?
Combinatorial number theory: How large does a set of numbers need to be to necessarily contain a solution to a given equation?
Codes: In a given collection of objects (such as bit strings, or vectors) find a large subcollection of very dissimilar objects.
Sloan Research Fellowship
NSF CAREER Award
Research
I enjoy searching for the largest and best combinatorial objects. Oftentimes the search brings problems of algebraic and geometric flavour, which I especially like.
Below are some of the topics and basic problems that I have played with in the past:
Turán problems: What is the maximum number of edges in an n-vertex graph containing no copy of a fixed graph G?
Geometric selection theorems: Given a large cloud of points in Rd, how to best approximate it by a constant-sized set of points?
Combinatorial number theory: How large does a set of numbers need to be to necessarily contain a solution to a given equation?
Codes: In a given collection of objects (such as bit strings, or vectors) find a large subcollection of very dissimilar objects.
研究兴趣
论文共 66 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
arXiv (Cornell University) (2023)
arxiv(2022)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn