frontiers / frontier
e1271/1271 · statement.attested · reviewer:will-blair · 2026-06-10 · null→null
Reviewable change
back to reviewErdős Problem #91 remains OPEN. Statement: Suppose $A\subset \mathbb{R}^2$ has $\lvert A\rvert=n$ and minimises the number of distinct distances between points in $A$. Prove that for large $n$ there are at least two (and probably many) such $A$ which are non-similar. Topics: geometry, distances. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A186704, possible.
A proposal; no authority until an accepted review event.
accept gate
0 of 4 on recordtimeline
vpr_f877dcb9fa6d6b8cSEMANTIC-EDGE DRAFT -> Erdos #98 (vf_ffd1943974b46af5) [depends_on, confidence 0.7]: An 'optimal' set in 91 is defined as one achieving the minimum distinct-distance count, which is exactly the function h(n) studied in 98, so 91's definition is parasitic on that minimum. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.proposed
reason
SEMANTIC-EDGE DRAFT -> Erdos #98 (vf_ffd1943974b46af5) [depends_on, confidence 0.7]: An 'optimal' set in 91 is defined as one achieving the minimum distinct-distance count, which is exactly the function h(n) studied in 98, so 91's definition is parasitic on that minimum. -- LLM-drafted (20-agent extraction, 2026-06); NOT adjudicated. Accept or reject via `vela proposals accept/reject` under reviewer authority.
provenance
proposed by
agent:semantic-edge-extractor
actor type
human
created at
2026-06-10
target type
finding
affected
inspect finding →Erdős Problem #91 remains OPEN. Statement: Suppose $A\subset \mathbb{R}^2$ has $\lvert A\rvert=n$ and minimises the number of distinct distances between points in $A$. Prove that for large $n$ there are at least two (and probably many) such $A$ which are non-similar. Topics: geometry, distances. Erdős prize: no. Statement is machine-verified in Lean (formal-conjectures). OEIS: A186704, possible.
vf_6b4ba8010dbbad76Read-only frontier; diff not recomputed.
Erdős problems frontier receives a reviewable source, finding, caveat, replication, evaluation, or proof-affecting edit.
The packet names affected record objects, evidence, rationale, reviewer-facing fields, and expected proof impact.
Schema, provenance, benchmark, contradiction, and proof checks decide whether the request is ready to read.
A steward accepts, rejects, caveats, revises, or retracts the request under an inspectable identity.
Only the accepted event mutates frontier state. Atlases, constellations, and search update from that record state.
Jump to a section, signal, campaign, document, primitive, work path, frontier, record index, atlas, constellation, agent, capability, or full-state search.