Lecture
This lecture covers the constructions and similarities of Ramanujan graphs, focusing on the matching polynomials and perfect matchings. The instructor explains the building methods and the high probability choices involved. The lecture also delves into the differences between group theory and Ramanujan graphs, highlighting open problems in the field. Additionally, the concept of random walks on universal covers is discussed, along with the theory of expected characteristic polynomials. The lecture concludes with a detailed exploration of quantitation and qualitative aspects, emphasizing the challenges and functions related to soft matrices and root calculations.