#14319: Automorphism group with labeled vertices
-------------------------------------------------+-------------------------
       Reporter:  ncohen                         |        Owner:  jason,
           Type:  enhancement                    |  ncohen, rlm
       Priority:  major                          |       Status:  closed
      Component:  graph theory                   |    Milestone:  sage-5.10
       Keywords:                                 |   Resolution:  fixed
        Authors:  Nathann Cohen                  |    Merged in:
Report Upstream:  N/A                            |  sage-5.10.beta2
         Branch:                                 |    Reviewers:  Volker
   Dependencies:  #14291, #14250, #14477,        |  Braun
  #14435                                         |  Work issues:
                                                 |       Commit:
                                                 |     Stopgaps:
-------------------------------------------------+-------------------------

Comment (by ncohen):

 Yoooooo !

 > Yes it does! When the domain is 1...n it gives you the permutation in
 > the usual list notation, which is a basic feature!

 I understand that this information is useful in this case, the scope of
 `PermutationGroupElement` is much larger than that.

 > And otherwise it
 > still shows how the elements of the domain are permuted which is a
 > worthwhile information;

 Isn't that machine-dependent when domain is a set ?

 > If there is something to be contested it's that self.domain() returns
 > the domain with its elements permuted; I would just return the domain
 > of the parent (like other functions do in Sage).

 No objection to that.

 What would be the problem of a `.to_permutation` method (the findstat guys
 would love that) which would output the permutation of `1...n`
 corresponding to the element ? When the domain is not 1...n they could be
 relabeled "in any way" (i.e. the ordering of `.domain()`) to return a
 permutation of 1...n, and when the domain IS 1...n then it could return
 the list that you expect ?

 Or you could also implement something in the constructor of `Permutation`
 which would do the same, what do you think ?

 Why the hell do we have both `Permutation` and `PermutationGroupElement`
 by the way ?

 Nathann

--
Ticket URL: <http://trac.sagemath.org/ticket/14319#comment:51>
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.
For more options, visit https://groups.google.com/groups/opt_out.

Reply via email to