#### Filter Results:

#### Publication Year

1984

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Martin Schh, Hans Ulrich Besche, Thomas Breuer, Frank Celler, Bettina Eick, Volkmar Felsch +8 others
- 1995

We assign names and new generators to the transitive groups of degree up to 15, reeecting their structure. The classiication of transitive permutation groups has been pursued for over a century since the Grand Prix of the Acad emie des Sciences in 1858 Aca58]. An account of early work is given in Bur98] and Mil35], a very readable historical outline can be… (More)

- Alexander Hulpke, And´akos Seress
- 2001

We give a presentation of length O log 2 |G| for the groups G ∼ = PSU 3 (q). This result has applications in recent algorithms to compute the structure of permutation groups and matrix groups.

The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable normal subgroups to compute the conju-gacy classes of a finite group.

This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30.

This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors.

This note presents a new algorithm for the computation of the set of normal subgroups of a finite group. It is based on lifting via homomorphic images.

We introduce a new algorithm to compute up to conjugacy the maximal subgroups of a finite permutation group. Or method uses a " hybrid group " approach; that is, we first compute a large solvable normal subgroup of the given permutation group and then use this to split the computation in various parts.

- J Rafael Sendra, Spain, Austin Lobo, Maki Iwami, Wen-Shin Lee, Clement Pernet +41 others
- 2002

ISSAC is the yearly premier international symposium in Symbolic and Algebraic Computation. It provides an opportunity to learn of new developments and to present original research results in all areas of symbolic mathematical computation. Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor… (More)