A Structural Theorem for Sets With Few Triangles
Combinatorics
2023-10-25 v2
Abstract
We show that if a finite point set has the fewest congruence classes of triangles possible, up to a constant , then at least one of the following holds. (1) There is a and a line which contains points of . Further, a positive proportion of is covered by lines parallel to each containing points of . (2) There is a circle which contains a positive proportion of . 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.
Cite
@article{arxiv.2206.09740,
title = {A Structural Theorem for Sets With Few Triangles},
author = {Sam Mansfield and Jonathan Passant},
journal= {arXiv preprint arXiv:2206.09740},
year = {2023}
}
Comments
18 pages, refereed version