arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2610.20554math.NT
收藏

大筛法不等式与平方和的加法分解

The large sieve inequality and additive decompositions of sums of squares

Christian Elsholtz, Julia Stadlmann

AI总结:

该研究基于大筛法证明了针对缺失素数模平方剩余类集合的新筛法估计,将其应用于Ostmann问题,得出平方和的非平凡和集分解需由大小相近的两个集合构成的结论。

摘要:

基于大筛法,我们针对缺失素数模平方各类剩余类的集合证明了新的筛法估计。对于某些有趣的剩余类构型,我们的界相较于对应的Johnsen-Selberg筛法不等式有显著改进。我们应用该筛法估计的动机源于Ostmann问题,研究平方和的加法分解,证明任何非平凡和集分解必须由两个大小大致相等的集合构成:若A₁、A₂⊆ℤ满足A₁+A₂={x²+y²:x,y∈ℤ}且|A₁|、|A₂|≥2,则对i∈{1,2}有√x/(log x)^(9/2)≪|A_i∩[1,x]|≪√x(log x)^4。

英文摘要:

Building on the large sieve, we prove a new sieve estimate for sets which are missing various residue classes modulo prime squares. For certain interesting residue class configurations, our bound is a significant improvement over the corresponding Johnsen-Selberg sieve inequality. Our application of this sieve estimate is motivated by Ostmann's problem. We study additive decompositions of sums of squares and show that any non-trivial sumset decomposition must consist of two sets of roughly equal size: If $A_1, A_2 \subseteq \mathbb{Z}$ with $A_1 + A_2 = \{x^2 + y^2 : x, y \in \mathbb{Z}\}$ and $|A_1|, |A_2| \geq 2$, then $\sqrt{x}/(\log x)^{9/2} \ll |A_i \cap [1, x]| \ll \sqrt{x}(\log x)^4$ for $i \in \{1, 2\}$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑