Maximal Matroids in Weak Order Posets
Abstract
Let be a family of subsets of a finite set E. A matroid on E is called an -matroid if each set in is a circuit. We consider the problem of determining when there exists a unique maximal -matroid in the weak order poset of all -matroids on E, and characterizing its rank function when it exists.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.