Groups generated by derangements
Jordan proved in 1872 that a finite transitive permutation group of degree \(n > 1\) must contain a derangement (an element with no fixed point). Let \(G\) be a transitive permutation group of degree \(n > 1\). Let \(D(G)\) be the (normal) subgroup of \(G\) generated by all derangements in \(G\). It was proved by \textit{H. Zantema} [Manuscr. Math. 40, 155--203 (1982; Zbl 0505.12003)] that \(D(G)\) is transitive and it contains every element of \(G\) whose number of fixed points is different from \(1\). In the present paper, the authors extend these ideas to show that if \(r_G\) and \(r_{D(G)}\) denote the permutation ranks of \(G\) and \(D(G)\) respectively then \(r_{D(G)} - 1 = (r_{G}-1) |G:D(G)|\). In Theorem 1.1 they also show that the \(D(G)\)-orbits on ordered pairs of distinct elements are permuted semiregularly by \(G/D(G)\). Observe that any Frobenius group \(G\) gives an example where \(D(G) \not= G\) since \(D(G)\) is the Frobenius kernel and \(G/D(G)\) is isomorphic to the Frobenius complement. Corollary 1.2 states that if \(G\) is any transitive permutation group of degree \(n > 1\) then \(|G:D(G)|\) divides \(n-1\) and equality is possible if and only if \(n\) is a prime power. Corollary 1.3 continues to investigate the situation when \(D(G) \not= G\) by establishing that in this case if \(H\) is a point stabilizer acting on the remaining points then at least half of the elements of \(H\) are derangements, in particular, \(D(H) = H\). Theorems 1.4 and 1.5 concern stronger upper bounds on the index of \(D(G)\) in \(G\) as that of Corollary 1.2. It is proved that if \(G\) is any transitive imprimitive permutation group of degree \(n\), then \(|G:D(G)| \leq \sqrt{n}-1\) and equality is possible if \(n\) is an even power of a prime. Moreover, if \(G\) is a primitive permutation group of degree \(n\) which is not of affine type, then \(|G:D(G)| \leq \sqrt{n}-1\). It is then conjectured that if \(G\) is a primitive permutation group of degree \(n\) which is not a Frobenius group, then \(|G:D(G)| \leq \sqrt{n}-1\), moreover this bound is attained only if \(G\) is an affine group. The only remaining case of Conjecture 1 is when \(G\) is an affine primitive permutation group. In the affine case the conjecture is translated to an equivalent form regarding the index \(|H:R(H)|\) where \(H\) is a linear group on a finite vector space and \(R(H)\) is the subgroup of \(H\) generated by elements having eigenvalue \(1\). An interesting question in the paper is the following. Which groups can arise as \(G/D(G)\) for some transitive permutation group \(G\)?
- A group action on derangements
- scientific article; zbMATH DE number 1560264
- scientific article; zbMATH DE number 1981750
- Groups generated by discrete sets of reflections
- scientific article; zbMATH DE number 863481
- scientific article; zbMATH DE number 894528
- scientific article; zbMATH DE number 1261512
- Permutation groups
- Generating sets of finite groups
- A census of small transitive groups and vertex-transitive graphs
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3715700 (Why is no real title available?)
- scientific article; zbMATH DE number 3758571 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 1261512 (Why is no real title available?)
- scientific article; zbMATH DE number 6194182 (Why is no real title available?)
- Integer valued polynomials over a number field
- On a theorem of Jordan
- On the maximal subgroups of the finite classical groups
- On the maximum orders of elements of finite almost simple groups and primitive permutation groups.
- On the number of fixed point free elements in a permutation group
- Primitive Subgroups of Wreath Products in Product Action
- The Magma algebra system. I: The user language
- The primitive permutation groups of degree less than 4096.
- The rational function analogue of a question of Schur and exceptionality of permutation representations
- Primitive permutation groups and derangements of prime power order.
- scientific article; zbMATH DE number 1981750 (Why is no real title available?)
- scientific article; zbMATH DE number 1560264 (Why is no real title available?)
- scientific article; zbMATH DE number 1795239 (Why is no real title available?)
- On a relation between the rank and the proportion of derangements in finite transitive permutation groups.
- scientific article; zbMATH DE number 1409237 (Why is no real title available?)
- A note on Frobenius groups
- On derangements and suborbits in finite transitive groups
- Cliques in derangement graphs for innately transitive groups
- Derangements in intransitive groups
- Derangements in non-Frobenius groups
- On derangements in simple permutation groups
- Transitive permutation groups in which all derangements are involutions.
This page was built for publication: Groups generated by derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222003)