English

A Structural Theorem for Sets With Few Triangles

Combinatorics 2023-10-25 v2

Abstract

We show that if a finite point set PR2P\subseteq \mathbb{R}^2 has the fewest congruence classes of triangles possible, up to a constant MM, then at least one of the following holds. (1) There is a σ>0\sigma>0 and a line ll which contains Ω(Pσ)\Omega(|P|^\sigma) points of PP. Further, a positive proportion of PP is covered by lines parallel to ll each containing Ω(Pσ)\Omega(|P|^\sigma) points of PP. (2) There is a circle γ\gamma which contains a positive proportion of PP. 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.

Keywords

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

R2 v1 2026-06-24T11:57:12.866Z