Maximum Isosceles Sets
An isosceles set is a collection of points in which any subset of three points forms an isosceles triangle. We want to find the upper bound for the size of isosceles sets in any n-dimensional Euclidean space. Kido has already completed the study of isosceles sets in 3 and 4-dimensional space. We study the upper bound of spherical two-distance sets, a special type of isosceles sets, to help us find the upper bound of isosceles sets. More specifically, Musin’s Linear Programming technique on spherical two-distance sets could be used to study isosceles sets if a consistent relationship between isosceles sets and two-distance sets can be characterized. We offer a conjecture of this relationship. We also offer non-trivial lower bounds of isosceles sets in dimension 5 with 17 points and dimension 7 with 30 points as examples.