#7886: Implement conjugacy classes
-------------------------------------+--------------------------------------
       Reporter:  jlopez             |         Owner:  joyner      
           Type:  enhancement        |        Status:  needs_review
       Priority:  major              |     Milestone:  sage-5.7    
      Component:  group theory       |    Resolution:              
       Keywords:                     |   Work issues:              
Report Upstream:  N/A                |     Reviewers:  David Joyner
        Authors:  Javier López Peña  |     Merged in:              
   Dependencies:                     |      Stopgaps:              
-------------------------------------+--------------------------------------

Comment (by tscrim):

 Hey,

 Thank you for working on this. However there are multiple docstring issues
 you will need to address. More specifically, you will need to change (for
 example)
 {{{
 EXAMPLES:
     sage: H = MatrixGroup([matrix(GF(5),2,[1,2, -1, 1]), matrix(GF(5),2,
 [1,1, 0,1])])
     sage: h = H(matrix(GF(5),2,[1,2, -1, 1]))
     sage: H.conjugacy_class(h)
     ...

 #####

 TODO:
     - Implement a non-naive fallback method for computing all the elements
 of
     the conjugacy class when the group is not defined in GAP, as the one
 in
     Butler's paper.
     - Define a sage method for gap matrices so that groups of matrices can
     use the quicker GAP algorithm rather than the naive one.

 EXAMPLES::

 - Conjugacy classes for groups of permutations

     sage: G = SymmetricGroup(4)
     ...
 }}}
 to
 {{{
 EXAMPLES::

     sage: H = MatrixGroup([matrix(GF(5),2,[1,2, -1, 1]), matrix(GF(5),2,
 [1,1, 0,1])])
     sage: h = H(matrix(GF(5),2,[1,2, -1, 1]))
     sage: H.conjugacy_class(h)
     ...

 ####


 .. TODO::

     - Implement a non-naive fallback method for computing all the elements
 of
       the conjugacy class when the group is not defined in GAP, as the one
 in
       Butler's paper.
     - Define a sage method for gap matrices so that groups of matrices can
       use the quicker GAP algorithm rather than the naive one.

 EXAMPLES:

 Conjugacy classes for groups of permutations::

     sage: G = SymmetricGroup(4)
     ...
 }}}
 otherwise the formatting will be incorrect (the convention is not to use
 bullet points for different examples). For a full description, see
 [http://www.sagemath.org/doc/developer/conventions.html: the conventions
 page].

 Also you will need to cleanup the patch's header message.

 Thanks,[[BR]]
 Travis

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7886#comment:18>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica, 
and MATLAB

-- 
You received this message because you are subscribed to the Google Groups 
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email 
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.


Reply via email to