Grafting algebras. (Q695687)

In order to compute certain probabilities associated to a random walk, \textit{F. Menous} introduced [in Random walks on \(\mathbb R\) and ordered trees: first applications. Prépublication d'Orsay No. 2002-11 \url{http://www.math.u-psud.fr/~biblio/ppo/2002/ppo2002-11.html}] a family of ordered forests, inductively defined with the help of two operators. The combinatorial and algebraic properties of this set \(\mathcal G\) of forests are here discussed. 1. For any plane tree \(T\), the number of total orders on \(T\) making it an element of \(\mathcal G\) is described. 2. It is proved that the subspace \(\mathcal B_\infty\) of the Connes-Kreimer Hopf algebra of ordered forests generated by \(\mathcal G\) is a Hopf subalgebra. The inductive construction of \(\mathcal G\) also defines an increasing family \((\mathcal B_i)_{i\geq 1}\) of Hopf subalgebras of \(\mathcal B_\infty\), the first one being isomorphic to the Connes-Kreimer Hopf algebra. 3. Generalizing the construction of \(\mathcal G\), a Hopf algebra \(\mathcal B\) containing \(\mathcal B_\infty\) is obtained. It is proved that it is free, cofree and self-dual, using a rigidity theorem on duplicial-codendriform Hopf algebras. The primitive elements of this codendriform structure are related to Schröder numbers. 4. Two other grafting products are defined on \(\mathcal B\), making it a bigrafting algebra, that is to say, for all \(x,y,z\) in the augmentation ideal of \(\mathcal B\): \[ \begin{alignedat}{3} (xy)z&=x(yz),&\quad x\prec (yz)&=(x\prec y)\prec z,&\quad (xy)\succ z&=x\succ(y\succ z),\\ (x\succ y)z&=x\succ(yz),&\quad x(y\prec z)&=(xy)\prec z,&\quad x\succ (y\prec z)&=(x\succ y) \prec z.\end{alignedat} \] As a bigrafting algebra, it is generated by the unique tree with one vertex, but not freely.