Erdős Problem #1086 — Equal-area triangles in point sets
For an integer , let be a set of distinct points. For , let be the number of unordered three-point subsets of whose triangle has Euclidean area ; collinear triples are not counted. Define
The question is to estimate as grows. For , this definition gives . Since scaling the plane changes every positive area by the same factor, the inner maximum can equivalently be taken over triangles of area . The positive-area qualification is essential to that equivalence; counting zero-area triples would be a different problem. Erdős Problem #1086 The number of unit-area triangles in the plane: Theme and variations
Background
Oppenheim posed the question in 1967; Erdős and Purdy attribute it to him. Fixing the common area at loses no generality, because a uniform dilation takes any prescribed positive area to . Erdős and Purdy’s lower-bound construction uses a suitably sized section of the integer lattice, showing that many equal-area triangles can arise from structured point sets. Erdős Problem #1086 The number of unit-area triangles in the plane: Theme and variations
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.