The fixity of permutation groups (Q1895606)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 783908
Language Label Description Also known as
default for all languages
No label defined
    English
    The fixity of permutation groups
    scientific article; zbMATH DE number 783908

      Statements

      The fixity of permutation groups (English)
      0 references
      0 references
      0 references
      13 August 1995
      0 references
      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.
      0 references
      finite permutation groups
      0 references
      nilpotent groups
      0 references
      solvable groups
      0 references
      primitive permutation groups
      0 references
      fixity
      0 references
      numbers of fixed points
      0 references
      minimal degree
      0 references
      transitive permutation groups
      0 references
      derived length
      0 references
      classification of finite simple groups
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references