Speaker:

Wei-Hsuan Yu- University of Maryland

Date:

Apr 9 2014 - 3:00pm

Event type:

IDeAS

Room:

110 Fine Hall

Abstract:

The maximum size of spherical few-distance sets

had been studied by Delsarte at al. in the 1970s. We use the

semidefinite programming method to extend the known results of the

maximum size of spherical two-distance sets in

R^n when n=23 and 40 <= n <= 93 and n \neq 46,

78. We also find the maximum size for equiangular line sets in R^n

when 24 <=n <= 41 and n=43. This provides a partial resolution of the

conjecture set forth by Lemmens and Seidel (1973).