Maximal Matroids in Weak Order Posets
Combinatorics Seminar
23rd March 2021, 11:00 am – 12:00 pm
Virtual (online) Zoom seminar; a link will be sent to the Bristol Combinatorics Seminar mailing list, the week before the seminar.
Let X be a family of subsets of a finite set E. A matroid on E is said to be an X-matroid if each set in X is a circuit. We consider the problem of determining when there exists a unique maximal X-matroid in the weak order poset of all X-matroids on E. This is joint work with Katie Clinch and Shin-Ichi Tanigawa.
Organisers: David Ellis, Brendan Murphy
Comments are closed.