The Solvable Primitive Permutation Groups of Degree at Most 6560-Reference-Cited by-同舟云学术

The Solvable Primitive Permutation Groups of Degree at Most 6560

Published:2003 Issue: Volume:6 Page:29-39
ISSN:1461-1570
Container-title:LMS Journal of Computation and Mathematics
language:en
Short-container-title:LMS J. Comput. Math.

Author:

Eick B.,Höfling B.

Abstract

AbstractThe authors present an algorithm to construct conjugacy class representatives of the solvable primitive subgroups of Sd for a given degree d. Using this method, they determine the solvable primitive permutation groups of degree at most 6560 (that is, 38 – 1), up to conjugacy.

Publisher

Wiley

Subject

Computational Theory and Mathematics,General Mathematics

Reference24 articles.

1. 24 Theissen Heiko , ‘Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen’, Dissertation, Rheinisch Westfälische Technische Hochschule, Aachen, Germany, 1997.

2. Computing Subgroups Invariant Under a Set of Automorphisms

3. Testing for isomorphism between finitely presented groups

4. 6 THE GAP GROUP, GAP- Groups, Algorithms, and Programming, Version 4.3 (The GAP Group, Aachen⁄St Andrews, 2002); http://www.gap-system.org.

5. Computing Matrix Group Decompositions with Respect to a Normal Subgroup

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Classifying finite monomial linear groups of prime degree in characteristic zero;International Journal of Algebra and Computation;2021-09-11

2. L. G. KOVÁCS AND LINEAR GROUPS;Journal of the Australian Mathematical Society;2016-05-12

3. The primitive permutation groups of degree less than 2500;Journal of Algebra;2005-10

4. LINEAR GROUPS OF SMALL DEGREE OVER FINITE FIELDS;International Journal of Algebra and Computation;2005-06

5. Constructing transitive permutation groups;Journal of Symbolic Computation;2005-01