#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 chapoton):
Hello,
concerning the ranker, I do not care about the possible non-deterministic
aspect. There is no clear canonical way to generate and number all rooted
trees, so there is no best choice.
concerning the methods of `LabelledRootedTrees`, well, there is no
`LabelledRootedTrees_all`. And I do not think one need that for now.
At some point later, it would be good to have classes for labelled rooted
trees with labels in a fixed set. So far, all possible labels are allowed.
This is needed for operads.
It is true that the content of this ticket is rather minimalistic. But it
is enough for #15635, which is my main motivation.
--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:25>
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.
