Combinatorial m-ary trees

[VivianePons]

In the same manner as #8703 we want to implement trees with a fixed number of subtrees (equivalent of binary trees but with m subtrees). Especially to use them in the context of the m-Tamari lattices.

This ticket depends on #8703 as we use the implementation of OrderedTrees.

Related:

• generate k-trees up to symmetry #11369: generate k-trees up to symmetry
• Implement k-ary trees #19479: Implement k-ary trees

CC: @hivert @sagetrac-sage-combinat @tscrim @darijgr

Component: combinatorics

Keywords: trees

Author: Viviane Pons

Branch/Commit: public/new-13987 @ a2d92f4

Reviewer: Darij Grinberg

Issue created by migration from https://trac.sagemath.org/ticket/13987

[VivianePons]

Dependencies: #8703

[VivianePons]

Description changed:

--- 
+++ 
@@ -1,3 +1,3 @@
-Just as in #8703 we want to implement trees with a fixed number of subtrees (equivalent of binary trees but with m subtrees). Especially to use them in the context of the m-Tamari lattices. 
+In the same manner as #8703 we want to implement trees with a fixed number of subtrees (equivalent of binary trees but with m subtrees). Especially to use them in the context of the m-Tamari lattices.
 
-This ticket depends on #8703 as we use the implantation of RootedTrees
+This ticket depends on #8703 as we use the implementation of OrderedTrees.

[VivianePons]

Commit: e772581

[VivianePons]

New commits:

[changeset:e772581]

#N: a patch to implement m-ary trees

[VivianePons]

Branch: public/combinat/13987-mary-trees