Sciweavers

2414 search results - page 1 / 483
» Computing Normal Subgroups
Sort
View
ISSAC
1998
Springer
106views Mathematics» more  ISSAC 1998»
14 years 3 months ago
Computing Normal Subgroups
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.
Alexander Hulpke
MOC
2000
85views more  MOC 2000»
13 years 10 months ago
Conjugacy classes in finite permutation groups via homomorphic images
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 n...
Alexander Hulpke
FOCS
1992
IEEE
14 years 3 months ago
Computing in Solvable Matrix Groups
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
Eugene M. Luks
GC
2006
Springer
13 years 11 months ago
Reconstructing under Group Actions
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...
A. J. Radcliffe, Alex D. Scott
DM
2002
87views more  DM 2002»
13 years 10 months ago
Finite locally-quasiprimitive graphs
A
Cai Heng Li, Cheryl E. Praeger, Akshay Venkatesh, ...