arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0209137math.NTmath.CO
收藏

On Thin Sets of Primes Expressible as Sumsets

Ernie Croot, Christian Elsholtz

英文摘要:

Suppose that P is an infinite set of primes such that P = A + B + C, where A,B,C are sets with at least two elements. We show that if P(x) > c x/log^d x (where P(x) = the number of elements of P that are <= x), and if A,B,C is a "regular" triple of sets, then either |A+B| <= d, or |B+C| <= d, or |A+C| <= d.

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

↑