Bases for permutation groups and matroids (Q1902960): Difference between revisions

If \(G\) is a permutation group acting on an \(n\)-set \(X\), then the bases of \(G\) are the sets of points of \(X\) that are (pointwise) fixed only by the identity of \(G\) (i.e., the sets with trivial stabilizer). An irredundant basis is an ordered basis such that no element is fixed by the joint stabilizer of the previous elements. It is shown that the special situation that all irredundant bases have the same cardinality holds exactly if they form the bases of a matroid \(M\). In this situation \(G\) acts geometrically on \(M\), that is, the fixed points of any \(g \in G\) form a flat of \(M\). Some partial results towards a classification of this situation are given. In the especially nice situation where \(G\) acts on a perfect matroid design enumerative consequences are derived.