Some problems in Arithmetic Combinatorics and Graph Theory

算术组合学和图论中的一些问题

• 批准号: 0902241
• 负责人: Janos Komlos
• 金额: $ 48.12万
• 依托单位: Rutgers University New Brunswick
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-08-01 至 2013-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0902241&HistoricalAwards=false
• 关键词: Some; problems; Arithmetic; Combinatorics; Graph

ABSTRACTPrincipal Investigator: Komlos, Janos Co-Principal Investigator: Endre SzemerediProposal Number: DMS - 0902241Institution: Rutgers University New BrunswickTitle: Some problems in Arithmetic Combinatorics and Graph TheoryThe PIs propose to investigate the structure of sets of integers without long arithmetic progressions and to extend these questions to cosets of subspaces in finite fields. They also propose to find sharp estimates for the size of sum-sets in various sets and for sum-product estimates (both 2-fold and k-fold) for integers and prime fields, as well as to describe the structure of sum-free sets. The graph theory part of the proposal contains questions about triangle-free graphs, the Burr-Erdos Conjecture, and the Komlos-Sos Conjecture.The PIs propose to develop new tools to deal with some challenging and important classical problems of Discrete Mathematics. The PIs have extensive background and experience related to these questions, some of the advanced tools used today in Discrete Mathematics were originally developed by the PIs. The proposed topics in additive numbers theory and in graph theory are applicable in mathematics and the sciences, especially in Fourier analysis and in practical algorithms, in number theory, in geometry, in graph theory and combinatorics, and in designing and analysing efficient computer algorithms (complexity theory). The subject of Discrete Mathematics is the investigation of finite mathematical objects and their structures. Discrete Mathematics is a rapidly growing area of mathematics with many theoretical and practical applications. Arithmetic Combinatorics is a field investigating the interplay between Number Theory and Discrete Mathematics, using deep combinatorial and Fourier analytic methods to understand additive structures of sets of positive integers. Graph Theory is the study of networks, modelling connection patterns in various mathematical and applied settings.

主要研究者：Komlos，Janos 共同主要研究者：Endre Szemeredi提案编号：DMS -0902241研究机构：Rutgers University New Brunswick题目：Some problems in Arithmetic Combinatorics and Graph TheoryThe PI建议研究没有长算术级数的整数集合的结构，并将这些问题扩展到有限域中子空间的陪集。 他们还建议找到尖锐的估计大小的总和集在各种集和总和产品估计（2倍和k倍）的整数和素数领域，以及描述结构的总和自由集。 该提案的图论部分包含关于无三角形图，Burr-Erdos猜想和Komlos-Sos猜想的问题。PI建议开发新的工具来处理离散数学中一些具有挑战性和重要性的经典问题。 PI具有与这些问题相关的广泛背景和经验，今天在离散数学中使用的一些先进工具最初是由PI开发的。 在加法数论和图论中提出的主题适用于数学和科学，特别是傅立叶分析和实际算法，数论，几何，图论和组合学，以及设计和分析有效的计算机算法（复杂性理论）。 离散数学的主题是研究有限的数学对象及其结构。 离散数学是一个快速发展的数学领域，具有许多理论和实际应用。 算术组合学是一个研究数论和离散数学之间相互作用的领域，使用深度组合和傅立叶分析方法来理解正整数集合的加法结构。 图论是网络的研究，在各种数学和应用环境中建模连接模式。