Fixers and derangements of finite permutation groups
Let \(G\) be a non-trivial transitive permutation group acting on a finite set \(\Omega\) with point stabilizer \(H\). A subgroup \(K\) of \(G\) is called a fixer if every element in \(K\) has a fixed point (on \(\Omega\)).\N\NThere are two sources of motivation for studying fixers. By determining the orders of fixers, it is possible to give a lower bound for the number of derangements (fixed-point-free permutations) in \(G\). The other motivation comes from extremal set theory, from the famous Erdős-Ko-Rado theorem.\N\NA fixer is called stable if it lies in a conjugate of \(H\), otherwise it is called non-stable. Let \(G\) be an almost simple primitive group with socle \(\mathrm{PSL}(2,q)\) for a prime power \(q\). The first main theorem of the paper is the following. Let \(K\) be a subgroup of \(G\) with \(|K| \geq |H|\). Then \(K\) is a non-stable fixer if and only if \(K\) is \(G\)-conjugate to a subgroup described in a relatively short table.\N\NThe first application of this result is a full description of primitive permutation groups \(G\) with socle \(\mathrm{PSL}(2,q)\) for which every fixer has size at most \(|H|\) and the second application states that the invariant\N\[\N\rho_{0}(G):= \max \left\{ \tfrac{|K|}{|H| \sqrt{|\Omega|}} : K \leq G \text{ is a fixer} \right\},\N\]\Ndefined for every non-trivial transitive permutation group \(G\), is less than \(1/\sqrt{2}\) for \(G\) a primitive group with socle \(\mathrm{PSL}(2,q)\). This latter result may be considered as a first step towards proving the conjecture that \(\rho_{0}(G) \leq 1\) for all almost simple primitive groups \(G\), which is equivalent to another conjecture, namely that there exists an absolute constant \(c\) such that \(\rho_{0}(G) \leq c\) for all finite primitive permutation groups \(G\).\N\NFor a non-trivial transitive permutation group \(G\), let\N\[\N\rho_{1}(G):= \max \left\{ \tfrac{|K|}{|H| \sqrt{|\Omega|}} : K \leq G \text{ is a fixer and } K \text{ is a maximal subgroup of } G \right\}.\N\]\NIt is proved that \(\rho_{1}(G) \leq \sqrt{2/5}\) when \(G\) is an almost simple primitive group with socle an alternating or a sporadic simple group.\N\NLet \(G\) be a finite group, let \(H_1\), \(H_2\) be maximal (core-free) subgroups in \(G\) and let \(\pi_1\), \(\pi_2\) be the permutation characters of the corresponding primitive permutation representations of \(G\). Let \(D(G,H_{1})\) and \(D(G,H_{2})\) be the sets of derangements in \(G\) with respect to the two actions of \(G\) respectively. \textit{P. Spiga} [J. Algebra 299, No. 1, 1--7 (2006; Zbl 1102.20001)] conjectured the following: if \(D(G,H_{1}) = D(G,H_{2})\), then either \(\pi_{1} = \pi_{2}\) or one of \(\pi_{1} - \pi_{2}\) and \(\pi_{2} - \pi_{1}\) is a character of \(G\). In this paper, this conjecture is proved for all groups \(G\) with socle \(\mathrm{PSL}(2,q)\).
- An Erdős-Ko-Rado theorem for finite 2-transitive groups
- Characterization of intersecting families of maximum size in \(\mathrm{PSL}(2,q)\)
- Classical Groups, Derangements and Primes
- Computing conjugacy class representatives in permutation groups.
- Conjugacy class sizes in affine semi-linear groups
- Covering subgroups of groups and Kronecker classes of fields
- Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
- Endliche Gruppen I
- Erdős-Ko-Rado theorems. Algebraic approaches
- Finite groups with a cyclic maximal subgroup
- Finite primitive permutation groups containing a permutation having at most four cycles
- Fixed point ratios for finite primitive groups and applications
- scientific article; zbMATH DE number 5995471 (Why is no real title available?)
- scientific article; zbMATH DE number 4055862 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 1111401 (Why is no real title available?)
- scientific article; zbMATH DE number 1151371 (Why is no real title available?)
- Intersecting families of permutations
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Kronecker classes of algebraic number fields
- On a conjecture on the permutation characters of finite primitive groups
- On a relation between the rank and the proportion of derangements in finite transitive permutation groups.
- On finite groups in which cyclic subgroups of the same order are conjugate.
- On the diophantine equation ${n \choose k} = x^l$
- On the interval containing at least one prime number
- On the maximum number of permutations with given maximal or minimal distance
- On the minimal degree of a primitive permutation group
- On the number of fixed point free elements in a permutation group
- On the orders of primitive groups
- On the theory of power residues
- Permutation characters and fixed-point-free elements in permutation groups.
- Primary cyclotomic units and a proof of Catalans conjecture
- Research on substitutions.
- Simple groups, fixed point ratios and applications
- Some Erdös-Ko-Rado results for linear and affine groups of degree two
- Sur la limite de transitivité des groupes non alternés.
- The Erdős-Ko-Rado property for some permutation groups
- The Magma algebra system. I: The user language
- The maximal subgroups of the low-dimensional finite classical groups.
- The maximal subgroups of the monster
- The primitive groups of class \(2p\) which contain a substitution of order \(p\) and degree \(2p\).
This page was built for publication: Fixers and derangements of finite permutation groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6942666)
