Sieves and primes

筛子和素数

• 批准号: 2301264
• 负责人: Kevin Ford
• 金额: $ 37.29万
• 依托单位: University of Illinois at Urbana-Champaign
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2023
• 资助国家: 美国
• 起止时间: 2023-06-01 至 2026-05-31
• 项目状态: 未结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=2301264&HistoricalAwards=false
• 关键词: Sieves; primes

Questions about properties of the positive integers have fascinated people for thousands of years and have recently found applications in computer science, information security and signal processing. In this field, known as number theory, the prime numbers play a central role. Fundamental questions revolve around patterns in the primes, gaps between primes, and how primes of special types are distributed. Since the early 20th century, sieve methods have been one of the chief tools we have for analyzing these problems, but the limitations of these methods are poorly understood, and discovering the limitations is a major open problem in the field. This award will enable the PI to continue his work understanding and exploring sieve methods and the distribution of primes. Success in this endeavor will help unlock many of the mysteries of prime numbers and have a significant impact on many areas of mathematics and information theory. Grant funds will also be used to train and mentor graduate students working in number theory. The PI will develop new methods of probing the limitations of sieve methods for detecting primes in a general sequence of integers. The emphasis will be on developing a new, unified theory of sieves that allows one to say if the main hypotheses on the sequence, known as Type-I bounds and Type-II bounds, are sufficient to show that the sequence contains many primes. The strength of these hypotheses are governed by three parameters. In particular, we will prove, for the first time, that in a certain range of these parameters, there are sequences which satisfy the Type-I and Type-II bounds yet contain no primes. The primary goal is to determine precisely in which range of the parameters the main hypotheses imply that the sequence always contains many primes. We will also investigate in finer detail the problem of counting primes in short intervals. The PI will also continue his investigations into further understanding the concentration of divisors of integers. The primary goal is to determine precisely the measure of the concentration function of divisors of typical integers.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.

关于正整数性质的问题几千年来一直吸引着人们，最近在计算机科学、信息安全和信号处理中得到了应用。在这个被称为数论的领域中，素数起着核心作用。基本问题围绕素数中的模式、素数之间的间隙以及特殊类型的素数是如何分布的。自20世纪初以来，筛分方法一直是我们分析这些问题的主要工具之一，但这些方法的局限性鲜为人知，发现这些局限性是该领域的一个主要开放问题。这一奖项将使PI能够继续他的工作，了解和探索筛分方法和素数的分配。这一努力的成功将有助于解开质数的许多奥秘，并对数学和信息论的许多领域产生重大影响。助学金还将用于培训和指导从事数论工作的研究生。PI将开发新的方法来探索筛法在一般整数序列中检测素数的局限性。重点将是发展一种新的、统一的筛子理论，该理论允许人们说出关于该序列的主要假设，即所谓的I型界限和II型界限，是否足以表明该序列包含许多素数。这些假设的强弱取决于三个参数。特别地，我们将第一次证明，在这些参数的某个范围内，存在满足类型I和类型II边界但不包含素数的序列。其主要目标是精确地确定主要假设所暗示的参数范围内的序列总是包含许多素数。我们还将更详细地研究在短间隔内计数素数的问题。PI还将继续他的调查，以进一步了解整数的除数的集中度。主要目标是准确地确定典型整数的除数的集中度函数的度量。该奖项反映了NSF的法定使命，并通过使用基金会的智力优势和更广泛的影响审查标准进行评估，被认为值得支持。

项目成果

Equal sums in random sets and the concentration of divisors

随机集合中的等和以及除数的集中

• DOI: 10.1007/s00222-022-01177-y
• 发表时间: 2023
• 期刊: Inventiones mathematicae
• 影响因子: 3.1
• 作者: Ford, Kevin;Green, Ben;Koukoulopoulos, Dimitris
• 通讯作者: Koukoulopoulos, Dimitris

Large prime gaps and probabilistic models

大素数间隙和概率模型

• DOI: 10.1007/s00222-023-01199-0
• 发表时间: 2023
• 期刊: Inventiones mathematicae
• 影响因子: 3.1
• 作者: Banks, William;Ford, Kevin;Tao, Terence
• 通讯作者: Tao, Terence