On Monday, September 29, 2014 1:50:32 PM UTC+1, Nathann Cohen wrote: > > > Then there is an easy normal form, sort the vertex labels and permute > the > > Hasse diagram accordingly. > <= is always a total order ? >
If they are all distinct then <= is the same as < If < is not a total order then you need to define the permutation with respect to a chosen set of vertex labels (another UniqueRepresentation for vertex label set). Though frankly I'd be happy to require that vertex labels are sortable if distinct. If == is not transitive then you have to define what you mean by "same" set of points. -- 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 sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
