We introduce the notions of preordered and heap-preordered forests, generalizing the construction of ordered and heap-ordered forests. We prove that the algebras of preordered and heap-preordered forests are Hopf for the cut coproduct, and we constru
ct a Hopf morphism to the Hopf algebra of packed words. Moreover, we define another coproduct on the preordered forests given by the contraction of edges. Finally, we give a combinatorial description of morphims defined on Hopf algebras of forests with values in the Hopf algebras of shuffes or quasi-shuffles.
In this paper, we introduce the notion of bigraft algebra, generalizing the notions of left and right graft algebras. We give a combinatorial description of the free bigraft algebra generated by one generator and we endow this algebra with a Hopf alg
ebra structure, and a pairing. Next, we study the Koszul dual of the bigraft operad and we give a combinatorial description of the free dual bigraft algebra generated by one generator. With the help of a rewriting method, we prove that the bigraft operad is Koszul. Finally, we define the notion of infinitesimal bigraft bialgebra and we prove a rigidity theorem for connected infinitesimal bigraft bialgebras.
