Thomas Britz (University of New South Wales)

Friday 16th March, 12.05-12.55pm, Carslaw 375 (***NEW ROOM***)

Codes, matroids, designs, and graphs - and big polynomials

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.