A Structural Theorem for Sets with Few Triangles

Sam Mansfield*, Jonathan Passant

*Corresponding author for this work

Research output: Contribution to journalArticle (Academic Journal)peer-review

2 Citations (Scopus)

Abstract

We show that if a finite point set P ⊆ R2 has the fewest congruence classes of triangles possible, up to a constant M, then at least one of the following holds.
• There is a σ > 0 and a line l which contains Ω(|P|σ ) points of P. Further, a positive proportion of P is covered by lines parallel to l each containing Ω(|P|σ ) points of P.
• There is a circle γ which contains a positive proportion of P.
This provides evidence for two conjectures of Erd˝os. We use the result of Petridis–Roche–Newton–Rudnev–Warren on the structure of the affine group combined with classical results from additive combinatorics.
Original languageEnglish
Pages (from-to)155–178
Number of pages24
JournalCombinatorica
Volume44
Issue number1
Early online date12 Oct 2023
DOIs
Publication statusPublished - Feb 2024

Bibliographical note

Publisher Copyright:
© The Author(s) 2023.

Keywords

  • Erdos Distinct Distances
  • Triangles
  • additive energy

Fingerprint

Dive into the research topics of 'A Structural Theorem for Sets with Few Triangles'. Together they form a unique fingerprint.

Cite this