#11529: Rooted trees
-------------------------------------+-------------------------------------
Reporter: hivert | Owner: hivert
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.5
Component: combinatorics | Resolution:
Keywords: rooted trees, | Merged in:
Cayley | Reviewers:
Authors: Florent Hivert | Work issues:
Report Upstream: N/A | Commit:
Branch: | 3e619b011df83fe7782a2b31c35354f1dd4dfda6
u/chapoton/11529_alone | Stopgaps:
Dependencies: #11407 |
-------------------------------------+-------------------------------------
Comment (by darij):
OK, I am not saying that this nondeterminism is bad, but I think it is
avoidable in this specific setting. When it comes to building
combinatorial Hopf algebras, I don't want to have to harden all the
doctests because a change somewhere else might lead to all trees getting
rotated. What do you think about my deterministic normalization method in
public/combinat/11529 ?
--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:26>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
