Skip to content

Erdős problem 755

Start work

Erdős asked whether every nn-point set in R6\mathbb{R}^6 spans at most (1/27+o(1))n3(1/27 + o(1)) n^3 unit equilateral triangles.

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands 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:5f9fef062e59bde4573a0ad95622e18cefdd75e08ee543fe56c01592df6882d1
Metadata
sha256:ca7c07687deece21e76bf0d1bf7329ba42458a74a66325ceaf535cde12608963
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:6e3ec836aae77294c8894ec0604e67b96dbabfceb37e5731dc0e3b31e92b2743
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON