A polylogarithmic bound in the nonlinear Roth theorem
英文摘要:
We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。
We show that sets of integers lacking the configuration $x$, $x+y$, $x+y^2$ have at most polylogarithmic density.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。