flats M
flats(M, r)
flats(M, r, s)
A flat, or closed subset, of a matroid is a subset A of the ground set which equals its closure. The set of flats, partially ordered by inclusion, forms a lattice, called the lattice of flats. This is an important invariant of the matroid: one can recover the matroid from the lattice of flats, and for simple matroids (i.e. matroids whose circuits all have size >= 3), the isomorphism type of the lattice is already a complete invariant.
If a target rank r is provided, then this method returns the list of all rank r flats of M.
If a target corank r is provided along with the mode "corank", then this method computes all intersections of r distinct hyperplanes. This is guaranteed to contain all flats of rank = rank M - r (cf. Oxley, Prop. 1.7.8), and may be useful if the lattice of flats is large, and only the upper portion is required (such as in the Scum theorem).
|
|
|
|
In general, this method computes flats by iteratively intersecting hyperplanes of M. Thus if hyperplanes of M have been precomputed, then this function is typically much faster.
|
|
|
The object flats is a method function.
The source of this document is in Matroids/doc-Matroids.m2:1139:0.