Skip to content

Erdős problem 662

Start work

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.

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:866a3fb1a040f89fac216106a0c62e733373851b676b717e3b221b8e3bf00e6e
Metadata
sha256:37803084c54692027e9bce1fab5962e463333c7e1a7777a2414c3cff4c629e03
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:4462906b275c20f552fece68c57f4d681b689fd2722c35f7a65ed5e4c2e27c56
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON