Ramanujan Graphs: Constructions and Similarities

Related lectures (32)

Page 3 of 4

Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.

Covers linear inequalities, active constraints, and equivalent linear programs.

Covers the fundamentals of quantum chemistry, including valence bond theory and molecular orbitals.

Series covers spherical coordinates, harmonics, Legendre polynomials, and angular momentum.

Explores the wave-particle duality in quantum chemistry, covering interference phenomena and energy quantization.

Explores spectroscopy concepts such as Rayleigh scattering and energy levels.

Covers the basics of quantum chemistry and the Hartree-Fock method.

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Explores Markov's theorem, Chernoff bound, and probability theory fundamentals, including good coloring, 2-colorable graphs, and rare events.

Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.