Bases for permutation groups and matroids

DOI10.1016/0195-6698(95)90035-7MaRDI QIDQ1902960zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron, Dmitry G. Fon-Der-Flaass

Publication date 13 May 1996

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0195-6698(95)90035-7

zbMATH Keywords

flatgroup actionirredundant basismatroidperfect matroid designpermutation groupstabilizer

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) General theory for finite permutation groups (20B05)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 663788
• Geometric sets of permutations
• Base sizes for \(\mathcal S\)-actions of finite classical groups.
• scientific article; zbMATH DE number 5851286
• On base sizes for symmetric groups

Cites work

• Cofinitary Permutation Groups
• Combinatorial Relations and Chromatic Graphs
• Homogeneous designs and geometric lattices
• scientific article; zbMATH DE number 3811825 (Why is no real title available?)
• scientific article; zbMATH DE number 3941546 (Why is no real title available?)
• scientific article; zbMATH DE number 4099270 (Why is no real title available?)
• scientific article; zbMATH DE number 3223737 (Why is no real title available?)
• Infinite geometric groups of rank 4
• Kennzeichnung endlicher linearer Gruppen als Permutationsgruppen
• Minimum bases for permutation groups: The greedy approximation
• On a class of doubly transitive permutation groups
• On a class of doubly transitive permutation groups
• On Permutation Geometries
• Random Permutations: Some Group-Theoretic Aspects
• Sharp sets of permutations
• Triply transitive groups in which only the identity fixes four letters

Cited in

(21)

• Geometric sets of permutations
• The full automorphism groups, determining sets and resolving sets of coprime graphs
• Primitive permutation IBIS groups
• scientific article; zbMATH DE number 5851286 (Why is no real title available?)
• On the single-orbit conjecture for uncoverings-by-bases
• scientific article; zbMATH DE number 4103717 (Why is no real title available?)
• scientific article; zbMATH DE number 1361379 (Why is no real title available?)
• Permutation bases
• scientific article; zbMATH DE number 663788 (Why is no real title available?)
• scientific article; zbMATH DE number 819123 (Why is no real title available?)
• scientific article; zbMATH DE number 870409 (Why is no real title available?)
• One point stabilizers in almost simple sharp permutation groups
• On the Saxl graph of a permutation group
• A classification of finite primitive IBIS groups with alternating socle
• Generation of all randomizations using circuits
• IBIS soluble linear groups
• Independence and bases: theme and variations
• On the cardinality of irredundant and minimal bases of finite permutation groups
• IBIS primitive groups of almost simple type
• Uncoverings-by-bases for base-transitive permutation groups.
• Permutation codes

This page was built for publication: Bases for permutation groups and matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902960)