Problems in Combinatorial Geometry and Ramsey Theory

组合几何和拉姆齐理论中的问题

• 批准号: 2246847
• 负责人: Andrew Suk
• 金额: $ 25.18万
• 依托单位: University of California-San Diego
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-09-01 至 2026-08-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2246847&HistoricalAwards=false
• 关键词: Problems; Combinatorial; Geometry; Ramsey; Theory

This research project studies several fundamental problems in combinatorial geometry and Ramsey theory. Combinatorial geometry is the study of extremal configurations of points, lines, and other simple geometric objects in Euclidean space. Understanding these extremal configurations is a fundamental mathematical problem, which also has several practical applications such as in motion planning in robotics, visibility and intersection problems in computer graphics, and frequency assignment problems in cellular networks. The area has seen tremendous growth over the past 15 years, with numerous unexpected connections to other mathematical areas such as number theory, logic, and computer science. One of the main goals of this project is to further explore these connections, and the interplay of methods from combinatorics (regularity lemma, probabilistic method, and the container method), topology (cell decomposition), algebraic geometry (polynomial method), and computer science (coding theory). Graduate students will be involved in this project.There are three main areas under investigation. The first area is in incidence geometry, and one of the major goals of this project is to characterize dense point-line arrangements in the plane. The second area of research is in the study of combinatorial and topological problems involving planar arrangements of curves, including graph drawings. The third area is in Ramsey theory, which is a fundamental area of combinatorics that focuses on the appearance of a specific configuration in a sufficiently large system. The PI will continue his long-term study of estimating classical graph and hypergraph Ramsey numbers. He will also study Ramsey-type problems with a geometric flavor, which involve point sets in general position, Heilbronn’s triangle problem, visibility graphs, and unavoidable crossing patterns in graph drawings.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

在欧几里得空间中，该点数的研究问题和拉姆西理论中的其他相似对象。蜂窝网络中的分配问题。概率方法和容器方法），拓扑（细胞分解），代数几何学（多项式方法）和计算机科学（编码理论）。平面中的点线排列。组合物的组合集中在足够大的系统中的特定配置的外观。 Heilbronn的三角问题，可见的图和不可避免的交叉模式。该奖项反映了RY任务，并且使用Toundation的Intectual Intelectual Intical Invacter Impacter Implations Implaks Implaks Implactia审查标准。