Abstract: The idea of linear independence is central to the study of vector spaces. Similarly, the idea of spanning trees is fundamental to the study of graph theory.
We will define matroids to generalize these two ideas and understand their properties. We will also look at applications of matroids in the study of simplicial complexes, ideals in polynomial rings, and the theory of algorithms.
To add/edit talks, please log in on the department web page, then return to Announce. Alternatively if you know the Announce
username/password, click the link below: