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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics