New Bound for Roth’s Theorem
with Generalized Coefficients
Abstract
We prove the following conjecture of Shkredov and Solymosi: every subset such that contains the three vertices of an isosceles right triangle. To do this, we adapt the proof of the recent breakthrough by Bloom and Sisask on sets without three-term arithmetic progressions, to handle more general equations of the form in a finite abelian group , where the ’s are automorphisms of .
title = New Bound for Roth’s Theorem with Generalized Coefficients, author = Cédric Pilatte, plaintextauthor = Cedric Pilatte, keywords = Roth’s theorem, discrete Fourier analysis, Bohr sets, density increments, \dajEDITORdetailsyear=2022, number=16, received=9 November 2021, published=2 December 2022, doi=10.19086/da.55553,
[classification=text]
1 Introduction
In their 2020 breakthrough paper, Bloom and Sisask [4] improved the best known upper bound on the largest possible size of a subset of without three-term arithmetic progression. They showed that, if has no non-trivial three-term arithmetic progression, then
for some absolute constant . The best previously available bound was , which had been obtained in four different ways [7, 2, 3, 8].
Their result received a lot of attention as it settled the first interesting case of one of Erdős’ most famous conjectures. Erdős conjectured that, if is such that diverges, then contains infinitely many -term arithmetic progressions, for every . The result of Bloom and Sisask implies the case . The general case seems to be well beyond the reach of the current techniques.
The theorem of Bloom and Sisask can be applied to the prime numbers to recover a result of Green in analytic number theory. It is an old result of Van der Corput that the set of primes contains infinitely many three-term arithmetic progressions. Much more recently, Green [6] generalized this fact to relatively dense subsets of the primes. The theorem of Bloom and Sisask gives a different proof of this, where Chebyshev’s estimate is the only fact about the primes that is used.
A three-term arithmetic progression is a solution to the equation . In this paper, we generalize the proof of Bloom and Sisask to deal with equations of the form for an extended class of coefficients , and . More precisely, we prove the following in Section 5.
Theorem 1.1.
Let be a finite abelian group and let be automorphisms of such that . If is a subset of without non-trivial solutions111A solution is trivial if . to the equation
(1) |
then
where is an absolute constant.222In particular, the constant does not depend on or on the coefficients .
The result [4, Corollary 3.2] of Bloom and Sisask corresponds to the special case and of Theorem 1.1. Their hypothesis that has odd order ensures that is an automorphism.
Remark 1.2.
We will deduce the following corollary, which generalizes [4, Corollary 1.2] to higher dimensions and matrix coefficients. It is also a strengthening of [1, Theorem 2.21].
Corollary 1.3.
Let be nonsingular matrices with integer coefficients such that . If satisfies
then contains infinitely many non-trivial solutions to the equation .
Using Corollary 1.3, we are able to prove a conjecture of Shkredov and Solymosi [10, Conjecture 2].
Example 1.4.
If a subset of the square lattice satisfies , then there are infinitely many isosceles right triangles whose vertices are in .
We also obtain the following aesthetic result.
Example 1.5.
If a subset of the hexagonal lattice satisfies , then contains infinitely many equilateral triangles.
Examples 1.5 and 1.4 are special cases of the following corollary.
Corollary 1.6.
Let be a lattice of the form , such that for . Let be any triangle with vertices in . If is such that
then there are infinitely many triangles, with vertices in , which are directly similar333Two triangles are directly similar if there is an orientation-preserving similitude of the plane mapping one to the other. to .
Proof.
The orientation-preserving similitudes of the plane are exactly the transformations of the form with , . Let and be the (distinct) vertices of .
Finding triangles in that are directly similar to is equivalent to solving the system of equations
for , and . This system is equivalent to the single equation
to be solved for distinct .
Define , and to be the matrices corresponding to multiplication by , and in the -basis of . These matrices sum to zero, are nonsingular as the ’s are distinct, and have integer coefficients since for all . We conclude by Corollary 1.3. ∎
Remark 1.7.
It is believed that Example 1.4 can be extended significantly: a conjecture of Graham states that, if is such that , then contains infinitely many axes-parallel squares [5, Conjecture 8.4.6]. The difficulty of Graham’s conjecture is comparable to that of Erdős’ conjecture on arithmetic progressions of length .
Overview of the paper. In Section 2, we will show how Corollary 1.3 follows from Theorem 1.1. The rest of the paper will be devoted to the proof of Theorem 1.1.
Our proof is an adaptation of the work of Bloom and Sisask on three-term arithmetic progressions [4]. We will use the same notation as in their paper. We will recall some of it in Section 3, where we also restate some classical lemmas that will be used throughout the proof. The more technical definitions, such as those of additively non-smoothing sets or of additive frameworks, can be found in [4].
The structure of the proof of Theorem 1.1 is shown in Fig. 1. Section 4 is dedicated to the proof of Proposition 4.4, a result which by itself is sufficient to prove a weaker version of Theorem 1.1, with the bound instead. The proof of Proposition 4.4 is similar to that of Theorem 1.1, but is considerably simpler. It uses a density increment lemma from [1].
In Section 5, we prove Theorem 1.1 by adapting the work of Bloom and Sisask [4] to our more general setting. Fortunately, large portions of their paper can be used as a black box, without any modification. This is especially the case for [4, Sections 9 and 10] (structure theorem for additively non-smoothing sets), as well as [4, Section 11] (spectral boosting). We will mostly need to adapt some results from [4, Sections 5, 8 and 12].
Comparison with the Bloom-Sisask proof. We strongly recommend the readers to familiarize themselves with the article of Bloom and Sisask before reading Sections 3, 4 and 5 of this paper. We have attempted to make as few changes to their proof as possible, to make the comparison easier for the reader.
The proof of Bloom and Sisask can be immediately generalised to equations as in Theorem 1.1 for automorphisms that are multiples of the identity. If and is a Bohr set, then the dilate is a subset of both and , provided that (see Section 3 for the relevant definitions). This very useful property no longer holds for general automorphisms.
Instead of considering a simple dilate , we will need to work with the intersection . The dilate of a Bohr set is another Bohr set of the same rank. By contrast, is still a Bohr set, but the rank may have doubled! Controlling the rank of these repeated intersections is the main additional difficulty. To overcome it, we need to keep track more explicitly of the frequency sets of all the Bohr sets in the proof.
Carefully tracking the dependence on the coefficients allows us to show that the rank of the successive Bohr sets in the density increment iteration grows polynomially. To obtain this, we also need to assume that the automorphisms commute (see Remark 3.4 for more details). Since three-term equations always reduce to the case of commuting automorphisms (see Remark 4.1), there is no commutativity assumption in Theorem 1.1.
Theorem 1.1 gives a bound to subsets of without solutions to for integers comprime to with . It is important to note that this bound is uniform in . Such uniformity would not have been obtained through a ‘naive’ modification of the Bloom-Sisask proof using dilates as above.
Remark 1.8.
Theorem 1.1 can be generalized to equations with more than three terms. More precisely, a slight adaptation of the proof shows the following. If are commuting automorphisms of an abelian group such that , then any set without non-trivial solutions to satisfies
where is an absolute constant. Corollary 1.3 can also be modified in a similar way. However, for , considerably better bounds are available using other methods (see [9]), which is why we restrict ourselves to the case .
2 Application to Matrix Coefficients
In this section, we show how Corollary 1.3 follows from Theorem 1.1. The proof is standard and involves two steps: first truncating the set , then embedding this truncation of inside a finite abelian group.
Proof of Corollary 1.3.
Let be a subset of containing only finitely many non-trivial solutions to the equation
(2) |
We want to prove that
(3) |
After removing a finite number of elements from , we can assume that has no non-trivial solution to Eq. 2.
For , let be the truncated set
It is sufficient to prove that, for all ,
(4) |
where is the constant from Theorem 1.1.444In this proof, the implied constants in the asymptotic notation and depend only on the dimension and the matrices . Indeed, we have
and by partial summation, together with Eq. 4, we get
Taking proves Eq. 3.
Let . Let
where is the operator norm of the matrix , viewed as a map . Let be a prime number between and , which exists by Bertrand’s postulate.
We embed in the abelian group . Let , and be the reductions of and modulo . Clearly, each is invertible as its determinant is not divisible by .
We claim that the map
given by reduction modulo is surjective. Indeed, if is such that
then in since we also have
It follows that only has trivial solutions to the equation . By Theorem 1.1, we obtain
which proves Eq. 4 and concludes the proof of Corollary 1.3. ∎
3 Notation and New Density Increments
We use the same notation as in the paper of Bloom and Sisask [4]. We recall some of it below, but we encourage the readers to familiarize themselves with their article before reading the rest of this paper.
Notation 3.1.
Fix a finite abelian group . If , the relative density of in is the ratio . If , the density of in is denoted by . We write for the normalized indicator function .
For , we use the normalizations
while for , we set
In order to suppress logarithmic factors, we use the notation or to mean that for some constants .
Notation 3.2 (Bohr sets).
For and , we define the Bohr set to be the subset of defined by
The set is called the frequency set of and its width function. The rank of , denoted by , is defined to be the size of . Note that all Bohr sets are symmetric.
When we speak of a Bohr set, we implicitly refer to the triple , since the Bohr set alone does not uniquely determine the frequency set nor the width.
The intersection of two Bohr sets is again a Bohr set. If and , we denote by the dilate of , i.e. the Bohr set given by .
A Bohr set of rank is regular if for all , we have
An important property is that, for every Bohr set , there is a dilate , for some , which is regular (see [4, Lemma 4.3]).
If is a Bohr set and is an automorphism, then is a Bohr set and . If is regular, then so too is .
The sizes of Bohr sets can be controlled using the classical lemma [4, Lemma 4.4]. We restate it below as it will be used extensively throughout the article.
Lemma 3.3.
Let and be such that for . We have
In particular, if and is a Bohr set of rank , then .
Remark 3.4.
One of the main difficulties that arise when working with general automorphisms is that we often have to control intersections of Bohr sets such as . If the Bohr set has frequency set , then can be viewed as a Bohr set with frequency set . If we don’t know anything about the frequency set of , then the best we can say about the rank of is that
Suppose that is a Bohr set of rank and define, for , . Using the above bound would give an exponential growth for the ranks of these Bohr sets. Such a naive bound would be completely insufficient to prove Theorem 1.1. However, we can note that
where is the set of all compositions of automorphisms from the set . If we know , and commute, then has polynomial growth and we can obtain an acceptable bound for the rank of , namely
In the density increment argument, we will need to be more explicit with the definitions of the Bohr sets, in order to carefully keep track of their ranks and frequency sets.
In the light of Remark 3.4, to make the proof of Bloom and Sisask work for general coefficients, we need to change the definition of density increments ([4, Definition 5.1]).
Definition 3.5 (Increments).
Let be a regular Bohr set, and let be a regular Bohr set of rank . We say that of relative density has a density increment of strength relative to if there is a regular Bohr set of the form
such that
where is a Bohr set of rank , , and satisfy the inequality
(5) |
Remark 3.6.
If has a density increment of strength with respect to in the sense of Definition 3.5, then has a density increment of the same strength with respect to in the sense of [4, Definition 5.1]. This is because Eq. 5 implies the bound
(6) |
by a direct application of Lemma 3.3.
The converse is not true in general, but it is true for all the density increments present in [4]. That is, every density increment in [4] is also a density increment in the sense of Definition 3.5, of the same strength. The reason is that
- 1.
- 2.
We restate here [4, Lemma 5.2], which is an easy consequence of the definition of density increment.
Lemma 3.7.
Let be a regular Bohr set and be a regular Bohr set of rank . Let . If has a density increment of strength relative to , then has a density increment of strength relative to .
Finally, we reproduce the statement of [4, Lemma 12.1] for three smaller Bohr sets instead of two. The proof of Lemma 3.8 is the same as that of [4, Lemma 12.1], so we shall not repeat it here.
Lemma 3.8.
There is a constant such that the following holds. Let be a regular Bohr set of rank , let have relative density , let and suppose that where . Then either
-
1.
( has almost full density on , and ) there is an such that
for , or
-
2.
(density increment) has an increment of strength relative to one of the ’s.
4 Proof of a Weaker Bound
In this section, we prove Proposition 4.4, which can be regarded as a weaker version of Theorem 1.1. On its own, Proposition 4.4 is sufficient to prove the bound
keeping the notation of Theorem 1.1. We will use Proposition 4.4 at the end of the proof of Theorem 1.1 when, after a series of density increments, we arrive at a subset of a Bohr set whose relative density is substantially larger than the original density .
Remark 4.1.
It suffices to prove Theorem 1.1 when the first automorphism is the identity, something which we will assume from this point onward. To deduce the case of a general automorphism , simply apply Theorem 1.1 to the set and the automorphisms .
From now on, fix two automorphisms , of such that . We count the number of solutions to the equation via the inner product
defined for . Observe that
We will obtain Proposition 4.4 by repeated applications of the following lemma, which is a restatement of [1, Corollary 3.7] in the language of regular Bohr sets.
Lemma 4.2.
There is a constant such that the following holds. Let . Let be a regular Bohr set of rank and a regular Bohr set of rank such that , where . Suppose that , and , each time with relative density at least . Then
-
1.
either
-
2.
or there is a regular Bohr set such that , where
-
•
is either or ,
-
•
and is of the form
for some and some with and on , where .
-
•
Proof.
This follows directly from [1, Corollary 3.7], applied to the sets , and . Note that, since is a regular Bohr set,
so that is -sheltered by , provided that is sufficiently small (see [1] for the definition of ‘sheltered’ in this context). We see in a similar way that has the required amount of shelter. Finally, if and , say with , we have
as required. ∎
Proposition 4.3.
Let be a regular Bohr set of rank , and let of relative density . Let . Then, either
or has a density increment of strength
with respect to either , or .
Proof.
Let , where is the constant of Lemma 4.2. We apply Lemma 3.8 with , , , where and , with being two small constants, chosen in particular such that , and are regular.
If the second case of Lemma 3.8 holds, then has a density increment of strength relative to one of the ’s. By Lemma 3.7, this implies that has a density increment of strength relative to , or .
We may thus suppose that the first case of Lemma 3.8 holds. That is, there is some such that, if we let
then each has relative density at least in the corresponding . We now use Lemma 4.2 with and .
-
1.
In the first case, we get
where the last inequality follows from Lemma 3.3. Since the ’s are subsets of the same translate of and the equation is translation-invariant, we have
which gives the claimed bound.
-
2.
In the second case, there is a regular Bohr set as in the statement of the lemma such that
(7) where is either or . We therefore deduce that has a density increment of strength relative to or . By Lemma 3.7, this means that has a density increment of the same strength relative to or .∎
We now iteratively apply Proposition 4.3 to obtain Proposition 4.4, which plays the same role as [4, Theorem 5.4] in the proof of Bloom and Sisask.
Proposition 4.4.
Let be a regular Bohr set of rank and suppose that has density . Then
Proof.
Let be the constant in the density increment case of Proposition 4.3 ( is fixed as is given). Recall that is short for , which is a decreasing function of . Thus, if we use Proposition 4.3 with some pair having relative density and the second case applies, we will have a density increment of strength .
We inductively construct two sequences and , where, for each , is a subset of with relative density . Let and . Assume that and have been constructed for . We use Proposition 4.3 with and . If the first case of the proposition holds, we stop the construction. Otherwise, we are in the density increment case and there are sets such that
-
•
is a subset of a translate of ;
-
•
is a subset of of relative density ;
-
•
is a regular Bohr set of the form
(8) where
-
–
is the Bohr set
(9) whose rank we denote by ,
-
–
is either , or ,
-
–
, where and
(10)
-
–
Note that, since , this construction must terminate in steps. We then arrive at , for which
(11) |
where is the rank of and, as usual, .
Let be the set of all automorphisms obtained by composing elements of . Since , these automorphisms commute, which implies that .
An immediate induction using Eqs. 8 and 9 shows that
(12) |
for . The same reasoning shows that the frequency set of is contained in
This shows that
In particular, Eq. 10 becomes
(13) |
for .
We now use Lemma 3.3 to give a lower bound for . By Eq. 12, we have
Using Eq. 13 and the simple inequalities and for and , this yields
Together with Eq. 11, this concludes the proof of Proposition 4.4. ∎
5 Proof of the Main Theorem
This section is dedicated to the proof of Theorem 1.1. Each statement in this section is an adaptation of a corresponding statement in [4]. To help the reader, we will highlight the changes made to the original statements of [4] in blue.
We start by proving an analogue of [4, Lemma 8.2] in our setting. When , the notation stands for the balanced function .
Lemma 5.1.
There is a constant such that the following holds. Let . Let be a regular Bohr set of rank , and another regular Bohr set such that , with . Let , and , each time with relative density in . Then either
-
1.
(many solutions) , or
-
2.
(large mass on a spectrum) there is some such that
where is either or .
Proof.
We have
Replacing and with their balanced functions and , we have
where
We can estimate using regularity. Since , we have by [4, Lemma 4.5]. Moreover, . Therefore
In particular, , provided is small enough. Thus
If the first case of the conclusion doesn’t hold, then
By Parseval’s identity, followed by the triangle inequality, we deduce that
Using , we find that
where is either or . Since , we can discard the terms of the above sum with to obtain
By the dyadic pigeonhole principle, we conclude that there is some such that
This concludes the proof since on the set . ∎
Next, we modify the statement of [4, Proposition 8.1] as follows.
Proposition 5.2.
There is a constant such that the following holds. Let be some parameters.
Let . Let be a regular Bohr set of rank , and another regular Bohr set, of rank at most , such that , where . Let , and , each time with relative density in . Then for either or , one of the following holds
-
1.
(large density) , or
-
2.
(many solutions) , or
-
3.
has a density increment of strength either
-
(a)
(small increment) or
-
(b)
(large increment)
relative to , or
-
(a)
-
4.
(non-smoothing large spectrum) there is a set and three quantities satisfying
such that
-
(a)
,
-
(b)
there exists an additive framework of height and tolerance between
-
(c)
is -robustly -additively non-smoothing relative to for some and , and
-
(d)
if we let then for all
and
-
(e)
-
(a)
Few changes have to be made to the proof of [4, Proposition 8.1], so we only give an overview of the modified proof.
Proof sketch.
We keep the notation and for some that are the same as those in the original proof.
Suppose first that this is true for some . In this case we apply [4, Corollary 7.11] with instead of , with in place of , the function chosen to be and and the weight function given by , restricted to . We apply [4, Lemma 7.8] and [4, Lemma 5.7] in the same way as in the original proof, except that we obtain a small density increment for relative to instead of .
The case is similar. After using [4, Corollary 7.12], [4, Lemma 7.8] and [4, Lemma 5.7], we conclude that has a large increment relative to .
Finally, in the case , we have
where for some absolute constant . We use [4, Lemma 6.2] to construct an additive framework between and . Next, we use [4, Lemma 8.5] with being replaced by , being replaced by , being replaced by and being replaced by . This either gives a density increment for with respect to , or else produces a set satisfying most of the conditions of the final case of Proposition 5.2. The rest of the proof is the same, after replacing every occurrence of by and every occurrence of by . ∎
Proposition 5.3 is the adaptation of [4, Proposition 5.5] to general coefficients.
Proposition 5.3.
There is a constant such that, for all , the following holds. Let be a regular Bohr set of rank and suppose that has density . Let . Either
-
1.
,
-
2.
or
-
3.
has a density increment of one of the following strengths relative to , or :
-
(a)
(small increment) , or
-
(b)
(large increment) ,
where .
-
(a)
Proof.
Let , for some small constant and some large constant . We apply Lemma 3.8 with
where and ( and being small constants, chosen in particular such that and are regular.555Note that the regularity of follows immediately from that of . If we are in the second case of Lemma 3.8, then has a small increment with respect to , or . By Lemma 3.7, this translates into a density increment of the same strength with respect to , or , as required.
Let us assume henceforth that we are in the first case of Lemma 3.8. Let
If is the density of relative to , for , then Lemma 3.8 ensures that
We now apply Proposition 5.2 with , , and , for some suitable constants .
-
1.
In the first case of the conclusion of Proposition 5.2, .
-
2.
In the second case,
by Lemma 3.3. Since the ’s are subsets of the same translate of and the equation is translation-invariant, we have and we are done.
-
3.
In the third case, either or has a density increment of strength
with respect to . Note that , or else we have the first case of the conclusion. Therefore, has a density increment of strength
relative to either or (here we use the fact that is sufficiently small, similarly as in Eq. 7). By Lemma 3.7, this implies that has an increment of the same strength relative to or .
-
4.
Finally, suppose that the last case of the conclusion of Proposition 5.2 holds. Then we may apply [4, Proposition 11.8] with , and . The hypotheses of [4, Proposition 11.8] exactly match the last case of Proposition 5.2 for some .
The number in [4, Proposition 11.8] satisfies , or else and we are in the first case of our conclusion. Taking large enough in the statement of Proposition 5.3, we see that the first case of [4, Proposition 11.8] cannot hold. In the other two cases, either or has a density increment of strength
with respect to . As in the previous case, we conclude that has a density increment of the same strength with respect to or .∎
We are now ready to prove Theorem 1.1. The strategy is to iterate Proposition 5.3 as long as we are in the small increment case, and then apply Proposition 4.4 when one of the other cases applies.
Proof of Theorem 1.1.
Let of density . In this proof, will always denote the density of this initial .
Let be some absolute constant, chosen in particular larger than the implied constants in the exponents of the small increment case of Proposition 5.3. Let be some constant large enough such that Proposition 5.3 holds and such that . Let be some fixed quantity (depending only on ), chosen in particular larger than the implicit constants of Proposition 5.3 hidden in the , and notation. By definition of , these implicit constants are still bounded by if we use Proposition 5.3 with some different relative density , as long as . Note that we may assume that , or else we are done by an application of Proposition 4.4 with .
Iterative construction. We inductively construct two sequences and , where, for each , is a subset of relative density . Let and . Assume that and have been constructed for . We use Proposition 5.3 with and . If we are not in case (3)(a), then we stop the construction of the sequences. Otherwise, case (3)(a) occurs, and we have a small increment for . Hence, there are sets such that
-
•
is a subset of a translate of ;
-
•
is a subset of of relative density ;
-
•
is a regular Bohr set of the form
(14) where
-
–
is the Bohr set
(15) whose rank we denote by ,
-
–
is either , or ,
-
–
, where and
(16)
-
–
Analysis of the algorithm. Note that, since , this construction must terminate in
steps. We then arrive at for which one of the cases (1), (2) and (3)(b) of Proposition 5.3 applies.
Let be the set of all automorphisms obtained by composing elements of . Since , these automorphisms commute, which implies that .
An immediate induction using Eqs. 14 and 15 shows that
(17) |
for . Similarly, we see that the frequency set of is contained in
This implies that
In particular, Eq. 16 becomes
(18) |
for .
We now use Lemma 3.3 to give a lower bound for . By Eq. 17, we have
Using Eq. 18 and the fact that for , this yields
(19) |
If , this reasoning actually shows the more precise bound
(20) |
Concluding the proof. We now apply Proposition 5.3 to and . The small increment case cannot occur, by construction of the sequences and .
-
•
If we are in the case (1) of Proposition 5.3, then . In this case we apply Proposition 4.4 and obtain the bound
where . Using Eq. 20, we deduce that
- •
-
•
Finally, in the large increment case, there are some , and such that and, if
then and
(21) Write . Then
by Eqs. 21 and 20. We now apply Proposition 4.4 to a suitable subset of a translate of and the Bohr set to find that
Therefore, we obtain, in all three cases, the lower bound
Choosing , say, we obtain
On the other hand, since contains only trivial solutions to , we have
Therefore, , which can be rewritten as
where . This finishes the proof of Theorem 1.1. ∎
Acknowledgments
I am deeply grateful to Thomas Bloom and Olof Sisask for bringing this problem to my attention and for the many fruitful conversations. I would also like to thank Timothy Gowers for his guidance and the very helpful discussions throughout my research internship for the École Normale Supérieure.
References
- [1] Thomas F. Bloom, Quantitative results in arithmetic combinatorics, Ph.D. thesis, University of Bristol, 2014.
- [2] , A quantitative improvement for Roth’s theorem on arithmetic progressions, Journal of the London Mathematical Society 93 (2016), no. 3, 643–663.
- [3] Thomas F. Bloom and Olof Sisask, Logarithmic bounds for Roth’s theorem via almost-periodicity, Discrete Analysis (2019), Paper No. 4, 20.
- [4] , Breaking the logarithmic barrier in Roth’s theorem on arithmetic progressions, arXiv preprint 2007.03528v2 (v1:2020, v2:2021).
- [5] Ronald L. Graham, Euclidean Ramsey theory, Handbook of discrete and computational geometry (Jacob E. Goodman and Joseph O’Rourke, eds.), CRC Press, Boca Raton, New York, 1997, pp. 164–177.
- [6] Ben Green, Roth’s theorem in the primes, Annals of mathematics 161 (2005), no. 3, 1609–1636.
- [7] Tom Sanders, On Roth’s theorem on progressions, Annals of Mathematics 174 (2011), no. 1, 619–636.
- [8] Tomasz Schoen, Improved bound in Roth’s theorem on arithmetic progressions, Advances in Mathematics 386 (2021), 107801.
- [9] Tomasz Schoen and Olof Sisask, Roth’s theorem for four variables and additive structures in sums of sparse sets, Forum of Mathematics. Sigma 4 (2016), e5, 28.
- [10] Ilya Shkredov and Jozsef Solymosi, Tilted corners in integer grids, INTEGERS Journal, Ron Graham Memorial Volume 21A (2021), A20.
[pgom]
Cédric Pilatte
École Normale Supérieure
Paris, France
cedric.pilatte\imageatens\imagedotfr