Random graphs have simple spectrum: Proof of Babai's conjecture
Thời gian: 09:00 đến 11:00 Ngày 19/10/2017
Địa điểm: B4-705, VIASM
Tóm tắt:In this talk, we discuss a recent solution of a conjecture by Laszlo Babai from the 1980s, which asserts that random graphs, with high probability, have simple spectrum (in other words, their adjacency matrix has no repeated eigenvalues).
Time allows, we will discuss connections to other areas of mathematics, and mention few open problems.
(Joint work with Terence Tao and Hoi Nguyen)