Introduction to Category Theory

Related lectures (30)

Page 1 of 3

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

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

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

Explores building categories from graphs and the encoding of information by functors.

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

Introduces the concept of categories essential for understanding group theory.

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

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

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

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