On the orbits of a finite solvable primitive linear group
Computational methods for problems pertaining to group theory (20-08) Primitive groups (20B15) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Linear algebraic groups over finite fields (20G40)
This paper strengthens a classical result of \textit{S.~M.~Seager} [J. Algebra 105, 389--394 (1987; Zbl 0606.20002)] concerning the number of orbits of solvable primitive linear groups. The main contribution consists in completely eliminating the list of exceptional cases that appeared in the original theorem, proving that the inequality\N\[\Nr > \frac{p^{n/2}}{12n} + 1\N\]\Nalways holds without exceptions when a solvable primitive subgroup \(G\) of \(\mathrm{GL}(n,p)\) is not permutation-isomorphic to a subgroup of the semilinear group \(\Gamma(p^{n})\).\N\NThe proof strategy combines theoretical bounds on group orders with intensive computational calculations using GAP and Magma. The authors utilize the known structure of primitive solvable groups (Theorem 2.2 from the literature), which decomposes \(G\) through a chain of normal subgroups involving the Fitting subgroup, extraspecial groups and fixed-point-free actions. Lemmas 2.3 and 2.4 provide upper bounds for the group order, crucial for estimating the minimum number of orbits. The third section systematically verifies all ten exceptional cases, four by elementary orbit counting and six through explicit computational constructions with code available on GitHub.
- A bound on the rank of primitive solvable permutation groups
- A lower bound for the number of conjugacy classes of a finite group.
- A polynomial-time algorithm for the change-making problem
- Classifying primitive solvable permutation groups of rank \(5\) and \(6\)
- Finite groups have even more conjugacy classes.
- Groups with few conjugacy classes.
- Large orbits in coprime actions of solvable groups
- On The Number of Conjugacy Classes of a Finite Solvable Group
- On the number of conjugacy classes of a finite solvable group. II.
- Orbit sizes and character degrees, II
- Prime divisors and the number of conjugacy classes of finite groups
- Regular orbits of finite primitive solvable groups, the final classification
- The Magma algebra system. I: The user language
- The rank of a finite primitive solvable permutation group
This page was built for publication: On the orbits of a finite solvable primitive linear group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918001)
