Optimal Spherical Codes and Designs(3/4)

The goals of this research project are to study and work on classical problems indiscrete geometry area, called optimal spherical codes and designs. The notion ofoptimal spherical codes and designs is indeed broad. Such as the kissing numberproblem and sphere packing problem also can be regarded as the types of optimalspherical codes problems. Delsarte, Goethals and Seidel defined the notion ofspherical s-distance sets in 1977 and derived their upper bounds. However, for most of the cases of what is the maximum size of spherical s-distance sets are still open. The maximum equiangular lines problems in is also one type of that problem. Although we obtain series of new result for the maximum size of equiangular line problems but there are still quite many interesting open casesto work on.