筛的一个半定框架
A Semidefinite Framework for the Sieve
摘要:
我们描述了一个半定规划框架证明上界具体筛选问题,并表明,大筛可以被解释为这个框架的一个特例。通过一个小的调整,大筛也属于这个框架。我们将半定方法与线性规划方法(即,的组合筛和Selberg筛的一般框架),并表明它具有定性的优势,在玩具的情况下,素数是完全独立的。没有新的筛理论界限被证明。
英文摘要:
We describe a semidefinite programming framework for proving upper bounds on concrete sifting problems, and show that the Large Sieve can be interpreted as a special case of this framework. With a small tweak, the Larger Sieve also falls into this framework. We compare the semidefinite approach to the linear programming approach (i.e., the general framework of the combinatorial sieve and the Selberg sieve), and show that it has a qualitative advantage in a toy case where the primes are completely independent from each other. No new sieve-theoretic bounds are proved.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。