Braided dendriform and tridendriform algebras and braided Hopf algebras of planar trees
Li Guo, Yunnan Li

TL;DR
This paper develops braided algebraic structures on planar trees, extending known Hopf algebras with braidings, and explores their properties and isomorphisms in the braided context.
Contribution
It introduces braided dendriform and tridendriform algebras, extending Hopf algebras of planar trees with braidings and establishing new isomorphisms.
Findings
Braided dendriform and tridendriform algebras constructed.
Extended Hopf algebra isomorphisms to braided settings.
New braiding variations for planar rooted forests.
Abstract
This paper introduces the braidings of dendriform algebras and tridendriform algebras. By studying free braided dendriform algebras, we obtain braidings of the Hopf algebras of Loday and Ronco of planar binary rooted trees. We also give a variation of the braiding of Foissy for the noncommutative Connes-Kreimer (a.k.a the Foissy-Holtkamp) Hopf algebra of planar rooted forests so that the well-known isomorphism between this Hopf algebra and the Loday-Ronco Hopf algebra is extended to the braided context. As free braided tridendriform algebras, we also give braided extension of the Hopf algebra of Loday and Ronco on planar rooted trees.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Braided dendriform and tridendriform algebras and braided Hopf algebras of planar trees
Li Guo
Department of Mathematics and Computer Science, Rutgers University, Newark, NJ 07102, USA
and
Yunnan Li
School of Mathematics and Information Science, Guangzhou University, Waihuan Road West 230, Guangzhou 510006, China
Abstract.
This paper introduces the braidings of dendriform algebras and tridendriform algebras. By studying free braided dendriform algebras, we obtain braidings of the Hopf algebras of Loday and Ronco of planar binary rooted trees. We also give a variation of the braiding of Foissy for the noncommutative Connes-Kreimer (a.k.a the Foissy-Holtkamp) Hopf algebra of planar rooted forests so that the well-known isomorphism between this Hopf algebra and the Loday-Ronco Hopf algebra is extended to the braided context. As free braided tridendriform algebras, we also give braided extension of the Hopf algebra of Loday and Ronco on planar rooted trees.
Key words and phrases:
braided dendriform algebra, braided tridendriform algebra, planar rooted tree, planar binary tree, braided Hopf algebra
2010 Mathematics Subject Classification:
16T05, 16T25, 16W99, 05C05
Contents
-
2 Free braided dendriform algebras and braided Loday-Ronco Hopf algebras
-
3 Comparison isomorphism between braided Hopf algebras of rooted trees
-
4 Braided tridendriform algebra of planar angularly decorated trees
-
4.2 Free braided tridendriform algebras on braided vector spaces
-
4.4 The braided Hopf algebra of planar angularly decorated (dense) trees
1. Introduction
By means of free braided dendriform algebras and tridendriform algebras, this paper constructs braided extensions of the Loday-Ronco Hopf algebra [24] and Foissy-Holtkamp Hopf algebra [7, 15] (the noncommutative Connes-Kreimer Hopf algebra), in such a way that the well-known isomorphism [15] between the two Hopf algebra can be extended to the braided context.
1.1. The motivation
The theory of braids is important in several areas of mathematics and theoretical physics, including low dimensional topology, integrable systems and quantum field theory [17, 18, 32, 33, 28]. In particular, braiding is intimately related to the process of quantization in both mathematics and physics, such as quantum groups [16] and braid statistics in quantum mechanics [5].
The Hopf algebra of rooted trees was introduced as a toy model encoding the combinatorics of Feynman graphs in the Connes-Kreimer approach of renormalization in quantum field theory [2]. As is well-known, the noncommutative variation of the Connes-Kreimer Hopf algebra, also known as the Foissy-Holtkamp Hopf algebra [6, 7, 15], of planar rooted trees is canonically isomorphic to another important Hopf algebra, that of Loday and Ronco on planar binary rooted trees [24]. Taking the braiding approach, Foissy [8, 9] recently provided a quantization of the Hopf algebra of planar rooted trees. Thus it would be interesting to apply a braiding to quantize the Loday-Ronco Hopf algebra, in such as way that allows the extension of the above canonical isomorphism to the braided context. This is the motivation of our paper.
1.2. The approach
Our approach of braiding of the Loday-Ronco Hopf algebra starts with the observation that this Hopf algebra is the free object in the category of dendriform algebras [22]. Thus we first introduce the notion of braided dendriform algebras by providing suitable braidings on dendriform algebras. By taking the preorder of the vertices of the planar binary rooted trees, we construct the free object on the set of planar binary rooted trees decorated by a braided space, which then can be equipped with a braided Hopf algebra structure, in analogous to the Loday-Ronco Hopf algebra. We also apply a natural order of vertices to the planar rooted trees used in the Foissy-Holtkamp Hopf algebra, giving rise to a braided Hopf algebra structure on the space of planar rooted trees whose vertices are decorated by a braided space. This braiding of the Foissy-Holtkamp Hopf algebra is different from the one obtained by Foissy [6]. However, it has the benefit that the aforementioned isomorphism between the Foissy-Holtkamp Hopf algebra and the Loday-Ronco Hopf algebra can be extended to the braided context.
A second benefit of the preorder of vertices is that, for planar binary trees, it has a natural interpretation as an order of the angles of the planar binary trees which can then be extended to an order of the angles in any planar trees. This is important since angularly decorated planar rooted trees is the natural carrier of another Hopf algebra of Loday and Ronco, as the free tridendriform algebra, as well as of the free Rota-Baxter algebras [4, 12, 26]. Thus by extending the notions of tridendriform algebra and free tridendriform algebra to the braided context, we are also able to enrich the Loday-Ronco Hopf algebra on planar angularly decorated rooted trees to the braided context. Noting the recent work on rooted trees with decorations on edges arising from renormalization of quantum field theory [10], we see that combining different decorations (on vertices, angles and edges) of rooted trees can reveal interesting connections on their combinatorial and algebraic structures.
1.3. The outline
The main body of this paper consists of three sections. In Section 2, we continue the study of braided dendriform algebras introduced in [14] in connection with braided Rota-Baxter algebras, but turn our attention to the noncommutative case. In particular, the well-known Loday-Ronco [24] Hopf algebra of planar binary rooted trees as the free dendriform algebra is enriched to the braided case.
In Section 3, by a suitable ordering of the vertices of planar rooted trees, a braided enrichment is established for the Foissy-Holtkamp Hopf algebra of planar rooted trees [8, 9, 15] as the noncommutative variation of the Connes-Kreimer Hopf algebra of (nonplanar) rooted trees. This ordering enables us to extend the well-known isomorphism of the Loday-Ronco Hopf algebra with the Foissy-Holtkamp Hopf algebra of planar rooted trees.
In Section 4, we introduce the notion of a braided tridendriform algebra. With the Loday-Ronco Hopf algebra of planar rooted trees in mind, we focus on the free objects. More precisely, we show that the Loday-Ronco Hopf algebra on planar angularly decorated rooted trees can be equipped with a braided structure and give free braided tridendriform algebras, generated by both a set and by a braided algebra. In the latter case, a subset of the braided planar (angularly decorated) rooted trees, called dense trees are needed, possessing interesting combinatorial properties.
Notations.
In this paper, we fix a ground field of characteristic 0. All the objects under discussion, including vector spaces, algebras and tensor products, are taken over .
2. Free braided dendriform algebras and braided Loday-Ronco Hopf algebras
After recalling the notion of braided dendriform algebras, we construct free braided dendriform algebras on planar binary rooted trees.
2.1. Braided dendriform algebras
We first briefly recall the notions of braided vector spaces and algebras, while refer the reader to the literatures such as [16, 18] for details.
Definition 2.1**.**
A braiding or Yang-Baxter operator on a vector space is a linear map in satisfying the following braid relation on :
[TABLE]
which up to a flip is the Yang-Baxter equation without spectral parameter.
A braided vector space, denoted , is a vector space equipped with a braiding . For any and , we denote by the operator .
For a braided vector space , a subspace of is called a braided subspace of , if
[TABLE]
In this case, the quotient space has an induced braided vector space structure with its braiding, still denoted by .
Denote the -th symmetric group and the -th Artin braid group; see [18, Definition 1.1]. For any , there is the corresponding lift of in , denoted by and defined as follows: if is any reduced expression of by transpositions , then , uniquely determined by and . When is the usual flip , it reduces to the permutation action of on , namely,
[TABLE]
Using to denote the tensor product between and itself to distinguish with the usual within , we define by requiring that, for , the restriction of to is , where
[TABLE]
By convention, and is the identity map on . Then is a braiding on . It is easy to verify the following equalities of on :
[TABLE]
which will be used throughout the paper. For the convenience of constructions below, we also use (un)shuffles of permutations,
[TABLE]
Let by convention.
Definition 2.2**.**
Let be an algebra with product , and be a braiding on . We call the triple a braided algebra if it satisfies the conditions
[TABLE]
Moreover, if is unital with unit and satisfies
[TABLE]
then is called a unital braided algebra.
For braided algebras and , a map is called a homomorphism of braided algebras if is a homomorphism of algebras and . If and are unital, then it also requires .
With motivation from periodicity in -theory and making use of various categorical and operadic transitions, Loday [22] introduced the notion of a dendriform algebra.
Definition 2.3**.**
A dendriform algebra is a triple consisting of a -module and binary operations on satisfying the relations
[TABLE]
Then is associative.
One can also define the augmentation of , with and satisfying in addition
[TABLE]
The product is extended to with unit 1, while are undefined.
Further, a submodule of is called a dendriform ideal if
[TABLE]
Then the quotient module becomes a dendriform algebra with modulo . For dendriform algebras and , a map is called a homomorphism of dendriform algebras if is a linear map such that and .
Combining the notions of braided algebra and dendriform algebra, we obtain the braided analogue of dendriform algebras [14].
Definition 2.4**.**
A quadruple is called a braided dendriform algebra if is a braided vector space and is a dendriform algebra, with the compatibility conditions
[TABLE]
Let . Then is a braided algebra. Furthermore, is a unital braided algebra with the braiding of extended by
[TABLE]
Moreover, a dendriform ideal of is called a braided dendriform ideal, if it is also a braided subspace of . Then the quotient dendriform algebra is also a braided dendriform algebra. For braided dendriform algebras and , a map is called a homomorphism of braided dendriform algebras, if is a homomorphism of dendriform algebras and .
2.2. Free braided dendriform algebras of planar binary trees
We next construct free braided dendriform algebras by equipping a suitable braiding to the free dendriform algebras of planar binary trees obtained by Loday and Ronco [24, 22] whose construction we now recall. See Section 2.3 for the Hopf algebra structure. Let be the set of planar binary trees with internal vertices decorated by elements in a set . Some example are
[TABLE]
for . When is a singleton, we abbreviate as , for planar binary trees without decorations. Define the (vertex) degree of any to be the number of its internal vertices and, for , let be the subset of consisting of planar binary trees with internal vertices. It is well-known that is the -th Catalan number .
To obtain a braided structure, we fix the following natural well-order on the set of internal vertices of any . Label the leaves in from left to right by , and then let the internal vertex located between the -th and -th leaves be the -th vertex for . We call this the canonical order on the internal vertices of . Let denote the binary tree with its canonically ordered internal vertices decorated by from left to right. This way we have the identification
[TABLE]
with which we can write .
Definition 2.5**.**
Given a vector space , define
[TABLE]
In particular, by convention. Denote as a subspace of .
In analogous to Eq. (10), we can identify a pure tensor , where and , with the decorated tree in which the binary tree has its canonically ordered internal vertices decorated by from left to right, allowing -linearity in each decoration and hence multi-linearity in all the decorations. Also, denote
[TABLE]
and . Define the (-linear) grafting operation on ,
[TABLE]
such that is obtained by using
to graft two binary trees and into one, and also abbreviated as . Then define binary operations and on by the recursion
[TABLE]
for any and in , where on , and is extended to with being the unit. By [22, Theorem 5.8], the space with operations defined in Eq. (12) is the free dendriform algebra on . Thus is an associative algebra.
Now suppose that is moreover a braided vector space, the braiding on induces a braiding on defined by
[TABLE]
for any and . Also, we define the -linear map
[TABLE]
for any and . By symmetry, we define . Then by the definitions of operator and braidings and , we have
Lemma 2.6**.**
For any and homogeneous , we have
[TABLE]
To obtain a braided dendriform algebra structure on for a braided vector space , we rewrite on given in (11)–(12) with enriched notations , and show that it is compatible with the braiding structure induced from .
Theorem 2.7**.**
Given a braided vector space , the quadruple is a braided dendriform algebra.
Proof.
First fix , and with . As noted above, is the dendriform algebra in [22, Theorem 5.8]. So it remains to check the compatibility conditions in Eqs. (8) and (9) together with Eqs. (3) and (4) for , for which we apply induction on the vertex degree . If one of is , then the verification is clear. If not, suppose , and with , then
[TABLE]
where the second equality is due to Eq. (13) suppressing the decorations by convention; the third one holds by the induction hypothesis for Eq. (3) of , and the last one is by Eq. (2). The proof of
[TABLE]
is similar. Further, for with , we have
[TABLE]
where the second equality is due to Eq. (13); the third one holds by the induction hypothesis for Eq. (3) on and the last one is by Eq. (2). A similar argument gives
[TABLE]
So is a braided dendriform algebra and a braided algebra. ∎
Since is homogeneous, we can regard as a braided subspace of . Let
[TABLE]
be the natural embedding of braided vector spaces. Denote \raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 5.40005pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{\hbox{\kern 3.57796pt\raise 5.40005pt\hbox{\hbox{\kern 0.0pt\raise-1.50694pt\hbox{\textstyle{\scriptstyle v}}}}}}}}}}}=|\vee_{v}| by for .
Now we are in the position to show that is a free object in the category of braided dendriform algebras, as a braided version of Loday’s result [22, Theorem 5.8].
Theorem 2.8**.**
Given a braided vector space , the quadruple together with the map is the free braided dendriform algebra on . More precisely, for any braided dendriform algebra and a homomorphism of braided vector spaces, there exists a unique homomorphism of braided dendriform algebras such that .
Proof.
Given any braided dendriform algebra and a homomorphism of braided vector spaces, one can define a linear map recursively by
[TABLE]
for and with and . Checking as in the proof of [22, Theorem 5.8], we find that the restriction of to is a homomorphism of dendriform algebras. Next we show that
[TABLE]
by induction on the vertex degree of . If , it is clear by the definition of . Otherwise, one can check it in four cases depending on whether or is or not for with . Here we only consider the case when since other cases are easier to verify.
[TABLE]
where the first and third equalities are by the definitions of and ; the second and last equalities are by the definition of ; the fourth equality uses the induction hypothesis; and the fifth one is due to Eqs. (8) and (9) on . Hence, we have .
By definition, we know that is uniquely determined by its image on as a homomorphism of dendriform algebras with , while means that for any . Hence, with has the desired universal property. ∎
2.3. The braided Hopf algebra of planar binary trees
Dual to the notion of bradied algebras, we introduce the notion of braided coalgebras, and then braided bialgebras and braided Hopf alebras. See [16, 27] for details.
Definition 2.9**.**
We call a braided coalgebra if is a coalgebra with braiding and satisfies
[TABLE]
Also, a quintuple is called a braided bialgebra, if (resp. ) is a braided algebra (resp. coalgebra) such that
[TABLE]
When has unit and antipode such that , then the septuple is a braided Hopf algebra. The homomorphisms for these braided objects are similarly defined as in the case of braided algebras.
We also introduce the following useful notion [27, §5.2].
Definition 2.10**.**
For any coalgebra , let be the sum of all simple subcoalgebras of , called the coradical of , and recursively define
[TABLE]
Then is a subcoalgebra filtration of , called the coradical filtration of . In particular, if the coradical of is one-dimensional, then is called connected.
We recall the following well-known fact of Takeuchi [27, Lemma 5.2.10]. See also [19, 26, 31].
Lemma 2.11**.**
Any (braided) bialgebra connected as a coalgebra is a (braided) Hopf algebra.
Now we recall the well-known Loday-Ronco Hopf algebra [24].
Definition 2.12**.**
The Loday-Ronco Hopf algebra of planar binary trees is the -linear space , in which
- (i)
the product is recursively defined by
[TABLE]
for any , and with the unit , 2. (ii)
the coproduct is recursively defined by
[TABLE]
where , and the counit has .
The coproduct on can be linearly extended to as mentioned in [22, §5.13]. Next we define -linear map recursively by
[TABLE]
for any , where . Then is a braided version of . Define a linear map by .
Theorem 2.13**.**
Given a braided vector space , the quintuple is a braided Hopf algebra.
Proof.
The fact that is a braided algebra is checked in Theorem 2.7. Next we show that is a braided bialgebra.
Let us fix and , . First we check the compatibility in Eq. (17) between and for which we apply induction on the vertex degree . When one of is , it is clear. Otherwise, with the notation , and , we have
[TABLE]
where the first and second equalities are by the definitions of and respectively; the third one is due to the induction hypothesis and the definitions of .
Next we show that is a braided coalgebra. Then is a braided bialgebra by previously proved relation. We first need to check the conditions in Eqs. (15) and (16) for , but Eq. (16) is clear by definition. For condition (15), we show it by induction on . Again, if one of is , it is obvious. If not, then
[TABLE]
where the first and last equalities are by the definition of ; the second one is by the definition of ; the third one uses the induction hypothesis; the fourth one is due to conditions in Eq. (3) of and in Eq. (13) of . The second identity in Eq. (15) for is similar to check.
For the coassociativity of , it is also proved by induction on . In fact, given ,
[TABLE]
where the first, second, sixth and last equalities are by the definition of ; the third one uses the compatibility between and ; the fourth one is due to Eq. (15) of and the induction hypothesis; the fifth one is also by Eq. (15).
Since the braided bialgebra is connected graded with respect to the degree , it is a braided Hopf algebra by Lemma 2.11. See also [9, Lemma 1.27] or [8, Lemma 12]. ∎
Recently, Gao and Zhang [11] provided an explicit combinatorial description of via certain cuts on decorated planar binary trees. We recall their construction and show that it can be extended to the braided case.
For any , a subforest of is defined to be the concatenation of planar binary trees consisting of a subset of internal vertices of together with their descents and edges containing all these involved vertices.
For a subforest of , let denote the result tree when the concatenation product of trees in is replace by the product , and let be obtained by removing from in the following way. Divide all edges connecting to the rest of into two edges such that one belongs to and the other one belonging to the rest of . Here the decorations on vertices of remain at their corresponding positions in and . Let be the set of subforests of , including the empty tree and the whole tree . With the above notation, it is shown in [11] that
[TABLE]
For example, if Y=\raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 12.55011pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{\hbox{\kern 3.65005pt\raise 5.40005pt\hbox{\hbox{\kern 0.0pt\raise-2.25555pt\hbox{\textstyle{\scriptstyle 2}}}}}}{\hbox{\kern-12.55011pt\raise 12.60013pt\hbox{\hbox{\kern 0.0pt\raise-2.25555pt\hbox{\textstyle{\scriptstyle 1}}}}}}{\hbox{\kern 9.05011pt\raise 12.60013pt\hbox{\hbox{\kern 0.0pt\raise-2.25555pt\hbox{\textstyle{\scriptstyle 3}}}}}}}}}}}, then
[TABLE]
Now for any and , let be the common vertex degree of the terms in . By Eq. (19) and the canonical order (10) there is clearly a unique such that
[TABLE]
We then obtain the formula
[TABLE]
for any . To finish this section, we show that is a free associative algebra as an analogue of [24, Theorem 3.8].
Theorem 2.14**.**
Given a braided vector space with a -basis , the algebra is freely generated by the set , where
[TABLE]
Proof.
Note that is a braided vector subspace of . Thus there is a braided algebra map
[TABLE]
by the freeness of the tensor algebra. First we show that is surjective. Let . If , then . Otherwise, let with . Then
[TABLE]
Since has degree less then that of , by the induction hypothesis on , we see that and are in the subalgebra of generated by . Thus is also in this subalgebra. Since is arbitrary, we see that is surjective.
On the other hand, it has been shown in [24, Theorem 3.8] that , while we also have . Thus is also injective, mapping a linear basis of to one in . ∎
3. Comparison isomorphism between braided Hopf algebras of rooted trees
Holtkamp [15] gave a canonical isomorphism between the Foissy-Holtkamp Hopf algebra of planar rooted trees, as the noncommutative variation of the Connes-Kreimer Hopf algebra of (nonplanar) rooted trees, and the Loday-Ronco Hopf algebra of planar binary rooted trees. With the braided version of the Loday-Ronco Hopf algebra constructed in the previous section, it is natural to find a braided Hopf algebra of planar rooted trees that is isomorphic to the braided Hopf algebra of planar binary trees. In the work [8, 9], Foissy gave a braided Hopf algebra of planar rooted trees based on certain linear ordering of the vertices of the rooted trees. Here we provide another braiding based on a different linear ordering for which the desired isomorphism of braided Hopf algebras can be established (Theorem 3.5).
3.1. Braided operated Hopf algebras of planar rooted trees
Let be the set of planar rooted trees with vertices decorated by elements in and be the free monoid generated by representing the set of planar rooted forests as concatenations of rooted trees. Similar to (but different from) the binary case, define the (vertex) degree of to be the number of its vertices. For , let be the subset of consisting of forests with vertices. Similarly, we denote for trees with vertices. In particular, with being the empty tree, and {\mathcal{T}}_{1}(X)={\mathcal{F}}_{1}(X)=\{\,\text{\raisebox{2.0pt}{{\scriptstyle\bullet}_{x}}}\,|\,x\in X\}.
When is a singleton, we abbreviate (resp. ) as (resp. ) consisting of planar rooted trees (resp. forests) with the same, and therefore free of, decoration. Then is the -th Catalan number [30, Exercise 6.19. e.]. Further, , since there is a one-to-one correspondence between and sending to its grafted tree . Here is the grafting operator.
For the braiding consideration next, we need to fix a well-order on the set of vertices of every forest . One of the choices is given by doing a depth-first (preorder) search through trees in from left to right and numbering the occurring vertices successively. We called this the canonical order for planar rooted forests. Then we can denote for the forest with its canonically ordered vertices decorated by , and have the identification
[TABLE]
If there is no danger of confusion, we also use to denote for brevity.
For example, the preorder of one and the corresponding decorated forest are as follows.
[TABLE]
For a planar rooted tree , a subforest of is the forest consisting of a subset of vertices of together with their descents and edges containing all these involved vertices. Let be the set of subforests of , including the empty tree and the total .
A Hopf algebra structure on planar rooted trees was established by Foissy and Holtkamp [9, 15] as a noncommutative variation of the Hopf algebra on (nonplanar) rooted trees from the Connes-Kreimer approach of the renormalization of perturbative quantum field theory [2, 21].
Definition 3.1**.**
The noncommutative Connes-Kreimer Hopf algebra (a.k.a Foissy-Holtkamp Hopf algebra) is the free -algebra generated by the set of planar rooted trees decorated by , with the coproduct defined by
[TABLE]
and counit , where is the tree obtained from after removing a subforest and all edges connecting to the rest of . Here the decorations on vertices of remain at their corresponding positions in and .
For example, if T=\raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 8.40039pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{\hbox{\kern-8.26114pt\raise 7.20007pt\hbox{\hbox{\kern 0.0pt\raise-1.55556pt\hbox{\textstyle{{\scriptstyle\bullet}}}}}}}{\hbox{\kern 2.53897pt\raise 7.20007pt\hbox{\hbox{\kern 0.0pt\raise-1.55556pt\hbox{\textstyle{{\scriptstyle\bullet}}}}}}}{\hbox{\kern-2.86108pt\raise 14.40015pt\hbox{\hbox{\kern 0.0pt\raise-1.55556pt\hbox{\textstyle{{\scriptstyle\bullet}}}}}}}{\hbox{\kern 7.93903pt\raise 14.40015pt\hbox{\hbox{\kern 0.0pt\raise-1.55556pt\hbox{\textstyle{{\scriptstyle\bullet}}}}}}}{\hbox{\kern-2.86108pt\raise 0.0pt\hbox{\hbox{\kern 0.0pt\raise-1.55556pt\hbox{\textstyle{{\scriptstyle\bullet}}}}}}}{\hbox{\kern 3.1197pt\raise-1.80002pt\hbox{\hbox{\kern 0.0pt\raise-0.8625pt\hbox{\textstyle{\scriptstyle x_{1}}}}}}}{\hbox{\kern-8.40039pt\raise 13.32011pt\hbox{\hbox{\kern 0.0pt\raise-0.8625pt\hbox{\textstyle{\scriptstyle x_{2}}}}}}}{\hbox{\kern 8.51976pt\raise 5.40005pt\hbox{\hbox{\kern 0.0pt\raise-0.8625pt\hbox{\textstyle{\scriptstyle x_{3}}}}}}}{\hbox{\kern-3.00034pt\raise 20.52019pt\hbox{\hbox{\kern 0.0pt\raise-0.8625pt\hbox{\textstyle{\scriptstyle x_{4}}}}}}}{\hbox{\kern 7.79977pt\raise 20.52019pt\hbox{\hbox{\kern 0.0pt\raise-0.8625pt\hbox{\textstyle{\scriptstyle x_{5}}}}}}}}}}}}, then
[TABLE]
As in the non-ordered case, it is easy to check that is a graded connected Hopf algebra with respect to the grading defined by the degree . In particular, is spanned by the empty tree , and , when .
Given , one can also define a grafting operator on by grafting a decorated forest to a decorated rooted tree with the root decorated by . Then the grafting operator satisfies the following 1-cocycle condition
[TABLE]
For the braided Hopf algebra of planar rooted trees, we first introduce some notations, referring to the construction of Foissy in [8, 9]. Like the notation for a vector space , define
[TABLE]
with by convention.
Also, we can identify with via the canonical order, and denote
[TABLE]
for any and with . In particular, let be the subset of only consisting of trees , and with .
Note that the concatenation product , the coproduct and the counit of can be linearly extended on to obtain the induced Hopf algebra structure .
Now if is a braided vector space, by [8, Proposition 17] the braiding on induces a braiding on defined by
[TABLE]
for any and , where we similarly interpret any as a linear function from to with
[TABLE]
Also, we have the linear map
[TABLE]
for any and . By symmetry, we define .
On the other hand, according to Eq. (23) and the canonical order in Eq. (22), for any , every with determines a unique such that
[TABLE]
see also the example in Eq. (24) as an illustration. Hence we can define a linear map as follows. For any , define
[TABLE]
while for any , we define it by induction on the number of trees in , namely,
[TABLE]
when is the concatenation of and , and then extend it to linearly. Also, define a linear map by . As a result, the quintuple is a braided Hopf algebra. See [8, Theorem 19].
Let be the linear map defined by for any . For simplicity, we denote by . So is an -algebra over in the sense of [9] or a -operated algebra in the sense of [13]. Moreover, satisfies the following twisted 1-cocycle condition analogous to Eq. (25),
[TABLE]
and the property below.
Lemma 3.2**.**
For any , we have
[TABLE]
Proof.
It is by the definitions of the grafting operator and braidings . ∎
Remark 3.3**.**
The braided Hopf algebra of planar rooted trees considered here is slightly different from the one defined in [8, 9] denoted , as our canonical order on the set of vertices of a forest is not the one in [9, Sec. 2.2.2]. Indeed, our choice makes the resulting braided Hopf algebra isomorphic to the braided Hopf algebra of planar binary trees shown below. See also Lemma 3.4 on the ordering.
3.2. Comparison of braided Hopf algebras on trees
In [15, Theorem 2.10], Holtkamp proved that there is a graded Hopf algebra isomorphism defined recursively by
[TABLE]
First we note that Holtkamp’s map preserves the canonical orders given in Eqs. (10) and (22) for vertices of trees in and respectively. More precisely,
Lemma 3.4**.**
Let with its internal vertices canonically ordered. Then is a sum of monomial terms as forests in which the vertices are also canonically ordered.
Proof.
Indeed, we can see this fact by induction on . Let be a set and with its canonically ordered internal vertices decorated by , then
[TABLE]
with , by the induction hypothesis. Namely, all monomial terms in still have their vertices decorated by in the canonical order. ∎
For example, by Eq. (21) in the proof of Theorem 2.14 and the definition (30) of ,
[TABLE]
Since is also freely generated by {\mathcal{W}}(E)=\Big{\{}\,|\vee_{v}Y\,|\,Y\in{\mathcal{B}}(E),v\in E\Big{\}} as an algebra by Theorem 2.14, we can similarly define an algebra homomorphism
[TABLE]
Theorem 3.5**.**
Given any braided vector space , the map is a graded braided Hopf algebra isomorphism between and .
Proof.
First like , is bijective with its inverse defined recursively by , for any for some . Also, it is clear that is homogeneous with respect to the degrees on and .
We next check that . Thus is a braided algebra map. It can be done for the generators in by induction on . For any ,
[TABLE]
where the second equality applies Eqs. (28) and (29); the third one is due to the induction hypothesis and the fact that preserves the canonical orders for vertices of trees shown in Lemma 3.4; and the last one is by Eqs. (13) and (14).
To complete the proof, we only need to show that is a braided coalgebra homomorphism for which we apply induction on . It is clear that by definition. Further, for any and , we have
[TABLE]
where the first and fifth equalities are by the definition of ; the second equality uses the twisted 1-cocycle condition (27) of ; the third equality is due to the induction hypothesis and the fourth one is based on the fact that preserves the canonical orders for vertices of trees. ∎
4. Braided tridendriform algebra of planar angularly decorated trees
We now extending our braiding approach to tridendriform algebra and the second Hopf algebra of Loday and Ronco on angularly decorated planar rooted trees as free tridendriform algebras. The free objects can be generated by a (braided) space or a (braided) algebra. In the later case, the combinatorial carrier is a special class of planar rooted trees of independent interest.
4.1. Braided tridendriform algebras
We recall another important notion of Loday and Ronco [24].
Definition 4.1**.**
A quadruple is called a tridendriform algebra if is a -module with three binary operations satisfying the relations
[TABLE]
for , where is henceforth associative.
Define the augmentation of with satisfying
[TABLE]
The operation is extended to with unit 1, while are undefined.
Furthermore, a submodule of is called a tridendriform ideal, if
[TABLE]
Then the quotient module becomes a tridendriform algebra with induced operators . For tridendriform algebras and , a map is called a homomorphism of tridendriform algebras if is a linear map such that , and .
Next we introduce the braided analogue of tridendriform algebras [14].
Definition 4.2**.**
A quintuple is called a braided tridendriform algebra if is a braided vector space and is a tridendriform algebra such that
[TABLE]
Let . Then is a braided algebra. Also, is a unital braided algebra with the braiding of extended by
[TABLE]
For two braided tridendriform algebras and , a map is called a homomorphism of braided tridendriform algebras if is a homomorphism of tridendriform algebras and . Moreover, a tridendriform ideal of is called a braided tridendriform ideal if it is also a braided subspace of . Then the tridendriform quotient algebra is also a braided tridendriform algebra.
4.2. Free braided tridendriform algebras on braided vector spaces
In [25], Loday and Ronco used planar rooted trees to construct free tridendriform algebras, providing motivation to the notion of angularly decorated planar rooted forests introduced in [4, 13] to construct free Rota-Baxter algebras. The notion of angle of a planar rooted tree can be tracked to the work [20] of Kontsevich.
Let be the set of planar angularly decorated rooted trees with valency of all internal vertices greater than 2. Let be the set of trees in with leaves, , and define to be the leaf degree of . In particular, . By Schröder’s second problem in [30, Example 6.2.8], we know that is equal to the -th little Schröder number (or super Catalan number) , . On the other hand, by [12, §4.1] we can interpret as a subset of by adding leaf vertices and removing the root edge for any tree in .
Let be the set consisting of trees in angularly decorated by a set , and we have . See [12, §4.2.1.3] and [13, §5.1] for such decorations. Some angularly decorated trees with small leaf degrees are
[TABLE]
where . We will use the notation to denote with angular decorations by from left to right.
Also, note that any planar rooted tree can be uniquely obtained by jointing the roots of its branches to a new vertex with angular decoration from left to right and adding a new root. We denote this representation of by
[TABLE]
In particular, we denote the tree \raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 5.40005pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{\hbox{\kern-2.00034pt\raise 14.40015pt\hbox{\hbox{\kern 0.0pt\raise-1.50694pt\hbox{\textstyle{\scriptstyle x}}}}}}}}}}}=|\vee_{x}| by .
As in the cases of planar binary trees and of planar rooted forests , we define
[TABLE]
and as its subspace.
Also, identify with , and denote
[TABLE]
for any . Let with . Then linearly spans .
Given a braided vector space , the braiding on induces a braiding on defined by
[TABLE]
for any and . Also, we define the linear map
[TABLE]
for any and , and define by symmetry.
For , define
[TABLE]
for any , to be the (linear) grafting operation on . The following result is obtained by the definitions of the operator and the braidings .
Lemma 4.3**.**
For any , we have
[TABLE]
Define linear maps by the following recursions.
[TABLE]
for any with , where on and is extended to with the unit . Let
[TABLE]
be the natural embedding of braided vector spaces.
Theorem 4.4**.**
Given a braided vector space , the quintuple is a braided tridendriform algebra.
Proof.
First note that is exactly the original tridendriform algebra structure in [25, Corollary 2.9] where the notation is used instead of .
Now fix and with . We still need to check conditions (39)–(41) together with condition (3) for , for which we apply induction on the leaf degree .
The compatibility condition (39) (resp. (40)) between (resp. ) and can be checked as checking condition (8) (resp. (9)) in the proof of Theorem 2.7. It remains to verify Eq. (41). The case when one of is is clear. For the other case, suppose that , with , then
[TABLE]
where the second equality is due to Eq. (43) (with decorations suppressed); the third one holds by the induction hypothesis for condition (3) of ; and the last one is by Eq. (2).
It is similar to prove that
[TABLE]
So far we have shown that conditions (39)–(41) hold for , which also imply Eq. (3) as on . Furthermore, Eq. (4) is by the definition of . Hence is a braided tridendriform algebra, and thus is a braided algebra. ∎
Next we show that is a free object in the category of braided tridendriform algebras, as a braided version of [25, Theorem 2.6].
Theorem 4.5**.**
Given a braided vector space , the quintuple is the free braided tridendriform algebra on , characterized by the following universal property: for any braided tridendriform algebra and a map of braided vector spaces, there exists a unique homomorphism of braided tridendriform algebras such that .
Proof.
Given any braided tridendriform algebra and any map of braided vector spaces, one can define a linear map recursively as follows.
[TABLE]
for any with . Adapting the proof of [25, Theorem 2.6], we find that the restriction of to is a homomorphism of tridendriform algebras.
Next we show
[TABLE]
for by induction on the leaf degree of . If one of , it is clear by the definition of . If not, there are the three cases of , or for with . We only check the most involved case of , namely with .
[TABLE]
where the first and third equalities are by the definitions of and ; the second and last equalities are by the definition of ; the fourth equality uses the induction hypothesis and the fifth one is due to Eqs. (39)–(41) on . Hence, we have .
By definition, is uniquely determined by its images on for all as a homomorphism of tridendriform algebras with , while means that for any . Hence, with has the desired universal property. ∎
4.3. Free braided tridendriform algebras on braided algebras
Throughout this subsection, we fix a braided algebra , and abbreviate the multiplication as for simplicity.
Given a set , a tree in is called dense if for any vertex of the tree, its leaf branch can only appear as the leftmost or rightmost branch. In other words, the tree does not have two adjacent angles over a same vertex that are separated by a leaf. The subset of dense trees of is denoted by . Also denote for the set of dense trees with no decorations.
For example, \raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 10.80011pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{\hbox{\kern-1.84155pt\raise 14.40015pt\hbox{\hbox{\kern 0.0pt\raise-0.8264pt\hbox{\textstyle{\scriptstyle y}}}}}}{\hbox{\kern-7.40039pt\raise 21.60022pt\hbox{\hbox{\kern 0.0pt\raise-1.50694pt\hbox{\textstyle{\scriptstyle x}}}}}}}}}}}\,,\,\raisebox{-0.28453pt}{\lx@xy@svg{\hbox{\raise 0.0pt\hbox{\kern 10.80011pt\hbox{\ignorespaces{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces{\hbox{\lx@xy@drawline@}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{}{}\ignorespaces\ignorespaces{\hbox{\lx@xy@droprule}}{\hbox{\kern-7.40039pt\raise 21.60022pt\hbox{\hbox{\kern 0.0pt\raise-1.50694pt\hbox{\textstyle{\scriptstyle x}}}}}}{\hbox{\kern 3.61845pt\raise 21.60022pt\hbox{\hbox{\kern 0.0pt\raise-1.50694pt\hbox{\textstyle{\scriptstyle z}}}}}}{\hbox{\kern-1.84155pt\raise 28.8003pt\hbox{\hbox{\kern 0.0pt\raise-0.8264pt\hbox{\textstyle{\scriptstyle y}}}}}}}}}}} are in , but \textstyle{\scriptstyle x}$$\textstyle{\scriptstyle y} is not in . Define
[TABLE]
as a braided subspace of , and denote such that . Then has the braided tridendtriform algebra structure defined by Eqs. (45) – (46) and the following modification of Eq. (47),
[TABLE]
for any with .
Proposition 4.6**.**
The quintuple defined by Eqs. (45), (46) and (49) is a braided tridendtriform algebra. In particular, is isomorphic to as braided tridendtriform algebras for any set , where is the free nonunital algebra on .
Proof.
First by induction on the leaf degree , one can easily see that Eqs. (45), (46) and (49) give well-defined operators on . Next it is also straightforward to check by induction on that they satisfy tridendriform conditions in Eqs. (31)-(37), while Eq. (38) follows from definition. As an instance, we verify
[TABLE]
Indeed, for with , then
[TABLE]
by definition. Otherwise, suppose that , by Eq. (38) we still have
[TABLE]
In particular, when , we clearly have a braided vector space embedding
[TABLE]
By the universal property of proved in Theorem 4.5, there exists a unique homomorphism of braided tridendtriform algebras such that . Then is an isomorphism of braided tridendtriform algebras, as it maps to bijectively. ∎
Let as a braided subspace of with the product and
[TABLE]
be the natural embedding of braided algebras.
Theorem 4.7**.**
Given a braided algebra , the quintuple is the free braided tridendriform algebra on the braided algebra . More precisely, it satisfies the following universal property: for any braided tridendriform algebra and a homomorphism of braided algebras, there exists a unique homomorphism of braided tridendriform algebras such that .
Proof.
Similar to the map given in Theorem 4.5, we define a linear map recursively as follows.
[TABLE]
for any with such that .
Note that is clearly well-defined and is just the restriction of to as braided vector space maps. Next we check that is a homomorphism of braided tridendriform algebras. In fact, it follows the same steps as in the proof of [25, Theorem 2.6].
First we show that
[TABLE]
by induction on the degree . When is , it is clear by the definition of and Eq. (38). For , we can use the same argument to check the cases when and . For instance, if , we have
[TABLE]
where the first equality is due to Eq. (45); the second and last equalities are by the definition of ; the third equality uses the induction hypothesis and the fourth one is by Eq. (31). The identity
[TABLE]
is similar to check.
To show that for any , we first check the case when and . If furthermore or is , the verification is easy. If not, then
[TABLE]
where the first equality is due to Eq. (49); the second and last equalities are by the definition of ; the third equality uses the induction hypothesis; the fourth equality is by Eqs. (31) and (35); the fifth one is by Eqs. (32), (34)–(36). Then the general case of follows from a similar argument by induction on the degree of trees.
Further, the identity for can be shown in the same way as in the proof of Theorem 4.5.
By definition, is uniquely determined by its images on for all as a homomorphism of tridendriform algebras with , while gives for any . Hence, with has the desired universal property. ∎
Let be the tridendriform ideal of generated by
[TABLE]
then clearly is also an (algebraic) ideal of . Obviously, is a braided subspace of . Thus we also obtain a braided tridendriform quotient algebra .
Corollary 4.8**.**
* is isomorphic to as braided tridendriform algebras. In particular, , thus , as braided vector spaces.*
Proof.
Since in Eq. (48) has it image contained in , the map given in Eq. (50) is this restriction. Namely, let be the natural inclusion as braided vector spaces, then . By Theorem 4.5, there exists a unique homomorphism
[TABLE]
of braided tridendriform algebras such that and . In particular, for all , and thus by Eq. (49) on . It induces a unique homomorphism
[TABLE]
of braided tridendriform algebras such that , where is the canonical projection.
On the other hand, let , then is an algebra homomorphism such that for by the definition of . Using the universal property of in Theorem 4.7, we have a unique homomorphism
[TABLE]
of braided tridendriform algebras such that and . Therefore, we have
[TABLE]
Again by the universal property of , we know that . Then
[TABLE]
Now by the universal property of in Theorem 4.5 instead, we have , thus for is surjective. This means that is an isomorphism of braided tridendriform algebras. Also, by definition. Hence,
[TABLE]
which means is a section of . In particular, as braided vector spaces. ∎
4.4. The braided Hopf algebra of planar angularly decorated (dense) trees
As noted above, free dendriform algebras can be realized on the space of planar binary rooted trees. Equipped with the coproduct in Eq. (18), we have the well-known Loday-Ronco Hopf algebra. Extending such Hopf algebra structure to free tridendriform algebras, Loday [23] worked in the more general context of -algebras for operads that satisfy certain coherent unit action property. See also [3]. We adapt Loday’s approach to equip the free braided tridendriform algebra of planar rooted trees with a braided Hopf algebra structure, without going into the full generality of operads as in [23].
Proposition 4.9**.**
For any braided tridendriform algebra , denote
[TABLE]
Then has a braided tridendriform algebra structure defined as follows,
[TABLE]
where is the product on previously defined in Definition 4.1, and (resp. ) represents any of the operations on (resp. ). Furthermore, let be a braiding on . Then the augmentation has the braided unital algebra structure as defined in Definition 4.2.
Proof.
First it is a simple though tedious computation to check that the quintuple defined in the statement is a tridendriform algebra. For instance, to check Eq. (34),
[TABLE]
Also, one can establish the compatibilities in Eqs. (39)–(41) between the braiding and operations on directly via those between and on . For example, using the notation (resp. ) to represent any of the operations on (resp. ), we have
[TABLE]
Hence, we obtain the desired braided tridendriform algebra . ∎
Now we apply Proposition 4.9 to the case when . Then is a braided tridendriform algebra. By Theorem 4.5, there exists a unique homomorphism
[TABLE]
of braided tridendriform algebras satisfying and for any . In particular, is a braided algebra homomorphism with respect to . Also, define a linear map . Then we have
Theorem 4.10**.**
Given a braided vector space , the quintuple is a braided Hopf algebra. The coproduct on is defined by the following recursive formula:
[TABLE]
for any with , where with and
[TABLE]
Proof.
For the first result, we only need to show that the map is a coproduct on . Then is a connected, graded and braided bialgebra, and thus a braided Hopf algebra by Lemma 2.11. Note that
[TABLE]
is a braided tridendriform algebra by Proposition 4.9. At the same time,
[TABLE]
Since both maps
[TABLE]
are homomorphisms of braided tridendriform algebras mapping to , and to for all , they are equal to each other, by the universal property of in Theorem 4.5. Hence, we have proved the coassociativity of .
On the other hand, it is easy to see that is a homomorphism of braided algebras. Moreover, the three homomorphisms
[TABLE]
map to , and to for all . Thus again by the universal property of we conclude that they coincide with each other. Thus is a coproduct on .
Next we show that satisfies the recursive formula (52) by induction on of trees. In fact, we first note that, for any and , there is
[TABLE]
Denote
[TABLE]
For the case when , we have
[TABLE]
where the first equality is due to the identity , the fact that is a homomorphism of braided tridendriform algebras and Eqs. (45), (46) and (51). The second equality uses Eq. (53).
For the case when , we similarly have
[TABLE]
For the case when , we also have
[TABLE]
with
[TABLE]
where the first equality is due to a similar argument as the previous cases; the second equality uses the induction hypothesis of Eq. (52); and the third equality is by Eqs. (3), (43) and the associativity of , and the forth one uses Eq. (53).
As a result, the coproduct on satisfies the recursive formula (52). ∎
There is an explicit formula of on , naturally generalizing Eq. (19) of on the Loday-Ronco Hopf algebra . It is given by
[TABLE]
where denotes the set of subforest of obtained in the same way as in Eq. (19) of binary tree , is the multiplication of trees in via from left to right, and is obtained by removing from analogous to with . All decorations on the vertices of remain at their corresponding positions in and .
Consequently, for any , each with being the common leaf degree of all terms in , determines a unique such that
[TABLE]
For the braided analogue of , we thus obtain the following explicit formula of , generalizing Eq. (20) of on ,
[TABLE]
Similarly, applying Proposition 4.9 to , then is a braided tridendriform algebra. Note that there is a braided algebra homomorphism
[TABLE]
Indeed, by Eqs. (49) and (51), we have
[TABLE]
for any . Hence, by the universal property of in Theorem 4.7, there exists a unique homomorphism
[TABLE]
of braided tridendriform algebras satisfying and for all . Again, is a braided algebra homomorphism with the product for , and we can define -linear map
[TABLE]
Proposition 4.11**.**
Given a braided algebra , the quintuple is a braided Hopf quotient algebra of as stated in Theorem 4.10.
Proof.
In order to obtain the desired result, we can directly show that the tridendriform ideal of generated by
[TABLE]
is a biideal of . In fact, by Eq. (51),
[TABLE]
Then applying Corollary 4.8 and Theorem 4.10, we find that is a braided bialgebra. Since is still clearly connected as , it is a braided Hopf quotient algebra of by Lemma 2.11. ∎
4.5. Enumerative combinatorics of dense trees
First we introduce two integer sequences, one for dense trees and one for dense forests.
First let and . Then recursively define and by
[TABLE]
for any , where is the usual grafting operation, and is the free semigroup generated by . It is clear that the set of dense trees . Let be the set of dense forests. For any (resp. ), we define its depth (resp. ).
Note that is infinite for . Next we introduce another gradation on . Let be the set of dense trees in with leaves for any , then . It is obvious that . Let . As any tree has the representation (42), we have the following recursive formula:
[TABLE]
where means that and . Hence, the sequence of ’s is listed as . This integer sequence is not yet included in OEIS. See Remark 4.13.
Theorem 4.12**.**
The generating function of the sequence enumerating dense trees satisfies the identity
[TABLE]
Further, we have
[TABLE]
and
[TABLE]
where we use the convention that if .
Proof.
Note that each satisfies exactly one of the following four conditions:
- (a)
; 2. (b)
with exactly one of and ; 3. (c)
with ; 4. (d)
such that .
In case (a) it gives the first term in . For any in case (b) with , exactly one of is , while other branches , are in . Hence, the number of from case (b) is
[TABLE]
and thus case (b) contributes to as the power series
[TABLE]
for . Similarly, for any in case (c) with , we have , and other , are in if . Thus case (c) contributes to as
[TABLE]
Meanwhile, for any in case (d) with , since all are in with , it contributes to as
[TABLE]
Combining these four parts, we have
[TABLE]
which reduces to the identity , yielding the solution
[TABLE]
Using the power series expansion
[TABLE]
we obtain
[TABLE]
This is equivalent to saying that . ∎
Remark 4.13**.**
There is an integer sequence , listed as A141200 in [29], with its first 7 terms coinciding with those of . It is defined by
[TABLE]
where . Comparing the coefficients of on both hand side of the above identity of , we have
[TABLE]
The firs few terms of this sequence are .
Acknowledgments. Y. Li thanks Rutgers University – Newark for its hospitality during his visit in 2018-2019. This work is supported by Natural Science Foundation of China (Grant Nos. 11501214, 11771142, 11771190) and the China Scholarship Council (No. 201808440068).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1]
- 2[2] A. Connes, D. Kreimer: Hopf algebras, renormalization, and noncommutative geometry, Comm. Math. Phys. 199 (1998), 203–242.
- 3[3] K. Ebraihimi-Fard, L. Guo: Coherent unit actions on operads and Hopf algebras, Theory Appl. Categ. 18 (2007), 348–371.
- 4[4] K. Ebraihimi-Fard, L. Guo: Free Rota-Baxter algebras and rooted trees, J. Algebra Appl. 7 (2008), 167–194.
- 5[5] J. Fröhlich, F. Gabbiani: Braid statistics in local quantum theory, Rev. Math. Phys. 2 (1990), 251–353.
- 6[6] L. Foissy: Les algébres de Hopf des arbres enracinés décorés. I, Bull. Sci. Math. 126 (2002), 193–239.
- 7[7] L. Foissy: Les algébres de Hopf des arbres enracinés décorés. II, Bull. Sci. Math. 126 (2002), 249-288.
- 8[8] L. Foissy: Quantifications des algèbres de Hopf d’arbres plans décorés et lien avec les groupes quantiques, Bull. Sci. Math. 127 (2003), 505–548.
