Isosceles sets and two-distance sets in Euclidean space
arXiv:2611.05421
Abstract
A finite set of points in is isosceles if every three of its points form an isosceles triangle. Erdős asked in 1946 for the largest size of an isosceles set in ; the answer was known for . Let and be the largest sizes of a two-distance set and of a spherical two-distance set in . We prove that for every , which reduces the problem to these two classical ones. With the recently determined values of for we obtain for and , and we show that the extremal set is unique: for it is the set of midpoints of the edges of a regular simplex together with its centroid, and for it is the McLaughlin configuration together with its centre. For every isosceles set with more than points is a two-distance set or a spherical two-distance set together with its centre. The proofs start from Blokhuis' decomposition of isosceles sets into mutually orthogonal two-distance sets. Counting leaves one configuration open: a two-distance set with points in a hyperplane, the largest number allowed by Blokhuis' bound, together with two points that are mirror images of each other. We exclude it by showing that a two-distance set attaining Blokhuis' bound in is unisolvent for quadratic polynomials and that, if lies on two concentric spheres, then apart from two exceptional cases its two layers are spherical -designs whose sizes are determined by the radii. We also show that the squared distances of such a set are in ratio with if . Hence there is none for , so that and .
arXiv comment32 pages, 1 table. v2: new title; adds a proof of the formula for iso(d) in all dimensions and an improved upper bound for g(23)