Home > Research > Publications & Outputs > A polylogarithmic bound in the nonlinear Roth t...

Research

Associated organisational units

Electronic data

  • Polylog IMRN submission 2

    Rights statement: 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

    Accepted author manuscript, 343 KB, PDF document

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

A polylogarithmic bound in the nonlinear Roth theorem

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published
<mark>Journal publication date</mark>30/04/2022
<mark>Journal</mark>International Mathematics Research Notices
Volume8
Number of pages27
Pages (from-to)5658-5684
Publication StatusPublished
Early online date13/10/20
<mark>Original language</mark>English

Abstract

We show that sets of integers lacking the configuration x⁠, x+y⁠, x+y2 have at most polylogarithmic density.

Bibliographic note

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