Some remarks on the computation of conjugacy classes of soluble groups
1989 ◽
Vol 40
(2)
◽
pp. 281-292
◽
Keyword(s):
Laue et al have described basic algorithms for computing in a finite soluble group G given by an AG-presentation, among them a general algorithm for the computation of the orbits of such a group acting on some set Ω. Among other applications, this algorithm yields straightforwardly a method for the computation of the conjugacy classes of elements in such a group, which has been implemented in 1986 in FORTRAN within SOGOS by the first author and in 1987 in C within CAYLEY. However, for this particular problem one can do better, as discussed in this note.
1979 ◽
Vol 22
(3)
◽
pp. 191-194
◽
Keyword(s):
1969 ◽
Vol 1
(1)
◽
pp. 3-10
◽
Keyword(s):
1973 ◽
Vol 25
(4)
◽
pp. 862-869
◽
Keyword(s):
1975 ◽
Vol 27
(4)
◽
pp. 837-851
◽
2000 ◽
Vol 42
(1)
◽
pp. 67-74
◽
Keyword(s):
1972 ◽
Vol 7
(1)
◽
pp. 101-104
◽
1987 ◽
Vol 102
(3)
◽
pp. 431-441
◽
Keyword(s):
1976 ◽
Vol 19
(2)
◽
pp. 213-216
◽
1966 ◽
Vol 62
(3)
◽
pp. 339-346
◽
Keyword(s):
1973 ◽
Vol 16
(3)
◽
pp. 357-362
◽