课题基金 / 基金详情

FRG: Collaborative Research: Pseudorandomness in Ramsey Theory

FRG: Collaborative Research: Pseudorandomness in Ramsey Theory
FRG:协作研究:拉姆齐理论中的伪随机性
批准号:
1952767
负责人:
Dhruv Mubayi
金额:
$31.04万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2020
资助国家:
美国
项目状态:
已结题
起止时间:
2020-07-01 至 2024-06-30

项目摘要

项目成果

Dhruv Mubayi的其他基金

相似基金

相关文献

中文摘要
翻译
Ramsey理论是指数学中大量有深度的结果,它们有一个共同的主题:在大的组合结构中找到一致的子结构。它现在是现代组合学中最核心的领域之一。这个问题是由弗兰克·拉姆齐在1930年创立的,当时他正在研究逻辑系统的可判定性,他的基本结果现在被称为拉姆齐定理。 他的定理是重新发现于1935年由保罗鄂尔多斯和乔治Szekeres,而研究一个看似无关的几何问题。考虑到这些不同的起源,拉姆齐定理在其他数学领域,包括逻辑、几何、数论和理论计算机科学中有着广泛的应用也就不足为奇了。这个专注于研究小组的目标是获得经典拉姆齐数的新界。该小组将在该领域使用广泛的工具和技术,包括概率方法,步进引理和伪随机图理论。 最近,Mubayi和Verstraete基于Alon和Rodl的工作在Ramsey数和伪随机图之间建立了令人惊讶的联系,从而将该领域的重点从随机图转移到伪随机图。此外,最近在超图Ramsey数方面取得了重大进展,我们现在知道了许多这些数的塔增长率。 预计对这些问题的进一步研究也将产生新的方法和应用。最后,大量的学生和早期职业研究人员将得到培训和支持,研究产生的合作成果将在会议,研讨会和出版物中广泛传播。该奖项反映了NSF的法定使命,并通过使用基金会的知识价值和更广泛的影响审查标准进行评估,被认为值得支持。
英文摘要
Ramsey theory refers to a large body of deep results in mathematics which have a common theme: find uniform substructures in large combinatorial structures. It is now one of the most central areas in modern combinatorics. The subject was founded by Frank Ramsey in 1930 while studying the decidability of logical systems and his foundational result is now known as Ramsey’s theorem. His theorem was rediscovered in 1935 by Paul Erdos and George Szekeres while studying a seemingly unrelated geometric question. Given these diverse origins, it is not surprising that Ramsey’s theorem has had a wide range of applications in other areas of mathematics including logic, geometry, number theory, and theoretical computer science.The goal of this focused research group is to obtain new bounds for classical Ramsey numbers. The group will use a wide range of tools and techniques in the area including the probabilistic method, the stepping-up lemma, and the theory of pseudorandom graphs. Very recently, Mubayi and Verstraete established a surprising connection between the Ramsey numbers and pseudorandom graphs based on the work of Alon and Rodl, thus moving the emphasis of the field from random graphs to pseudorandom graphs. Moreover, substantial progress has recently been made on hypergraph Ramsey numbers, where we now know the tower growth rate for many of these numbers. It is expected that further work on these problems will lead to new methods and applications as well. Finally, a substantial number of students and early-career researchers will be trained and supported, and the collaborative results arising from the research will be disseminated widely at conferences, workshops and via publications.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.
期刊论文(2)
专著(0)
科研奖励(0)
会议论文
DOI: 10.1016/j.jctb.2020.12.004
发表时间: 2021
期刊: Series B
影响因子: --
作者: [Liu, Xizhi, Mubayi, Dhruv]
通讯作者: Mubayi, Dhruv
On Explicit Constructions of Designs
论设计的显式构造
DOI: 10.37236/10513
发表时间: 2022
期刊: The Electronic Journal of Combinatorics
影响因子: --
作者: [Liu, Xizhi, Mubayi, Dhruv]
通讯作者: Mubayi, Dhruv
Hypergraphs and Ramsey Theory
  • 批准号:
    2153576
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $38.0万
  • 财政年份:
    2022
  • 负责人:
    Dhruv Mubayi
  • 依托单位:
Extremal Questions for Hypergraphs
  • 批准号:
    1763317
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $32.0万
  • 财政年份:
    2018
  • 负责人:
    Dhruv Mubayi
  • 依托单位:
Extremal and Probabilistic Questions on Hypergraphs
  • 批准号:
    1300138
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $35.0万
  • 财政年份:
    2013
  • 负责人:
    Dhruv Mubayi
  • 依托单位:
Extremal and Probabilistic questions on hypergraphs
  • 批准号:
    0969092
  • 项目类别:
    Standard Grant
  • 资助金额:
    $20.0万
  • 财政年份:
    2010
  • 负责人:
    Dhruv Mubayi
  • 依托单位:
海外基金