Problem

erdos:662

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.

Open Current State

Declared status: open
Formalization: not formalized
Subjects: geometrydistances
OEIS: N/A
Sources: source:erdos-problemssource:gpt-erdossource:vibemathed
Statement: www.erdosproblems.com

ambiguous statement

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims