A Structural Theorem for Sets With Few Triangles

We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains $\Omega(|P|^\sigma)$ points of $P$. Further, a positive proportion of $P$ is covered by lines parallel to $l$ each containing $\Omega(|P|^\sigma)$ points of $P$. (2) There is a circle $\gamma$ which contains a positive proportion of $P$. This provides evidence for two conjectures of Erd\H{o}s. We use the result of Petridis-Roche-Newton-Rudnev-Warren on the structure of the affine group combined with classical results from additive combinatorics.


Introduction
Let P be a finite point set in R 2 .Erdős' famous distance conjecture [10] asks what the minimum number of distinct distances such a set can describe.This has lead to many beautiful techniques over 64 years culminating in the 2010 solution of Guth and Katz [14].
Erdős also posed much harder problems attempting to understand the structure of sets that determine few distinct distances.To provide context for these, suppose we have a square √ N × √ N lattice.A classical result of Landau [18] on the growth of sums of squares shows that such a lattice gives Θ(N/ √ log N ) distinct distances.One can find other lattices that give the same number of distances, but there are no known constructions which give fewer distances.We call a point set P that has c|P |/ log |P | distances a near-optimal point set.Erdős' conjectures [8] concern the structure of such near-optimal sets.The hardest such question is: Question 1.1.(Erdős) Do all near-optimal point sets have a lattice structure?Erdős admitted that "I really have no idea and the problem is perhaps too vaguely stated."Erdős suggests that it would be nice to see if a near-optimal point set P must contain at least |P | 1/2 points on a common line.This conjecture also appears too hard.The first bound due to Szemerédi (communicated by Erdős [11]) showed there must be a line containing at least log |P | points of P .Using Kővári-Sós-Turán [17] this can be improved to at least log |P | points, see [30].There is a weaker version of Erdős' line question that is still open.Question 1.2.(Erdős) Prove or disprove: For a sufficiently small ε > 0, every near-optimal point set P contains at least c|P | ε points on a common line.
Lund, Sheffer and de Zeeuw [19] used bisector energy to show for any 0 < σ ≤ 1/4 there is either a line or circle containing c|P | σ points of P , or there are c|P | 8/5−12σ/5−ε lines each containing at least c log |P | points of P .There has been recent work on the converse problem: lines, circles and constant degree polynomials cannot have too large an intersection with a near-optimal set [31,24,21].By combining these three results, we obtain that for every near-optimal set P , every constant-degree algebraic curve contains at most c|P | 43/52 points of P .
One possible approach, suggested by Nets Katz, is to show that the additive energy of a nearoptimal point set is large [29,Problem 34].Following this philosophy, Hanson [15], Roche-Newton [25] and Pohoata [23] demonstrate that near-optimal Cartesian products have small difference sets.
Since the introduction of the Guth-Katz-Elekes-Sharir framework [7,14], it has been productive to view distinct distances as congruence classes of pairs of points (p, q) ∈ P 2 under the action of the group of rigid motions on R 2 .This was essential to the Guth-Katz [14] result which showed a point set P has Ω (|P |/ log |P |) distinct distances.One can think of classes of congruent triangles as the congruence classes of triples of points (p, q, r) under the same action (see Figure 1).This perspective was used by Rudnev [26] to show that a point set P describes at least Ω(|P | 2 ) distinct classes of congruent triangles.
Like with distances, we can see that Rudnev's lower bound is sharp by looking at the √ N × √ N integer lattice.There are two further examples for triangles: points in an arithmetic progression on a line; or vertices of a regular polygon (see Figure 2).We consider point sets with few classes of congruent triangles.We can prove much stronger structural results in this setting than those known for distances.Before we describe our result we formalise our assumption.Rudnev's sharp lower bound gives us the following definition for triangle-near-optimal point sets.
Definition 1.3.We say a finite point set P in R 2 is triangle-near-optimal if, for some constant M , P describes at most M |P | 2 classes of congruent triangle.
We show that all triangle-near-optimal sets are similar to the above examples in two ways: Theorem 1.4 gives us the geometric similarity.Corollary 4.4 shows that all triangle near optimal sets have strong additive or multiplicative structure, similar to the above examples.
Theorem 1.4.Suppose we have a finite point set P in R 2 .Let M be a positive constant and let c, c ′ and C be positive constants that depend only on M .If P contains M |P | 2 classes of congruent triangles (triangle-near-optimal) then either • There is a line l which contains c|P | σ points of P for some 0 < σ ≤ 1.Further, a positive proportion of P is covered by lines parallel to l each containing c ′ |P | σ points of P .
• There is a circle γ which contains C|P | points of P .
We also give sharp energy bounds for such sets, see the slightly more general Theorem 1.6 below.
Theorem 1.4 solves Question 1.2 of Erdős for sets with few classes of congruent triangles.Unfortunately, while triangles and distances are similar from the point of view of rigid motions, we cannot prove a direct relationship between sets with few triangles and those with few distances.This leads to the following question, a positive answer to which would fully resolve Question 1.2 of Erdős.
Question 1.5.Let P be a finite point set in R 2 with at most c|P |/ log |P | distinct distances.Does P describe at most M |P | 2 classes of congruent triangles for some constant M ?The constant M may depend on c.
We will discuss how our methods fail to answer this question after describing the proof of Theorem 1.4 (see Question 1.7).The proof of Theorem 1.4 consists of several steps combining the Elekes-Sharir-Guth-Katz framework and structure of the affine group with the traditional tools of Balog-Szemerédi-Gowers and the Freiman-type result of Green and Ruzsa from additive combinatorics.Before we outline the proof, we need to introduce some useful notions.
Let P be a finite point set in R 2 , M a positive constant (constants do not grow with |P |).We consider the set of classes of congruent triangles determined by P , defined as To apply the tools from additive combinatorics, we interpret additive structure in P using the additive energy of P .The additive energy is defined as To interpret multiplicative structure, we identify R 2 with C in the usual way, so that we can think of P as a subset of C.This allows us to define the multiplicative energy of P as This identification also allows us to interpret the group of rigid motions on R 2 , which we denote by SE 2 (R), as a subgroup of the affine group on C, denoted Aff(C).For technical calculations we use the isomorphism Aff(C) ∼ = C × ⋉ C. For details of this isomorphism, and the action of Aff(C) on C see the start of Section 4. We call a given rigid motion θ ∈ SE 2 (R) k-rich (with respect to the point set P ) if Finally, we introduce group energy, which plays a central role in the proof.Let S be a subset of a multiplicative group G. Then we define its group energy as Throughout the paper we should think of S as a set of rigid motions within the affine group, so S ⊆ SE 2 (R) ≤ Aff(C).Throughout, we use θ to denote an element of SE 2 (R), a rigid motion.We will use g and h to denote more general elements of the affine group.The proof is broken down into four main steps, a rough outline is the following.
Step 1 (Few triangles give many rich actions) If P has M |P | 2 congruence classes of triangles then there are roughly |P | members of SE 2 (R) which are |P |-rich.
Step 2 (Many rich actions lead to a large group energy) If S is the large set of rich rigid motions, then its group energy is as large as possible.
Step 3 (Rich symmetries with large group energy gives P large energy) Large group energy gives large intersection between very-rich rigid motions and a 'nice' coset of Aff(C).This large intersection means either the additive or multiplicative energy of P is large.
Step 4 (Structure in the affine group gives P structure) We use the large coset intersection from Step 3. We obtain the circle structure using a coset of the affine group directly.For the line structure, we have to pass through the additive energy using Balog-Szemerédi-Gowers and Freiman type results.
The first and second steps require some delicacy to ensure that there are no log-type losses, see Lemma 2.1.The third step is an application of a Balog-Szemerédi-Gowers-type result in the affine group due to Petridis-Roche-Newton-Rudnev-Warren [22].
Step four is divided into a multiplicative and additive cases.The multiplicative case uses only the structure of cosets of SE 2 (R).The additive case we require the application of Balog-Szemerédi-Gowers and a result of Mudgal [20] that relies on the Freiman-type result of Green-Ruzsa [13].We summarise steps 2 to 4 in the following Theorem.To ensure readability of the proof we will focus on the constants seen in the triangle case only.Theorem 1.6 can be proved by using the constants C 1 and C 2 in place of those provided by Corollary 3.2 in Sections 3, 4 and 5.
The energy bounds gained here are enough-under the triangle assumption-to resolve the energy problem of Katz [29,Problem 34].
We emphasise that the bound on the additive energy E + (P ) was necessary to demonstrate line structure, however the bound on the multiplicative energy E × (P ) is not required to demonstrate circle structure.Once we rely on the energy to get structure, there are results of Stanchescu [33] and Erdős-Füredi-Pach-Ruzsa [9] that show that we need essentially-optimal energy bounds to have any chance of structure.We discuss this further in Section 5.
It is a quick calculation using the Guth-Katz bound [14, Proposition 2.5] to show that k-rich actions with k ≤ log |P | or k ≥ |P |/2 cannot provide a large enough energy for a set with such few distances, so some sort of polynomially-rich actions are necessary.We can show that there is at least one σ in the range 0 < σ ≤ 1 which achieves the Guth-Katz bound.Our method is not quantitative, so the best group energy bound we can get is E(S) = Ω(|S| 2+1/3 ).One would need an exponent better than 2 + 1/2 for our methods to give any structure in P .
In the square lattice example, each k has the maximum number of k-rich actions i.e. for all k we have |S ≥k | = Θ(|P | 3 k −2 ).We do not have enough evidence to conjecture that such a distribution holds across all near-optimal sets.Any examples disproving this would be of great interest.We also note that our methods gives better energy bounds on P as the richness of the group actions increases.For the structural results it is necessary for essentially-optimal energy bounds, so we can afford no polynomial loss in the richness of our actions.

Few Triangles Give Many Rich Actions
In this section we detail the first step of our proof: That sets with few classes of congruent triangles have many very-rich actions.For a point set P and a positive integer k, recall that an element θ in SE 2 (R) is a k-rich rigid motion if |P ∩ θP | = k.Define S ≥k = S ≥k (P ) to be the elements of SE 2 (R) that are at least k-rich rigid motions of P .We state the incidence result of Guth-Katz [14, Proposition 2.5] with an explicit constant C as We only need that C is finite, see [16] for explicit constants.Using this we can prove the following.
Lemma 2.1.Suppose we have a point set P in R 2 with exactly M |P | 2 congruence classes of triangles for some constant M .Let C be the Guth-Katz constant.Then we have at least (3CM ) −3 |P | values of k such that both the following hold: , and When we use this lemma later we will only need one such value of k, however it is easier to prove the above.
The proof of Lemma 2.1 uses the initial step of the Elekes-Sharir-Guth-Katz framework.We recall the necessary steps prior to beginning the proof.

Counting Energy Using Rich Rigid Motions
For a point set P define its triangle energy as E T (P ) = |{(p, q, r, p ′ , q ′ , r ′ ) ∈ P 6 : tri.pqr congruent to tri.p ′ q ′ r ′ }|.
We aim to rephrase this energy in terms of k-rich rigid motions.We can then use Cauchy-Schwarz and the fact that we have very few classes of congruent triangles to give an essentially-optimal lower bound.See the forthcoming equation (3).
We note the earlier observation of Rudnev [26], that two triangles are congruent if and only if there is a rigid motion taking one to the other.See Figure 1.Thus, we can count the triangle energy by counting the number of rigid motions weighted by how rich these motions are.Indeed, note that if θ is k-rich then there are k 3 triples of the form (p, q, r, θp, θq, θr).Letting S =k be the set of exactly k-rich rigid motions we can count the triangle energy as We change this sum to use S ≥k , the number of at least k-rich rigid motions, using that One then notes that the term |S ≥k | occurs in the sum with weight Thus we have that To obtain the lower bound on this energy, we use Cauchy-Schwarz.For a triangle class t in T (P ) define r(t), its number of realisations in P , as r(t) = |{(p, q, r) ∈ P 3 : triangle pqr is congruent to t}|.
We then have that ( Notice that the final sum here is the same as the size of six-tuples (p, q, r, p ′ , q ′ , r ′ ) where the triangles pqr and p ′ q ′ r ′ are congruent.So this is exactly the triangle energy.Using this, along with the earlier energy upper bound, one has This is the bound we will need for the remainder of the section.For completion, note that Rudnev's lower bound follows by the application of the Guth-Katz bound, see (1).This gives Notice that (4) shows that the lower bound here is essentially the best possible.We split the sum up into the sum over the good k and the sum over the two bad sets.For the sum of the good values of k we use (1).
With the last estimate using our assumption that X < |P |/27M 3 C 3 .We now estimate the contribution from the 1-bad k.As each term is 1-bad we know that Using this, and again k ≤ |P |, we have that To conclude this case it suffices to show that This follows as k can only exist in the range 2 ≤ k ≤ |P |, so the number of 1-bad such k is strictly less than We now have to deal with the 2-bad values of k.Being 2-bad means that k < |P |/3CM .We use (1) The final inequality using Y 2 < |P |/3CM , as this is the range of k in the 2-bad case.Thus, under the assumption that X < |P |/27M 3 C 3 , we have that this contradiction completes the proof.

Many Rich Actions Give Large Group Energy
We show that if we have very few classes of congruent triangles then there must be a large set of rigid motions that has very large group energy.See the forthcoming Corollary 3.2.The proof of this relies on a technical inequality which we state as a lemma.
Lemma 3.1.Let S ≥k be a set of at least k-rich rigid motions in SE 2 (R).Then We than combine Lemma 3.1 with one of the good k guaranteed by Lemma 2.1.This gives us the following corollary.Corollary 3.2.If P is a set with at most M |P | 2 classes of congruent triangles, then there is a set S ⊂ SE 2 (R) such that all of the following hold • Each element of S is at least |P | 3CM -rich when acting on P .
We leave the more technical proof of Lemma 3.1 until after the short proof of Corollary 3.
Using the estimate on k six times and the estimate on |S| once we see that |S| 3 (3CM ) 7 ≤ E(S).
We finish the section by proving Lemma 3. − −− → ϕp.Thus, we can relabel the sum over θ, ϕ as the sum over φ = ϕθ −1 in SS −1 .When we do this we have to count the repeated representations of φ using the weight So letting p ′ = θp this allows us to write p∈P θ,ϕ Squaring both sides, we see that We apply Hölder to obtain The second sum is exactly the triangle energy discussed in Section 2. Indeed, we are counting the size of the set E T (P ) = {(p, p ′ , p ′′ , φp, φp ′ , φp ′′ ) ∈ P 6 : φ ∈ SE 2 (R)}, which, as in (4), is bounded by C|P | 4 .Cubing both sides, we have We then apply Cauchy-Schwarz, We note that the first sum is just |S| 2 and the second is the group energy E(S).Both of these calculations are the same as the ones in Section 2, after (2).Rearranging, we have the desired bound

Rich Symmetries With Large Group Energy Give P Large Energy
We demonstrate the structure that a set P with few classes of congruent triangles has in the affine group.See the forthcoming Corollary 4.2.We also show that point sets with few classes of congruent triangles demonstrate sharp energy bounds.See Corollary 4.4.We will make extensive use of the affine group Aff(C).We also make the usual identification of R 2 with C. We use that Aff(C) = C × ⋉C with identity (1, 0) and semidirect product multiplication The group of rigid motions SE 2 (R) becomes a subgroup of Aff(C) = C × ⋉ C via embedding it as the subgroup S1 ⋉ C. Let x = (x 1 , x 2 ) and t = (t 1 , t 2 ) be points in R2 , the embedding is as follows Rotation by angle θ about the point x → (e iθ , ( Translation by t → (1, One can check this is a group isomorphism.This helps by letting us exploit the geometry of the affine group, similar approaches can be found be found in [28,22].The affine group acts on C, in particular on P ⊆ C, via the action We will care about two types of subgroups of Aff(C).In particular those that can be thought of as lines when Aff(C) is identified as the 'plane' C 2 \ {(0, z) : z ∈ C}.
• The unipotent subgroup U 0 = {(1, z) : z ∈ C} is a vertical line through the identity.A coset gU 0 is the vertical line though g.
• The maximal tori T (z), these are the stabiliser subgroups under the action in (9).So, for z ∈ C, we define T (z) = Stab(z).Tori correspond to non-vertical lines through the identity (1, 0).A coset gT (z) is a non-vertical line passing through g.
We use the following Theorem of Petridis-Roche-Newton-Rudnev-Warren [22], the proof of which is an application of Rudnev's point-plane bound [27].The version stated below is adapted to our setting, for a positive characteristic version see [22].Similarly to the group energy we define, for S any subset of a group, the energy E * (S) = |{(g 1 , g 2 , g 3 , g 4 ) ∈ S 4 : g 1 g 2 = g 3 g 4 }|.
Theorem 4.1.Let S be a finite set of transformations in the affine group Aff(C) such that no non-vertical line contains more than H points of S, and no vertical line contains more than V points of S.Then, Shkredov [32] shows that E * (S) ≤ E(S), so we can use E(S) as this maximum.Using Corollary 3.2 with Theorem 4.1 we find a rich line in Aff(C).Indeed, as a direct consequence of the group energy bound for the set S in Corollary 3.2 we can say that there are positive constants c 1 and c 2 such that one of the following must exist: • A vertical line in Aff(C) that contains at least c 1 |S| (3CM ) 14 points of S; • A non-vertical line in Aff(C) that contains at least c 2 |S| (3CM ) 7 points of S.
• There is some g in Aff(C) and .
Unfortunately, there are point sets P where both the conclusions of Corollary 4.2 can be achieved simultaneously 1 .In Section 5.1 we show that we can take g and our cosets in the subgroup SE 2 (R) = S 1 ⋉ C.This will be important for establishing the circle structure.
We can also prove the following result about the energy of the point set P .Recall that E × (P ) is the multiplicative energy, treating P as a set of complex numbers.Proposition 4.3.Suppose that P is a point set in R 2 , let C 1 , C 2 and C 3 be positive constants.Suppose there is a set S in SE 2 (R) of rigid motions each of which are (C 1 |P |)-rich when acting on P .Both of the following hold.
Using the set S from Corollary 3.2 with the additional properties from Corollary 4.2, Proposition 4.3 allows us to conclude the following.Then at least one of the following is true: 16
The remainder of the section is devoted to the proof of Proposition 4.3.
Proof of Proposition 4.3.We prove the additive statement first.We include the multiplicative proof too as there are technical differences that need be checked.For notational ease let k = C 1 |P | throughout the proof.
For the additive case we note that the assumptions give us a set S such that By direct application of ( 6) we can see that Thus, for each such pair (p, q), we have Note that z is dependent only on our choice of θ, not on the pair (p, q) selected in P × θP .The left-hand side lives in the set P − g 1 P .The set P − g 1 P depends only on g and so is the same for all choices of θ ∈ gU 0 .This uniformity allows us to show that the (P − g 1 P )-energy (defined below) is large.We will prove this, then show why this suffices for the claimed additive energy bound.
For a complex number z in P − g 1 P , we define its number of realisations as By (11), each of the k pairs (p, q) associated to θ contribute to r (P −g1P ) (g 1 z + g 2 ), thus We define the energy E + (P, g 1 P ) as We can count this energy, similarly to the calculation proceeding Lemma 2.1, as Recall that, by assumption, |gU 0 ∩ S| ≥ C 2 |P |.So we have at least C 2 |P | choices of θ.We showed in ( 12) that each such θ gives a w = g 1 z + g 2 , where z depends on θ, such that r (P −g1P ) (w) ≥ k.Thus, recall that k = C 1 |P |, we have Applying Cauchy-Schwarz and combining with (16) gives Using the same energy redefinition trick as above converts both of these division energies into the usual multiplicative energies.So, we have that So for translates of P by either t = ζ or t = g • ζ we have that We now prove Lemma 4.5, which follows from a calculation.
Proof of Lemma 4.5.Using (6) we see that By assumption gh • p = q.Using (9) we calculate the action of gh on p + ζ gh Using that h ∈ T (ζ), we have that We reevaluate gh Using the definition of the action, we can see that (g 1 h 1 p + g 1 h 2 + g 2 ) = gh • p. So, combining this with our assumption that q = gh • p, we have Setting these two different evaluations equal gives

Structure in P
We now use either the coset structure established in Corollary 4.2 or the additive energy bound found in Corollary 4.4 to give explicit geometric structure.We start with the case when S has large intersection with a coset of the type gT (z).From our energy calculations above, we refer to this as the multiplicative case.When S has a large intersection with a coset gU 0 this is referred to as the additive case and is dealt with in Section 5.2.

Multiplicative Case: Circle Structure
By examining the structure of cosets associated with the multiplicative energy, i.e. those of the form gT (z), we can deduce a stronger structural result without needing to use any additive combinatorial machinery.Before we do this we clarify that, as our intersection of gT (z) with SE 2 (R) is nonempty (as it contains some of S), we can view the intersection (gT (z)) ∩ S as living in a coset of T (z) ∩ SE 2 (R).We will denote this coset by θ(T (z) ∩ SE 2 (R)) = (gT (z)) ∩ SE 2 (R).This is justified in the following lemma.
Lemma 5.1.Let S be a subset of SE 2 (R), z ∈ C and gT (z) a coset in Aff(C).If (gT (z)) ∩ S is non-empty, then there is some θ ∈ S such that (gT (z)) As S has non-empty intersection with gT (z) and is contained in SE 2 (R), S has non-empty intersection with (gT (z)) ∩ SE 2 (R).Thus, by the above, (gT (z)) ∩ SE 2 (R) must lie in a coset of T (z) ∩ SE 2 (R).There is at least one element of S in this coset, so we can choose some element of S as its coset representative.
By identifying any point (x, y) ∈ R 2 with x + iy ∈ C, we can prove the following.Lemma 5.3 follows from the observation that intersecting the stabilisers T (z) with SE 2 (R) reduces the dimension of T (z) from two, as a subset of the affine group, to one in SE 2 (R).This dimension reduction allows us to show that we have a constant proportion of our points on a circle.The proof of Lemma 5.3 is technical, so we will delay it until after Proposition 5.2.
Proof of Proposition 5.2.Define a digraph with vertex set P and directed edges (p → q) if there exists an element of θT (z) taking p to q.By assumption there are C 2 |P | elements of θT (z) each at least C 1 |P |-rich, and so there are C 1 C 2 |P | 2 edges in this graph.By the handshaking lemma and the pigeon-hole principle there is a vertex of out-degree C 3 |P |, for a positive constant C 3 .
Note that if (p → q) is an edge then q must lie in the orbit of p under the action of the coset (as this is how edges are defined), so all the C 3 |P | points of P that are out-neighbours of p lie on this orbit.By Lemma 5.3 this orbit is a circle, so we are done.
We now prove Lemma 5.3.This directly uses the structure of the group T (z) ∩ SE 2 (R).
Proof of Lemma 5.3.Recall from the embedding (8) that a translation in SE 2 (R) is an element of the form (1, t) for t ∈ C. We claim that every coset of the from θ(T (z) ∩ SE 2 (R)) contains exactly one translation.The proof now follows quickly.
Suppose that θ is the identity, then our coset θ(T (z)∩SE 2 (R)) is exactly the set of rigid motions that preserve z.These are the rotations, in R 2 , about the point z (as we are in SE 2 (R) and not Aff(C) we do not have any scalings).So, if p is a point, its orbit under the action of T (z) ∩ SE 2 (R) will be the circle of radius ||p − z|| centred at z.
If θ is not the identify, relabel so that θ is the unique translation in θ(T (z) ∩ SE 2 (R)).The orbit of p under T (z) ∩ SE 2 (R) is a circle and we are applying the uniform translation θ to this orbit, so it remains a circle.One can see that this circle is centered at θ • z with radius ||p − z||.

Additive Case: Line Structure
Our aim in this section is to demonstrate that a point set with few classes of congruent triangles has: large intersection with a line l; a positive proportion of P lies on very-rich lines all parallel to l.We prove the following theorem, essentially a rephrasing of [20, We do not use the structure of the affine group and instead rely only on our energy bound.Because of this reliance, we need P to have essentially maximal additive energy.
In order to discuss this, we need to introduce the notion of a sumset.For a subset A in an abelian group G we define the sumset A + A to be all distinct pairwise sums, The sumset is closely related to the additive energy, see (17).To see why an essentially maximal energy bound is required, we introduce two results.In the proof of Theorem 5.4 we use traditional tools of additive combinatorics.The Balog-Szemerédi-Gowers Theorem [2,12] allows us to pass form additive energy to additive sets.We then borrow Mudgal's [20] use of Green and Ruzsa's [13] Freiman-type Theorem to provide the line structure.We will introduce both these results below.
The use of energy in the additive case, as opposed to the use of the affine group structure in the multiplicative case, is the reason for the different strength in the two structural results.One can see that the unipotent subgroup U 0 has the same dimension in both Aff(C) and SE 2 (R).So, our dimension-reduction trick used in Section 5.1 no longer works.One way to improve the structure found in Theorem 1.4 would be to find a way to use the affine group structure.

Additive Tools
We introduce the tools we will use from additive combinatorics.The following is the version of Balog-Szemerédi-Gowers Theorem we will use.We are not concerned with the explicit constants, as they do not effect the exponent in Theorem 1.4.We refer those interested in the explicit constants to the proof of Balog [1].
Theorem 5.5 (Balog-Szemerédi-Gowers).Let A be a finite set in an abelian group G with respect to the group operation +.Then if E + (A) ≥ α|A| 3 we have an A ′ ⊆ A such that where C 1 and C 2 are positive constants dependent on α only.
We use the Freiman-type result of Green-Ruzsa.In order to state the result we have to give some additional definitions.
Given an abelian group G, we define a proper progression P of arithmetic dimension s and size Λ as where λ 1 • • • λ s = Λ and v 0 , v 1 , . . ., v s are elements of G such that all the sums in the progression are distinct.We further define a coset progression to be a set of the form P + H where P is a proper progression and H is a subgroup of G.

Proof of Theorem 5.4
The proof of Theorem 5.4 is-but for some constants changing-the same as the Mudgal's proof [20,Lemma 3.2].We include it here for completeness. .Applying Green-Ruzsa to P ′ ⊆ R 2 we have that P ′ lies in a coset progression P + H.Note that, as P ′ is finite, the bound on Λ implies H must be a finite subgroup.The only such subgroup over R 2 is the trivial group.Thus, we can assume that P ′ lies in the proper progression P only.
So, we have that P ′ ⊆ P where P is of size Λ ≤ C 6 |P | and arithmetic dimension s ≤ C 7 , By definition of the progression we have that λ 1 • • • λ s = Λ ≤ C 6 |P |, so by the pigeon-hole principle there is an i such that λ i ≥ C |P | 1/s points of P ′ .This gives us our rich line, which we will denote as l 1 .
We now examine the above cover to show that a positive proportion of P ′ , and hence P , is covered by the translates of l 1 .Order the cover so that where each l k is a translate of Q with non-empty intersection with P ′ .Let C 3 be a constant to be determined later, then let r be the minimal positive integer such that |P | 1/s C 3 , if C 3 ≥ 1 such an r exists.Define the set B, of points in P ′ our rich lines miss, as B = P ′ \ r i=1 (P ′ ∩ l i ).To prove the result it suffices to show |B| ≤ |P ′ |/2.We have that rearranging gives (k − r) > |B|C3 |P ′ ∩l1| .We also have, by selecting relevant subsets of P ′ and using that the lines l j are disjoint, that Combining ( 18) and (19) we have that Using the constant C 2 from Theorem 5.5 we have that Choosing C 3 to be the maximum of 2C We now have all the necessary tools to prove our main theorem.
Proof of Theorem 1.4.We start with Corollary 4.2.This gives us an S in SE 2 (R), with each element of S a rigid motion that is at (C 1 |P |)-rich when acting on P .Further, there is some g in Aff(C), so that at least one of the following holds: If the first of these holds, we get the line structure by combining the first statement of Proposition 4.3 with Theorem 5.4.
If the second holds, note that S has non-empty intersection with a coset gT (z) and S is contained in SE 2 (R).So we can apply Lemma 5.1 then Proposition 5.2.

Figure 2 :
Figure 2: An arithmetic progression on a line and points at the vertices of a regular polygon.One can also generalise these examples, by repeating them O(1) times.If P is on O(1) parallel lines with the same arithmetic progression on each then P defines Θ(|P | 2 ) congruence classes of triangles.Similarly, if P is on O(1) concentric circles with points lying at a vertex of a scaled version of the same polygon, then we have few classes of congruent triangles.We consider point sets with few classes of congruent triangles.We can prove much stronger structural results in this setting than those known for distances.Before we describe our result we formalise our assumption.Rudnev's sharp lower bound gives us the following definition for triangle-near-optimal point sets.

2 .
For distances, step 1 fails.Theorem 1.6 requires at least c 1 |P | actions each being (c 2 |P |)-rich.For a set with at most, say, |P |/ log |P | distinct distances (which is near minimal) our methods cannot guarantee many |P |-rich actions.Indeed, it is not clear that a minimal distance set must contain many very rich actions.When looking at distances, unlike the triangle case, there cannot be examples where all actions are (c 2 |P |)-rich (as such sets have to have at least |P | distances).This leads to the following question.Question 1.7.If P is a finite point set in R 2 with o(|P |) distinct distances, can one say anything about the distribution of the k-rich actions for k

1 .of Lemma 3 . 1 . 2 .
Proof We now use the methodology introduced and developed by Elekes in[3,4,5,6].Let P (x) be used as the indicator function of x ∈ P and let S = S ≥k .Using that each element θ of S is at least k-rich we have k|S| ≤ As we have p θ − → θp and p ϕ − → ϕp, we can see that θp ϕθ −1

Corollary 4 . 2 .
Let P be a point set in R 2 with at most M |P | 2 classes of congruent triangles.Let C be the constant in the Guth-Katz theorem.Corollary 3.2 guarantees a set S which contains at least |P |/3M rigid motions, all of which are at least (|P |/3CM )-rich.For this set S, there are positive constants c 1 , c 2 and z ∈ C such that at least one of the following holds:

Corollary 4 . 4 .
Let P be a point set in R 2 with at most M |P | 2 classes of congruent triangles.

Lemma 5 . 3 .
and each element of S is at least (C 1 |P |)-rich with respect to the points in P .Then there exists a positive constant C 3 and a circle γ such that |P ∩ γ| ≥ C 3 |P |.The proof of Proposition 5.2 relies on the following technical Lemma.Fix some p and z in R 2 and θ = (e iα , t) in SE 2 (R) = S 1 ⋉ C. The orbit of p under the action of the coset θ(T (z) ∩ SE 2 (R)) is a circle in R 2 , the radius is a function of z and p only.

2 C1C 1 /s−1 6 C3. 5 . 3 .
and 1 we can ensure that |B| < |P ′ |/2.To finish the proof as stated let σ = 1/s and C 4 = Proof of Theorem 1.4 Theorem 1.6.Suppose that P is a point set in R 2 , let C 1 and C 2 be positive constants.Suppose there is a set S in SE 2 (R) of C 1 |P | actions, each of which are (C 2 |P |)-rich with respect to the points in P .Then at least one of the following holds:1.There is a sharp energy bound E + (P ) ≥ C 3 |P | 3 .This energy bound provides the structure:There is a line l which contains Ω(|P | σ ) points of P for some 0 < σ ≤ 1.Further, a positive proportion of P is covered by lines parallel to l each containing Ω(|P | σ ) points of P .2.There is a t ∈ R 2 such that the sharp energy bound E × (P − t) ≥ C 4 |P | 3 holds.Using the affine group cosets directly we can show: There is a circle γ which contains Ω(|P |) points of P .
Lemma 3.2].Theorem 5.4.Suppose that P is a point set in R 2 with E + (P ) ≥ C|P | 3 then there is a subset P ′ of P with |P ′ | ≥ C 1 |P | and there exist parallel lines l 1 , l 2 , . . ., l r in R 2 , and constants 0