Matroids are abstract structures that generalize the notion of linear independence in vector spaces. They have many equivalent definitions and applications in various fields such as geometry, topology, optimization, network theory and coding theory. Matroid theory borrows from both linear algebra and graph theory.

Carnegie Mellon University

Fall 2021

This course provides a comprehensive introduction to Discrete Mathematics, emphasizing the application of these concepts in Computer Science. Topics include counting, recurrence relations, combinatorial games, Polya theory, and more.

No concepts data

+ 13 more concepts