Semidefinite programming on various problems


天數 202


2017-12-25 (星期一) 11:00 - 12:00


I will talk about various combinatorics problems which can be tackled by semidefinite programming (SDP) method. For instance, the best results in kissing number problems and maximum size of spherical two-distance sets and equiangular lines are achieved by SDP. Especially, I will discuss details about using symbolic semidefinite programming method to prove Musin Conjecture which is a classical problem in discrete geometry. Almost every dimension about maximum spherical two-distance sets problems is solved.