Skip to content

Erdős problem 503

What is the size of the largest A⊆RnA \subseteq \mathbb{R}^n such that every three points from AA determine an isosceles triangle? That is, for any three points xx, yy, zz from AA, at least two of the distances ∣x−y∣|x - y|, ∣y−z∣|y - z|, ∣x−z∣|x - z| are equal.

Sources

The source's own material, retained exactly.

5 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

503.lean

Retained formal statement5 of 5

The best upper bound known in general is due to Blokhius [Bl84] who showed that ∣A∣≤(n+22) |A| \leq \binom{n + 2}{2}

[Bl84] Blokhuis, A., Few-distance sets. (1984), iv+70.

FormalConjectures/ErdosProblems/503.leanErdos503.erdos_503.variants.upper_bound1 lineExact file
∀ (n m : ℕ), m ∈ {x | ∃ A, ∃ (_ : A.IsIsosceles), A.ncard = x} → m ≤ (n + 2).choose 2
SolvedStatement only, no proof