Semidefinite programming method on various problems
俞韋亘博士Computational and Experimental Research in Mathematics, Brown University 下午 3:30–5:00 Tòa nhà Hồng Kinh 107 室Abstract：
I will talk about various combinatorics problems which can be tackled by semidefinite programming (SDP) method. In particular, phase retrieval and compressive sensing problems can be discussed 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.