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$.
Maximising the number of solutions to linear equations
Mathematical Institute of the Serbian Academy of Sciences and Arts(塞尔维亚科学与艺术学院数学研究所);Department of Mathematics, University of Kentucky(肯塔基大学数学系);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);Beijing Institute of Mathematical Sciences and Applications(北京国际数学研究中心);Department of Mathematics, Stanford University(斯坦福大学数学系)
Optimal Proximity Bound and Product Function Estimates in Integer Linear Programming
Cardiff University(卡迪夫大学);Brandenburg University of Technology Cottbus-Senftenberg(勃兰登堡工业大学科特布斯-森夫滕贝格分校);Friedrich-Alexander-Universität Erlangen–Nürnberg(埃尔朗根-纽伦堡弗里德里希·阿历山大大学)