Erdős problem 662 · problems.science

Among sufficiently large one-separated planar point sets, does the triangular lattice maximize the number of distances below each threshold? Explicit rational oblique lattices beat the triangular lattice under several closed- and strict-shell readings.

Workspace

Continue locally Open source Sign in to contribute

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Source#662
→
ResultNone
→
Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Typos identified
GPT-Erdős
Open the source record
construction
VibeMathed
Machine
GPT-5.6 starships (Claude Fable 5 reviewer)
Reported outcome
variant
Open the source record

Reported activity

Search problems.science