The fixity of permutation groups
classification of finite simple groupsderived lengthfinite permutation groupsfixityminimal degreenilpotent groupsnumbers of fixed pointsprimitive permutation groupssolvable groupstransitive permutation groups
General theory for finite permutation groups (20B05) Primitive groups (20B15) Multiply transitive finite groups (20B20) Finite simple groups and their classification (20D05) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Finite nilpotent groups, (p)-groups (20D15) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
By definition, the fixity of a finite permutation group \(G\) is the maximal number of fixed points of a non-identity element of \(G\); so if \(f\) denotes the fixity of \(G\) and \(n\) the degree of \(G\) then \(n-f\) is the minimal degree of \(G\). The authors prove some general theorems on transitive permutation groups \(G\) with given fixity \(f>0\) where \(G\) is supposed in addition to be nilpotent (Theorem 1.1), solvable (Theorem 1.2) or primitive (Theorem 1.3). If \(G\) is nilpotent then \(G\) has a subgroup whose index and nilpotency class are both bounded by a function of \(f\). If \(G\) is primitive then either \(G\) has a solvable subgroup of derived length at most 4 whose index is bounded by a function of \(f\) or \(G\) is almost simple with \(F^*(G)\) similar to \(\text{PSL}(2,q)\) or \(Sz(q)\) in its natural doubly-transitive representation. Of course, the last-mentioned deep theorem depends on the classification of finite simple groups.
- On fixed points of elements in primitive permutation groups.
- The proportion of fixed-point-free elements of a transitive permutation group
- On the involution fixity of simple groups
- Primitive sharp permutation groups with large solvable subgroups
- On the number of fixed point free elements in a permutation group
- Fixed point spaces in primitive actions of simple algebraic groups.
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- On a theorem of Blichfeldt
- Permutation characters and fixed-point-free elements in permutation groups.
- Nilpotency, solvability, and the twisting function of finite groups.
- The proportion of fixed-point-free elements of a transitive permutation group
- On the involution fixity of exceptional groups of Lie type
- On fixed points of elements in primitive permutation groups.
- The Fixity of Groups of Prime-Power Order
- Fixed price of groups and percolation
- On the involution fixity of simple groups
- Permutation groups where non-trivial elements have few fixed points
- Binary linear codes with near-extremal maximum distance
- Cartan coherent configurations
- Primitive sharp permutation groups with large solvable subgroups
- Finite groups and almost free actions.
- Vertex-transitive graphs with small motion and transitive permutation groups with small minimal degree
- On fixity of arc-transitive graphs
This page was built for publication: The fixity of permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1895606)
