当前位置:
X-MOL 学术
›
Comb. Probab. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Extremal problems for GCDs
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2021-04-08 , DOI: 10.1017/s0963548321000092 Ben Green , Aled Walker
Combinatorics, Probability and Computing ( IF 0.9 ) Pub Date : 2021-04-08 , DOI: 10.1017/s0963548321000092 Ben Green , Aled Walker
We prove that if $A \subseteq [X,\,2X]$ and $B \subseteq [Y,\,2Y]$ are sets of integers such that gcd (a, b ) ⩾ D for at least δ|A||B| pairs (a, b ) ε A × B then $|A||B|{ \ll _{\rm{\varepsilon }}}{\delta ^{ - 2 - \varepsilon }}XY/{D^2}$ . This is a new result even when δ = 1. The proof uses ideas of Koukoulopoulos and Maynard and some additional combinatorial arguments.
中文翻译:
GCD 的极端问题
我们证明如果$A \subseteq [X,\,2X]$ 和$B \subseteq [Y,\,2Y]$ 是整数集,使得 gcd (一,乙 ) ⩾D 至少 δ|A||B| 对 (一,乙 )ε A ×乙 然后$|A||B|{ \ll _{\rm{\varepsilon }}}{\delta ^{ - 2 - \varepsilon }}XY/{D^2}$ . 即使 δ = 1,这也是一个新结果。证明使用了 Koukoulopoulos 和 Maynard 的思想以及一些额外的组合论证。
更新日期:2021-04-08
中文翻译:
GCD 的极端问题
我们证明如果