Matroids are combinatorial objects that generalise mathematical objects
from linear algebra, graph theory, matching theory, and many other areas.
In this talk, I will present several ways in which classical results from coding theory may be generalized with respect to matroids, and I will explain why such generalizations are interesting. Designs, graphs, and some big polynomials will be making guest appearances.
The talk is intended for a general audience.
After the seminar we will take the speaker to lunch.
See the Algebra Seminar web page for information about other seminars in the series.
Anthony Henderson firstname.lastname@example.org.