Peluse, Sarah and Prendiville, Sean (2022) A polylogarithmic bound in the nonlinear Roth theorem. International Mathematics Research Notices, 8. pp. 5658-5684. ISSN 1073-7928
![[thumbnail of Polylog IMRN submission 2]](https://eprints.lancs.ac.uk/style/images/fileicons/text.png)
Text (Polylog IMRN submission 2)
Polylog_IMRN_submission_2.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.
Download (351kB)
Polylog_IMRN_submission_2.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.
Download (351kB)
Official URL: https://doi.org/10.1093/imrn/rnaa261
Abstract
We show that sets of integers lacking the configuration x, x+y, x+y2 have at most polylogarithmic density.
Item Type:
Journal Article
Journal or Publication Title:
International Mathematics Research Notices
Additional Information:
This is a pre-copy-editing, author-produced PDF of an article accepted for publication in British Journal for the Philosophy of Science following peer review. The definitive publisher-authenticated version Sarah Peluse, Sean Prendiville, A Polylogarithmic Bound in the Nonlinear Roth Theorem, International Mathematics Research Notices 2022 8: 5658-5684 is available online at: https://academic.oup.com/imrn/article/2022/8/5658/5921322
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600
Subjects:
?? MATHEMATICS(ALL) ??
Departments:
ID Code:
147623
Deposited By:
Deposited On:
24 Sep 2020 13:40
Refereed?:
Yes
Published?:
Published
Last Modified:
19 Sep 2023 02:30