Abstract
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.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. [16] Schneider C. , ‘Dixon's character table algorithm revisited’, (Universität Essen and University of Sydney. preprint).
2. [17] SOGOS Manual (Lehrstuhl D für Mathematik, RWTH Aachen, 1982); revised version 1988.
3. [10] Havas G. and Nicholson T. , ‘Collection’, in SYMSAC, 1976 (ACM, 1976), Editor Jenks R.D. . 9–14.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献