Am Donnerstag, 17. Dezember 2015 14:12:06 UTC+1 schrieb Nathann Cohen: > > > 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. > > How can we check that the ground set is totally ordered? Given such a check, we could simply raise an error if it's not totally ordered, no?
I'd like to stress that I did not use the method in a findstat context (no idea why it would matter though), but rather to test a conjecture. It's a entirely natural map. At the very least, the map SetPartition.standard_form() is a classical map in combinatorics, used for example in the context of non crossing set partitions. Martin -- 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.
