Related papers: On Overlapping Divergences
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
It is known that there is a Hopf algebra structure on the vector space with basis all heap-ordered trees. We give a new bialgebra structure on the space with basis all permutations and show that there is a direct bialgebra isomorphism…
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.
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…
We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…
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…
A new nonparametric approach, based on a decision tree algorithm, is proposed to calculate the overlap between two probability distributions. The devised framework is described analytically and numerically. The convergence of the estimated…
We consider a model for topological recursion based on the Hopf Algebra of planar binary trees of Loday and Ronco. We show that extending this Hopf Algebra by identifying pairs of nearest neighbor leaves and producing in this way graphs…
We find a formula to compute the number of the generators, which generate the $n$-filtered space of Hopf algebra of rooted trees, i.e. the number of equivalent classes of rooted trees with weight $n$. Applying Hopf algebra of rooted trees,…
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…
We present a new formula for the antipode of incidence Hopf algebras. This formula is expressed as an alternating sum over forests. First, we prove the formula for incidence Hopf algebras of families of lattices by exhibiting a map from…
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…
Three equivalent methods allow to compute the antipode of the Hopf algebras of Feynman diagrams in perturbative quantum field theory (QFT): the Dyson-Salam formula, the Bogoliubov formula, and the Zimmermann forest formula. Whereas the…
We endow the space of rooted planar trees with an structure of Hopf algebra. We prove that variations of such a structure lead to Hopf algebras on the spaces of labelled trees, $n$--trees, increasing planar trees and sorted trees. These…
The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…
Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…
We reinvestigate Kreimer's Hopf algebra structure of perturbative quantum field theories with a special emphasis on overlapping divergences. Kreimer first disentangles overlapping divergences into a linear combination of disjoint and nested…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.