We describe a significantly improved algorithm for computing the conjugacy classes of a finite permutation group with trivial soluble radical. We rely on existing methods for groups that are almost simple, and we are concerned here only with the reduction of the general case to the almost simple case. (c) 2006 Elsevier Inc. All rights reserved
© 2019, Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag GmbH Germany, part of ...
Abstract. We present explicit upper bounds for the number and size of conjugacy classes in finite Ch...
Abstract. Denote by k(G) the number of conjugacy classes of a group G. Some inequalities are deduced...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
A new method for computing the conjugacy classes of subgroups of a finite group is described. (C) 20...
Abstract. The lifting of results from factor groups to the full group is a standard technique for so...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
For a finite group G, let k(G) denote the number of conjugacy classes of G. If G is a finite permuta...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractNew techniques, both theoretical and practical, are presented for constructing permutation r...
Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK−1 = 1 ∪ D ...
AbstractFor a finite groupG, letk(G) denote the number of conjugacy classes ofG. We prove that a sim...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
© 2019, Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag GmbH Germany, part of ...
Abstract. We present explicit upper bounds for the number and size of conjugacy classes in finite Ch...
Abstract. Denote by k(G) the number of conjugacy classes of a group G. Some inequalities are deduced...
AbstractWe describe a significantly improved algorithm for computing the conjugacy classes of a fini...
A new method for computing the conjugacy classes of subgroups of a finite group is described. (C) 20...
Abstract. The lifting of results from factor groups to the full group is a standard technique for so...
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
We describe a practical algorithm for computing representatives of the conjugacy classes of maximal ...
For a finite group G, let k(G) denote the number of conjugacy classes of G. If G is a finite permuta...
AbstractA new method for computing the conjugacy classes of subgroups of a finite group is described
AbstractAlgorithms for computing the soluble radical and p-cores of a permutation group are describe...
AbstractNew techniques, both theoretical and practical, are presented for constructing permutation r...
Suppose that G is a finite group and K is a non-trivial conjugacy class of G such that KK−1 = 1 ∪ D ...
AbstractFor a finite groupG, letk(G) denote the number of conjugacy classes ofG. We prove that a sim...
This thesis is a survey of certain algorithmic problems in group theory and their computational c...
© 2019, Fondazione Annali di Matematica Pura ed Applicata and Springer-Verlag GmbH Germany, part of ...
Abstract. We present explicit upper bounds for the number and size of conjugacy classes in finite Ch...
Abstract. Denote by k(G) the number of conjugacy classes of a group G. Some inequalities are deduced...