Skip to content

Erdős Problem #1207

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

Erdős Problem #1207 has maintained status OPEN BROADLY — PLANAR POWER SAVING SOLVED 2026 at this audit.

For \(n\) distinct points in \(\mathbb R^d\), let \(P_d(n)\) be the largest guaranteed size of a subset with no isosceles triangle: any three selected points must have three pairwise different distances. The main original test asks whether some fixed \(c>0\) satisfies

\[ P_2(n)<n^{1-c} \]

for all sufficiently large \(n\). Since \(P_d\) is a minimum over input point sets of the maximum size of an isosceles-free subset, a hard planar point configuration gives the desired upper bound, while random deletion and distance arguments give lower bounds. This is not the stronger all-pairwise-distances-distinct condition of #1208.

A small example

For vertices of a regular \(n\)‑gon, a triple forms an isosceles triangle exactly when its vertex indices form a nontrivial three-term arithmetic progression mod \(n\) (including the geometry of cyclic distance). Exhaustive enumeration for \(5\le n\le10\) finds maximum 3AP-free angular subset sizes recorded in the phase24 receipt; for a regular hexagon the maximum is 4. This exact finite polygon calculation illustrates the older construction's limitation but does not establish any general planar polynomial exponent.

What is known

The catalogue https://www.erdosproblems.com/1207, updated 7 September 2026, reports that Lee–Pohoata–Zhu [LPZ26] (assisted by ChatGPT) proved \(P_2(n)<n^{1-c}\) for some absolute \(c>0\), resolving that specific proposed power-saving upper bound. However, it intentionally retains OPEN for general sharp estimates of \(P_d(n)\). Pach–Tardos [PaTa02] plus deletion give \(P_2(n)\gg n^{0.432}\). An older claim that regular polygons force \(O(n^{1/2})\) is called incorrect by the current source; regular polygons instead relate to 3AP-free angular subsets and an upper bound in terms of \(r_3(n)\). Do NOT report the invalid polygon square-root bound as a theorem.

GCL's current state

Authenticated original issue-bound research return. The bounded mathematical fixture was independently replayed through ci/erdos_compendium_007_phase24_checks.py. All external advanced/general theorem statements remain attributed to sources, not independently certified. This is a local UNACCEPTED editorial manuscript.

What remains

Review LPZ26 original 2026 configuration and its exponent with exact theorem statement, and inspect PaTa02 and the BMP05 erroneous regular-polygon claim. Separately source-check the identification with cyclic 3APs (including even antipodal differences) and compare with #1208. Preserve 'planar power saving answered yes' while leaving the broader extremal problem open.

Independent source fidelity and critical mathematical review, protected publication, actual public deployment and V2 admission remain separate uncompleted obligations.

Sources and claim boundaries

https://www.erdosproblems.com/1207 ; [Er80,p.110],[PaTa02],[BMP05],[LPZ26], related #1208,#140.

Exact finite receipt: governance/erdos_compendium/batches/EC-BULK-007_FINITE_CHECKS_PHASE24.json. Original source issue frozen SHA retained; no independent certificate claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #2478 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: FORMAL_SOURCE_REFRESH_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