← All problems

Erdős Problem #1086 — Equal-area triangles in point sets

59 years old · traced to

For an integer n≥1n\geq 1, let P⊂R2P\subset\mathbb{R}^2 be a set of nn distinct points. For a>0a>0, let Ta(P)T_a(P) be the number of unordered three-point subsets of PP whose triangle has Euclidean area aa; collinear triples are not counted. Define

g(n)=max⁡∣P∣=n  max⁡a>0Ta(P).g(n)=\max_{|P|=n}\;\max_{a>0} T_a(P).

The question is to estimate g(n)g(n) as nn grows. For n=1,2n=1,2, this definition gives g(n)=0g(n)=0. Since scaling the plane changes every positive area by the same factor, the inner maximum can equivalently be taken over triangles of area 11. 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 11 loses no generality, because a uniform dilation takes any prescribed positive area to 11. 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

Progress summary

Never refreshed

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.