Lectures related to Matroids: Matroid Intersection

Local Homeomorphisms and Coverings

Covers the concepts of local homeomorphisms and coverings in manifolds, emphasizing the conditions under which a map is considered a local homeomorphism or a covering.

Max-flow and Disjoint Sets

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Interlacing Families and Ramanujan Graphs

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.

Cheeger's Inequality

Explores Cheeger's inequality and its implications in graph theory.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Cartesian Product and Induction

Introduces Cartesian product and induction for proofs using integers and sets.

Message passing in graphical models

Explains message passing in graphical models and the matching problem in graph theory.

Linear Programming: Weighted Bipartite Matching

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Linear Programming Duality

Covers linear programming duality and complementary slackness condition.