Trac #11529: Rooted trees

Implement combinatorial (unordered) rooted trees This is done using ordered rooted trees as data structure, and recursive normalization. URL: http://trac.sagemath.org/11529 Reported by: hivert Ticket author(s): Florent Hivert Reviewer(s): Frédéric Chapoton, Darij Grinberg, Travis Scrimshaw
sagemath · Apr 23, 2015 · ef90aea · ef90aea
2 parents 0865e6b + dc8120f
commit ef90aea
Show file tree

Hide file tree

Showing 5 changed files with 1,390 additions and 35 deletions.
diff --git a/src/doc/en/reference/combinat/module_list.rst b/src/doc/en/reference/combinat/module_list.rst
@@ -235,6 +235,7 @@ Comprehensive Module list
     sage/combinat/root_system/weight_space
     sage/combinat/root_system/weyl_characters
     sage/combinat/root_system/weyl_group
+    sage/combinat/rooted_tree
     sage/combinat/rsk
     sage/combinat/schubert_polynomial
     sage/combinat/set_partition

diff --git a/src/sage/combinat/all.py b/src/sage/combinat/all.py
@@ -116,7 +116,10 @@
                           LabelledOrderedTree, LabelledOrderedTrees)
 from binary_tree import (BinaryTree, BinaryTrees,
                          LabelledBinaryTree, LabelledBinaryTrees)
+
 lazy_import('sage.combinat.interval_posets', ['TamariIntervalPoset', 'TamariIntervalPosets'])
+from rooted_tree import (RootedTree, RootedTrees,
+                         LabelledRootedTree, LabelledRootedTrees)
 
 from combination import Combinations
 from cartesian_product import CartesianProduct

diff --git a/src/sage/combinat/enumerated_sets.py b/src/sage/combinat/enumerated_sets.py
@@ -100,6 +100,7 @@
 - :ref:`sage.combinat.abstract_tree`
 - :ref:`sage.combinat.ordered_tree`
 - :ref:`sage.combinat.binary_tree`
+- :ref:`sage.combinat.rooted_tree`
 
 Enumerated sets related to graphs
 ---------------------------------