Loading...
Please wait, while we are loading the content...
Some remarks on the computation of conjugacy classes of soluble groups
| Content Provider | Scilit |
|---|---|
| Author | Mecky, M. Neubüser, J. |
| Copyright Year | 1989 |
| Description | 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. |
| Related Links | https://www.cambridge.org/core/services/aop-cambridge-core/content/view/9DB0F0EAF80365431227009B9EE172DC/S0004972700004378a.pdf/div-class-title-some-remarks-on-the-computation-of-conjugacy-classes-of-soluble-groups-div.pdf |
| Ending Page | 292 |
| Page Count | 12 |
| Starting Page | 281 |
| ISSN | 00049727 |
| e-ISSN | 17551633 |
| DOI | 10.1017/s0004972700004378 |
| Journal | Bulletin of the Australian Mathematical Society |
| Issue Number | 2 |
| Volume Number | 40 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 1989-10-01 |
| Access Restriction | Open |
| Subject Keyword | Bulletin of the Australian Mathematical Society Applied Mathematics Conjugacy Class |
| Content Type | Text |
| Resource Type | Article |
| Subject | Mathematics |
