Abstract
These notes are concerned with the problem of creating new group libraries for the group-theory computer system GAP (groups, algorithms, and programming). Our main objective is to develop efficient algorithms that produce a list of maximal solvable subgroups of special linear groups of prime degree over a finite field and to implement it as part of the GAP. Bibliography: 5 titles.
Similar content being viewed by others
REFERENCES
M. Schönert et. al., GAP-Groups, Algorithms, and Programming, 5th edn., Lehrstuhl D Math., Rheinisch Westfällische Techn. Hochsch., Aachen, (1995).
D. A. Suprunenko, Matrix Groups (Transl. Math. Monographs, 45), Am. Math. Soc., Providence (1976).
M. W. Short, "The primitive soluble permutation groups of degree less than 256," Lect. Notes Math., 1519 (1992).
A. S. Detinko, "Solvable subgroups of unitary groups," Sib. Mat. Zh., 35, 286-293 (1994).
A. S. Detinko, "Maximal solvable subgroups of the special linear group over an arbitrary field," Sib. Mat. Zh., 33, 973-979 (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Detinko, A.S. A New GAP Group Library for Irreducible Maximal Solvable Subgroups of Prime Degree Classical Groups. Journal of Mathematical Sciences 108, 942–950 (2002). https://doi.org/10.1023/A:1013532103425
Issue Date:
DOI: https://doi.org/10.1023/A:1013532103425