> If you have an *ordered set* there is a canonical way to define one > permutation from a partition. You make it so that the atom of the partitions > are your cycles.
Yeah, sort everything. Wonder when something like that can be useful. This being said, this class does not assume that the ground set is totally ordered, so having this here is not possible. > That being said: .to_permutation (and .to_whatever in general) are terrible > names. Don't make me answer that. So, what do you advise we should do with this function? Nathann -- You received this message because you are subscribed to the Google Groups "sage-devel" 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 https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
