Author:
Mansfield Sam,Passant Jonathan
Abstract
AbstractWe show that if a finite point set $$P\subseteq {\mathbb {R}}^2$$
P
⊆
R
2
has the fewest congruence classes of triangles possible, up to a constant M, then at least one of the following holds.
There is a $$\sigma >0$$
σ
>
0
and a line l which contains $$\Omega (|P|^\sigma )$$
Ω
(
|
P
|
σ
)
points of P. Further, a positive proportion of P is covered by lines parallel to l each containing $$\Omega (|P|^\sigma )$$
Ω
(
|
P
|
σ
)
points of P.
There is a circle $$\gamma $$
γ
which contains a positive proportion of P.
This provides evidence for two conjectures of Erdő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.
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference33 articles.
1. Balog, A.: Many additive quadruples. CRM Proc. Lecture Notes Addit. Comb. 43, 10 (2007)
2. Balog, A., Szemerédi, E.: A statistical theorem of set addition. Combinatorica 14(3), 263–268 (1994)
3. Elekes, G.: On linear combinatorics I. Concurrency-an algebraic approach. Combinatorica 17(4), 447–458 (1997)
4. Elekes, G.: On the number of sums and products. Acta Arith. 81(4), 365–367 (1997)
5. Elekes, György.: On linear combinatorics II. Structure theorems via additive number theory. Combinatorica 18(1), 13–25 (1998)