Add to ORKGWe describe the theory and implementation of practical algorithms for computing chief and composition series and socles in large permutation groups. The theory is valid for permutation degrees up to 10 000 000, and the current implementations in the Magma system are practical up to degrees of 1 000 000 for some examples. Several of the techniques involved are based on ideas of Kantor. (C) 1997 Academic Press Limited
We study some general algorithms for processing permutations and permu-tation groups and consider th...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of...
AbstractWe describe the theory and implementation of practical algorithms for computing chief and co...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
New techniques, both theoretical and practical, are presented for constructing a permutation represe...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We study some general algorithms for processing permutations and permutation groups and consider the...
We study some general algorithms for processing permutations and permu-tation groups and consider th...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of...
AbstractWe describe the theory and implementation of practical algorithms for computing chief and co...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
Theory of permutation group algorithms for graduates and above. Exercises and hints for implementati...
We describe an algorithm for computing a chief series, the soluble radical, and two other characteri...
New techniques, both theoretical and practical, are presented for constructing a permutation represe...
AbstractA technique for computing in permutation groups of high degree is developed. The technique u...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We describe the integration of permutation group algorithms with proof planning. We consider eight b...
We study some general algorithms for processing permutations and permutation groups and consider the...
We study some general algorithms for processing permutations and permu-tation groups and consider th...
AbstractWe describe the theory and implementation of a practical algorithm for computing a Sylow sub...
We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of...