2019
DOI: 10.48550/arxiv.1903.02592
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Quantitative bounds in the nonlinear Roth theorem

Abstract: We show that any subset of [N ] of density at least (log log N ) −2 −157 contains a nontrivial progression of the form x, x + y, x + y 2 . This is the first quantitatively effective version of the Bergelson-Leibman polynomial Szemerédi theorem for a progression involving polynomials of differing degrees. In the course of the proof, we also develop a quantitative version of a special case of a concatenation theorem of Tao and Ziegler, with polynomial bounds.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
46
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(46 citation statements)
references
References 18 publications
(45 reference statements)
0
46
0
Order By: Relevance
“…Moreover, in Corollary 1.3 we show that our main result has some far-reaching consequences related to equidistribution properties of general sequences on nilmanifolds. Our approach is to adapt and utilize in our ergodic theory setup, a technique developed by Peluse [35] and Peluse and Prendiville [37] (see also [39] for an exposition of the technique) and used in order to establish quantitative results for finitary variants of special cases of the polynomial Szemerédi theorem. Although the main ideas are elementary, they are a bit cumbersome to implement in full generality, so in order to facilitate reading, we first present our argument in the simpler case of the multiple ergodic averages…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, in Corollary 1.3 we show that our main result has some far-reaching consequences related to equidistribution properties of general sequences on nilmanifolds. Our approach is to adapt and utilize in our ergodic theory setup, a technique developed by Peluse [35] and Peluse and Prendiville [37] (see also [39] for an exposition of the technique) and used in order to establish quantitative results for finitary variants of special cases of the polynomial Szemerédi theorem. Although the main ideas are elementary, they are a bit cumbersome to implement in full generality, so in order to facilitate reading, we first present our argument in the simpler case of the multiple ergodic averages…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…It is a classical result of Furstenberg and Weiss that these averages converge in L 2 (µ), to the product of the integrals for totally ergodic systems, and that the rational Kronecker factor is a characteristic factor for the above averages. We present in Section 2 a proof of this result using the general principles of the argument used in [37], but also take advantage of various simplifications that our infinitary setup allows (the complete argument is only a few pages long). Subsequently, in Sections 3 and 4 we extend this method to give a proof of our main result, Theorem 1.1, which gives necessary and sufficient conditions for joint ergodicity.…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…Our argument depends upon a convenient criterion for joint ergodicity that was established recently in [7] (and was motivated by work in [23,24]). In order to state it we need to review the definition of the ergodic seminorms from [15].…”
Section: Proof Strategymentioning
confidence: 99%
“…It follows that in (24) when computing a i (h, (n + s/p(h)) 1/d ) we can replace n + s/p(h) with n in the non-linear monomials; this will lead to some error sequences that are 1-bounded for large enough N and can be handled by appealing to Lemma 3.6 (and redefining the sequence z N,h (n)). With this in mind, it follows that in (24) we can replace a i (h, (n + s/p(h))…”
Section: Seminorm Estimates -Sublinear Casementioning
confidence: 99%
“…Inspired by an argument of Peluse [24] and Peluse and Prendiville [25], Frantzikinakis shows in [17] that a family of sequences a 1 , . .…”
mentioning
confidence: 99%