|Date: Monday, November 27, 2017
Location: 3866 East Hall (4:00 PM to 5:00 PM)
Abstract: Matroids are a combinatorial structure that allow us to generalize the idea of linear independence and dependence to other objects. Major motivating examples come from graphs, where a matroid can be explicitly defined using a graph's cycles. We will explore several equivalent definitions of matroids, and translate tools in the context of vector spaces to tools we can use to study matroids. This talk will be accessible to all graduate students.
Speaker: Alana Huszar
Institution: University of Michigan