#15612: We need unordered trees
---------------------------------+-----------------------------
Reporter: darij | Owner:
Type: task | Status: new
Priority: major | Milestone: sage-wishlist
Component: combinatorics | Resolution:
Keywords: trees | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+-----------------------------
Comment (by darij):
There is something that I'm still kind-of missing: The labelled rooted
trees on {1, 2, ..., n}. We don't have them, do we? They can be
implemented as lists (g(1), g(2), ..., g(n)), where g(i) is the father of
i if such a father exists and 0 else. They are a basis for a Hopf algebra,
and I still have some ancient code that defines this Hopf algebra
(although I'm not sure about the quality of that code). What could be
tricky: Can we make them inherit from `LabelledRootedTree`, or only
convert to such?
--
Ticket URL: <http://trac.sagemath.org/ticket/15612#comment:11>
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.
