Hello, > How can we check that the ground set is totally ordered?
No idea. Furthermore, a set could be "totally ordered" because Python compares the elements according to their memory address. That's a total order, but totally unreliable as well. > Given such a > check, we could simply raise an error if it's not totally ordered, no? You mean that SetPartition would have a .to_partition method, but that this method would only work if some additional assumption is made on SetPartition? Honestly I would prefer all SetPartition methods to work on all SetPartition instances. Maybe it could be moved to another -- more specific -- class ? > 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. It is probably well-defined when the ground set consists of integers, but that is not an assumption that can be made in this class. Maybe what you need in an "IntegerSetPartition" ? 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.
