Abstract
By using the following theoretical and computational algorithms , we determined the solvable subgroups of large order of the finite non-abelian simple linear groups G = L2(p) = PSL(2,p) , for p≥5 and p is a prime number , also their presentations and permutation representations have been found .
Highlights
We study theoreticaly the following : Determining the solvable subgroups of large order S of L2(p), p≥5 and finding their structures up to isomorphisms
By using the following theoretical and computational algorithms, we determined the solvable subgroups of large order of the finite non-abelian simple linear groups G = L2(p) = PSL(2,p), for p≥5 and p is a prime number, their presentations and permutation representations have been found
Since any solvable subgroup of large order S of G is either one of the maximal subgroups of G or it is contained in one of them, so we have to deal with the maximal subgroups of G
Summary
We study theoreticaly the following : Determining the solvable subgroups of large order S of L2(p) , p≥5 and finding their structures up to isomorphisms. Finding the presentation of S , we find its generators from its character table.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
