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

A polylogarithmic bound in the nonlinear Roth theorem

Sarah Peluse, Sean Prendiville

英文摘要:

We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.

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

↑