臺灣國際科展

Maximum Isosceles Sets

科展類別
臺灣國際科展作品
屆次
2021年
科別
數學
學校名稱
臺北美國學校
指導老師
Jude Clapper
作者
詹益家
關鍵字
Isosceles Sets、Two-Distance Sets、Maximum Cardinality

摘要或動機

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.


「為配合國家發展委員會「推動ODF-CNS15251為政府為文件標準格式實施計畫」,以及 提供使用者有文書軟體選擇的權利,本館檔案下載部分文件將公布ODF開放文件格式, 免費開源軟體可至LibreOffice 下載安裝使用,或依貴慣用的軟體開啟文件。」

檔案名稱 檔案大小 格式
TISF2021-010011.pdf 716 KB Adobe Reader(Pdf)檔案