Skip to content

Erdős Problem #1086

Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: geometry, distances.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

UNACCEPTED DRAFT — mathematical editorial review pending

This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.

Review the underlying draft on GitHub.

The question in plain language

How many triangles of the same positive area can be determined by \(n\) points in the plane? Erdős Problem #1086 asks for the maximum count \(g(n)\), taken over all point configurations and choices of a common positive area.

The triangles are unordered triples of distinct vertices. Collinear triples have area zero and do not count. By uniformly scaling the plane, any fixed positive area can be normalized to one.

A small example

Take the corners of a unit square. There are four ways to select three of the four vertices, and every resulting triangle has area exactly \(1/2\).

Consequently \(g(4)=4\): the square attains all \(\binom43=4\) possible triangles. Scaling the square by \(\sqrt2\) makes their common area exactly one.

In general, triangle area is half the absolute value of the determinant

\[ \det\begin{pmatrix}x_2-x_1&y_2-y_1\\x_3-x_1&y_3-y_1\end{pmatrix}. \]

This gives an exact arithmetic test for equal areas without floating-point geometry.

What is known

The question originated with Oppenheim and was studied by Erdős and Purdy in 1971. The maintained catalogue records early lower and upper estimates of the forms

\[ n^2\log\log n\ \ll\ g(n)\ \ll\ n^{5/2}, \]

with the upper bound subsequently improved by several authors. The reported best general upper bound is due to Raz and Sharir (2017):

\[ g(n)=O(n^{20/9}). \]

The sharp growth is still open. Similar questions about simplices in higher-dimensional spaces require their own parameters and are not identical to the planar triangle problem.

GCL's current state

Authenticated source audit #2357 normalized the positive-area condition and independently checked the four-square-corners calculation. The original 1971 article and later incidence-theoretic proofs have not been fully examined.

What remains

Inspect the primary Erdős–Purdy 1971 paper and the Raz–Sharir 2017 argument, including any logarithmic factors or generic-position assumptions. Use integer determinants for reproducible small-grid counts. No finite construction establishes the conjectured growth.

Sources and claim boundaries

Erdős Problem #1086; Erdős and Purdy, Some extremal problems in geometry, Journal of Combinatorial Theory, Series A 10 (1971), 246–252; Raz–Sharir (2017), externally reported upper bound; authenticated GCL audit #2357. Source proof review is incomplete, and this explanatory manuscript is unaccepted.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2357 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: STATEMENT_CAPTURE_REQUIRED.
  • Formal-statement coverage: No statement was confirmed in GCL's pinned formal-provider snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction