arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1801.07135math.COmath.NT
收藏

整数集合中线性方程的最大解数

Maximising the number of solutions to a linear equation in a set of integers

James Aaronson

摘要:

给定一个线性方程的形式$a_1x_1 + a_2x_2 + a_3x_3 = 0$与整数系数$a_i$,我们感兴趣的是最大化的解决方案,这个方程在一个集$S \subseteq \mathbb{Z}$,为集$S$的给定大小。我们证明,对于任何选择的常数$a_1, a_2$和$a_3$,最大的解决方案的数量至少是$\left(\frac{1}{12} + o(1)\right)|S|^2$。此外,我们表明,这是最佳的,在以下意义。对于任何$\varepsilon > 0,$,都有$a_1, a_2$和$a_3,$的选择,对于它们,任何大的整数集合$S$最多有$\left(\frac{1}{12} + \varepsilon\right)|S|^2$解。对于$k \geq 3$变量的方程,我们也给出了类似的结果。集合$σ_k = \int_{-\infty}^{\infty} (\frac{\sin πx}{πx})^k dx.$然后,对于常数$a_1, \dots, a_k$的任何选择,存在集合$S$,其至少具有$a_1x_1 + \dots + a_kx_k = 0$的$(\frac{σ_k}{k^{k-1}} + o(1))|S|^{k-1}$解。此外,存在系数$a_1, \dots, a_k$的选择,对于任何大集合$S$,对于任何$\varepsilon > 0$,必须具有不超过$(\frac{σ_k}{k^{k-1}} + \varepsilon)|S|^{k-1}$的解。

英文摘要:

Given a linear equation of the form $a_1x_1 + a_2x_2 + a_3x_3 = 0$ with integer coefficients $a_i$, we are interested in maximising the number of solutions to this equation in a set $S \subseteq \mathbb{Z}$, for sets $S$ of a given size. We prove that, for any choice of constants $a_1, a_2$ and $a_3$, the maximum number of solutions is at least $\left(\frac{1}{12} + o(1)\right)|S|^2$. Furthermore, we show that this is optimal, in the following sense. For any $\varepsilon > 0,$ there are choices of $a_1, a_2$ and $a_3,$ for which any large set $S$ of integers has at most $\left(\frac{1}{12} + \varepsilon\right)|S|^2$ solutions. For equations in $k \geq 3$ variables, we also show an analogous result. Set $σ_k = \int_{-\infty}^{\infty} (\frac{\sin πx}{πx})^k dx.$ Then, for any choice of constants $a_1, \dots, a_k$, there are sets $S$ with at least $(\frac{σ_k}{k^{k-1}} + o(1))|S|^{k-1}$ solutions to $a_1x_1 + \dots + a_kx_k = 0$. Moreover, there are choices of coefficients $a_1, \dots, a_k$ for which any large set $S$ must have no more than $(\frac{σ_k}{k^{k-1}} + \varepsilon)|S|^{k-1}$ solutions, for any $\varepsilon > 0$.

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

↑