Abstract

We will go through some classical problems in discrete geometry and offer background knowledge. We introduce the notion of spherical few distance sets and spherical t-designs. Recently, the semidefinite programming (SDP) method has been introduced in those problems and SDP obtains several results. In particular, Musin’s conjecture has been solved and maximum size of spherical two-distance sets is solved for almost every dimension.