Introduction to Categories

Related lectures (30)

Page 1 of 3

Covers the introduction to categories, including definitions and examples.

Covers the definition of a group, properties of symmetries, and group operations.

Covers the basics of categories and functors, exploring properties, composition, and uniqueness in category theory.

Explores causal inference, directed graphs, and fairness in algorithms, emphasizing conditional independence and the implications of DAGs.

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

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

Explores examples of categories, morphisms, groupoids, and functors in category theory.

Covers the fundamental notion of composition in directed graphs and provides examples of their representation.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

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