A structural theorem for sets with few triangles

DOI10.1007/S00493-023-00066-ZMaRDI QIDQ6126417zbMATH OpenFDO

Authors Sam Mansfield, J. Passant

Publication date 9 April 2024

Published in Combinatorica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2206.09740

zbMATH Keywords

additive structuredistinct distancestriangles

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Abstract: We show that if a finite point set $P$ 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 polynomially-rich line $l$ through $P$ and a positive proportion of $P$ is contained on lines parallel to $l$. (2) There is a circle $gamma$ which contains a positive proportion of $P$. Under slightly stronger assumptions, this establishes a conjecture of ErdH{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.

Recommendations

• On the structure of pointsets with many collinear triples
• Optimal point sets determining few distinct triangles
• Three-point configurations determined by subsets of \({\mathbb{F}_q}^2\) via the Elekes-Sharir paradigm
• On the existence of ordinary triangles

Cited in

(3)

• On the structure of pointsets with many collinear triples
• A lower bound for the number of pinned angles determined by a Cartesian product set
• Structural Szemerédi-Trotter for lattices and their generalizations

This page was built for publication: A structural theorem for sets with few triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126417)