| |
| | Conjugacy |
 | | : Construct the conjugacy classes of elements for a matrix group G using an algorithm that searches for representatives of all conjugacy of G by examining a random selection of group elements and their powers. |
 | | Before describing the effect of these parameters, some definitions are needed: A mapping f: G -> I is called a class invariant if f(g) = f(g^h) for all g, h in G. In matrix groups, the primary invariant factors are used where possible, or the characteristic or minimal polynomials otherwise. |
 | | Given a group G, and a sequence Q of k distinct elements of G, one from each conjugacy class, use Q to define the classes attribute of G. The sequence Q may be either a sequence of elements of G or, preferably, a sequence of pairs |
| www.math.lsu.edu /magma/text298.htm (1164 words) |
|