On the number of fixed point free elements in a permutation group (Q1199592): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:29, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of fixed point free elements in a permutation group |
scientific article |
Statements
On the number of fixed point free elements in a permutation group (English)
0 references
16 January 1993
0 references
The following theorem is proved: Suppose that \(G\) is a transitive permutation group of degree \(n\) with permutation rank \(r\) and minimal degree \(d\). Then the number \(f_ 0\) of elements of \(G\) without fixed points satisfies \(f_ 0 \geq ((r - 1) | G| - d(n - 1))/(n - d)\) with equality if and only if each element of \(G\) fixes at least \(n - d\) or at most 1 point. It is shown that estimates for the size of the minimal degree \(d\) either elementary (due to L. Babai) or using the classification of finite simple groups (due to Liebeck and Saxl) give lower bounds in terms of \(r\) and \(d\) only.
0 references
fixed-point free elements
0 references
transitive permutation group
0 references
degree
0 references
permutation rank
0 references
minimal degree
0 references
lower bounds
0 references