Isosceles sets (Q2380307)

In 1946, Paul Erdős posed this problem: how many points can be arranged in the plane, such that every 3 of them determines an isosceles triangle. This problem is closely related to finding the cardinality of the largest 2-distance set. Analogous questions can be asked in any metric space. The paper under review studies the maximum number of points in the Hamming space \(H_n\), such that every 3 of them determines an isosceles triangle. It also solves exactly Erdős' problem in euclidean spaces up to dimension 7, including the characterization of all maximum size isosceles sets. The proofs depend on using the linear algebra bounds in vector spaces of polynomials.