#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: | a4b4c6ee3ce9f82864e3b179380517ff123582ef
u/chapoton/11529_alone | Stopgaps:
Dependencies: #11407 |
-------------------------------------+-------------------------------------
Comment (by tscrim):
Replying to [comment:18 darij]:
> These are (rooted) trees modulo permutation of children, right? I'm
asking because I don't see much of a documentation here.
From looking at the code and the `normalize()` doctest, that is right
(i.e., they are not ordered/planer trees). I think we need to expand the
documentation before this can get into Sage.
> (Let me add that I have never seen them called "Cayley trees" in my
life. This notation contradicts http://en.wikipedia.org/wiki/Bethe_lattice
and http://mathworld.wolfram.com/CayleyTree.html .)
+1 from me to removing this terminology (at least for now since Cayley
trees aren't implemented).
--
Ticket URL: <http://trac.sagemath.org/ticket/11529#comment:19>
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.
