Equiangular lines and the Lemmens–Seidel conjecture

Yen Chi Roger Lin, Wei Hsuan Yu

研究成果: 雜誌貢獻文章

摘要

In this paper, claims by Lemmens and Seidel in 1973 about equiangular sets of lines with angle 1∕5 are proved by carefully analyzing pillar decomposition, with the aid of the uniqueness of two-graphs on 276 vertices. The Neumann Theorem is generalized in the sense that if there are more than 2r−2 equiangular lines in Rr, then the angle is quite restricted. Together with techniques on finding saturated equiangular sets, we determine the maximum size of equiangular sets “exactly” in an r-dimensional Euclidean space for r=8, 9, and 10.

原文英語
文章編號111667
期刊Discrete Mathematics
343
發行號2
DOIs
出版狀態已發佈 - 2020 二月

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

指紋 深入研究「Equiangular lines and the Lemmens–Seidel conjecture」主題。共同形成了獨特的指紋。

  • 引用此