Hi Christian, In CC: Vivien, Jean-Philippe,
By the way: positive_roots_by_height would be best implemented by adding this feature into TransitiveIdealGraded. Ideally, one could do: for x in H.positive_roots().subset(grade=3): Or at least, in the short run, and consistently with SearchForest: for x in H.positive_roots().elements_of_depth_iterator(3): In general, TransitiveIdeal and friends would need some love. Please create a ticket about it. PS: I discussed on Friday with Vivien Ripoll, and they need precisely this feature for positive roots in their project with Jean-Philippe Labbé. You might want to team up with the later, since you are both in Berlin, right? Cheers, Nicolas -- Nicolas M. Thiéry "Isil" <nthi...@users.sf.net> http://Nicolas.Thiery.name/ -- You received this message because you are subscribed to the Google Groups "sage-combinat-devel" group. To post to this group, send email to sage-combinat-devel@googlegroups.com. To unsubscribe from this group, send email to sage-combinat-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sage-combinat-devel?hl=en.