Related papers: Preordered forests, packed words and contraction a…
Consider the coradical filtrations of the Hopf algebras of planar binary trees of Loday and Ronco and of permutations of Malvenuto and Reutenauer. We give explicit isomorphisms showing that the associated graded Hopf algebras are dual to…
This is a survey article on trees, with a modest number of proofs to give a flavor of the way these topologies can be efficiently handled. Trees are defined in set-theorist fashion as partially ordered sets in which the elements below each…
We construct explicit polynomial realizations of some combinatorial Hopf algebras based on various kind of trees or forests, and some more general classes of graphs, ranging from the Connes-Kreimer algebra to an algebra of labelled forests…
We define a "combinatorial Hopf algebra" as a Hopf algebra which is free (or cofree) and equipped with a given isomorphism to the free algebra over the indecomposables (resp. the cofree coalgebra over the primitives). The choice of such an…
We use the diagram-free approach to regularity structures introduced by Otto et. al. to build rough paths based on multi-indices. We identify the analogue of the insertion pre-Lie algebra of trees and use it to build the corresponding group…
This is a study on pattern Hopf algebras in combinatorial structures. We introduce the notion of combinatorial presheaf, by adapting the algebraic framework of species to the study of substructures in combinatorics. Afterwards, we consider…
In this paper, we define a Hopf algebra structure on the vector space spanned by packed words using a selection/quotient coproduct. We show that this algebra is free on its irreducible packed words. We also construct the Hilbert series of…
We propose a combinatorial formula for the coproduct in a Hopf algebra of decorated multi-indices that recently appeared in the literature, which can be briefly described as the graded dual of the enveloping algebra of the free Novikov…
We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here…
We explore from an algebraic viewpoint the properties of the tree languages definable with a first-order formula involving the ancestor predicate, using the description of these languages as those recognized by iterated block products of…
Typed decorated trees are used by Bruned, Hairer and Zambotti to give a description of a renormalisation processon stochastic PDEs. We here study the algebraic structures on these objects: multiple prelie algebrasand related operads…
Description of cocommutative Hopf algebras associated with families of trees. Applications include Cayley's theorem on the number of rooted trees with n nodes, and Catalan's theorem on the number of rooted ordered trees with n nodes.
One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
In "Hopf algebra of the planar binary trees", Adv. Math. 139 (1998), no. 2, 293--309, we constructed by induction a graded associative product on the vector space generated by the planar binary trees (resp. the permutations). In the present…
D. Calaque, K. Ebrahimi-Fard and D. Manchon have recently defined a Hopf algebra by introducing a new coproduct on a commutative algebra of rooted forests. The space of primitive elements of the graded dual is endowed with a left pre-Lie…
We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…
We classify graded Hopf algebras structures over path coalgebras, that is over free pointed coalgebras, using Hopf quivers which are analogous to Cayley graphs. The description involves formulas for the product besides the canonical…
The operation of squaring (coproduct followed by product) in a combinatorial Hopf algebra is shown to induce a Markov chain in natural bases. Chains constructed in this way include widely studied methods of card shuffling, a natural…
An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…