UM Math Graduate Student Seminar

Alexander Lazar
University of Miami

will present

Matroids and the Greedy Algorithm

Friday, January 29, 2016, 5:00pm
Ungar Building Room 402


Abstract:

Matroids are combinatorial objects that generalize notions of independence and dimension from combinatorics, linear algebra, and geometry. In this talk, we will present several equivalent definitions of Matroids, and in particular a definition that relates Matroids to problems for which the Greedy Algorithm provides a solution. We will also, if time permits, introduce the Tutte Polynomial, a matroid invariant that generalizes the chromatic polynomial from graph theory.

 


Back to the seminar's page