Lectures related to Networks: Definitions

Covers the introduction to categories, including definitions and examples.

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Covers the fundamentals of integer programming and network flows in directed graphs.

Covers the concept of renormalization in Algebraic Quantum Field Theory.

Introduces categories, concrete examples, opposite categories, and isomorphisms, leading to groupoids.