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

Standard

A polylogarithmic bound in the nonlinear Roth theorem. / Peluse, Sarah; Prendiville, Sean.
In: International Mathematics Research Notices, Vol. 8, 30.04.2022, p. 5658-5684.

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

Harvard

Peluse, S & Prendiville, S 2022, 'A polylogarithmic bound in the nonlinear Roth theorem', International Mathematics Research Notices, vol. 8, pp. 5658-5684. https://doi.org/10.1093/imrn/rnaa261

APA

Peluse, S., & Prendiville, S. (2022). A polylogarithmic bound in the nonlinear Roth theorem. International Mathematics Research Notices, 8, 5658-5684. https://doi.org/10.1093/imrn/rnaa261

Vancouver

Peluse S, Prendiville S. A polylogarithmic bound in the nonlinear Roth theorem. International Mathematics Research Notices. 2022 Apr 30;8:5658-5684. Epub 2020 Oct 13. doi: 10.1093/imrn/rnaa261

Author

Peluse, Sarah ; Prendiville, Sean. / A polylogarithmic bound in the nonlinear Roth theorem. In: International Mathematics Research Notices. 2022 ; Vol. 8. pp. 5658-5684.

Bibtex

@article{5d8c4252ce954684bceccb6214d06c1b,
title = "A polylogarithmic bound in the nonlinear Roth theorem",
abstract = "We show that sets of integers lacking the configuration x⁠, x+y⁠, x+y2 have at most polylogarithmic density.",
author = "Sarah Peluse and Sean Prendiville",
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",
year = "2022",
month = apr,
day = "30",
doi = "10.1093/imrn/rnaa261",
language = "English",
volume = "8",
pages = "5658--5684",
journal = "International Mathematics Research Notices",
issn = "1073-7928",
publisher = "Oxford University Press",

}

RIS

TY - JOUR

T1 - A polylogarithmic bound in the nonlinear Roth theorem

AU - Peluse, Sarah

AU - Prendiville, Sean

N1 - 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

PY - 2022/4/30

Y1 - 2022/4/30

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

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

U2 - 10.1093/imrn/rnaa261

DO - 10.1093/imrn/rnaa261

M3 - Journal article

VL - 8

SP - 5658

EP - 5684

JO - International Mathematics Research Notices

JF - International Mathematics Research Notices

SN - 1073-7928

ER -