Lectures related to Ramanujan Graphs: Generating Functions and Expander Graphs

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

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.

Covers the graphical definition of functions, focusing on level sets and domains.

Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.

Covers derivatives and continuity in multivariable functions, emphasizing the importance of partial derivatives.

Covers topics related to probability and statistics, including finding specific values and significant events.

Covers the properties and operations of convex functions.

Explores finding the equation of the tangent line to a function's graph at a point.