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

乘积集上等差数列的改进界

Improved bounds for arithmetic progressions in product sets

Dmitry Zhelezov

摘要:

令$B$是大小为$n$的自然数的集合。我们证明了乘积集$B.B = \{bb'| \, b, b' \in B\}$中最长等差数列的长度不可能大于$O(n \log n)$,它与文献[1]中给出的下界相匹配,直到一个乘法常数.对于复数的集合,我们改进了对任意$ε> 0$的$O_ε(n^{1 + ε})$的约束,假设GRH。

英文摘要:

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound provided in an earlier paper up to a multiplicative constant. For sets of complex numbers we improve the bound to $O_ε(n^{1 + ε})$ for arbitrary $ε> 0$ assuming the GRH.

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

↑