Related papers: On Overlapping Divergences
This paper generalizes the operadic construction of the Connes-Kreimer Hopf algebra of rooted trees by Moerdijk. Examples of Hopf algebras obtained in this way include the Loday-Ronco Hopf algebra of planar binary trees and the…
We study multicolour, oriented and high-dimensional discrepancies of the set of all subtrees of a tree. As our main result, we show that the $r$-colour discrepancy of the subtrees of any tree is a linear function of the number of leaves…
We get new Hopf algebras (HA): 1. A wealth of quotient HA's of the Malvenuto-Reutenauer HA (the Loday-Ronco HA being a special case). They consist of the permutations avoiding an {\it arbitrary} set of permutations without global descents,…
Descents in permutations or words are defined from the relative position of two consecutive letters. We investigate a statistic involving patterns of k consecutive letters, and show that it leads to Hopf algebras generalizing noncommutative…
We present a bijection from planar reduced trees to planar rooted hypertrees, which extends Knuth's rotation correspondence between planar binary trees and planar rooted trees. The operadic counterpart of the new bijection is explained.…
In this article we discuss the Hopf algebras spanned by the adjacency matrices in detail. We show that there two Hopf algebraic structures concerning the adjacency matrices, one is the copy of Connes-Kreimer Hopf algebra, another one is the…
Starting from an operad, one can build a family of posets. From this family of posets, one can define an incidence Hopf algebra. By another construction, one can also build a group directly from the operad. We then consider its Hopf algebra…
We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…
We investigate a method of construction of central deformations of associative algebras, which we call centrification. We prove some general results in the case of Hopf algebras and provide several examples.
We construct and study new generalisations to rooted trees and forests of some properties of shuffles of words. First, we build a coproduct on rooted trees which, together with their shuffle, endow them with bialgebra structure. We then…
The aim of this paper is to show that there is a Hopf structure of the parabosonic and parafermionic algebras and this Hopf structure can generate the well known Hopf algebraic structure of the Lie algebras, through a realization of Lie…
Agreement forests continue to play a central role in the comparison of phylogenetic trees since their introduction more than 25 years ago. More specifically, they are used to characterise several distances that are based on tree…
We extend the results we obtained in an earlier work. The cocommutative case of rooted ladder trees is generalized to a full Hopf algebra of (decorated) rooted trees. For Hopf algebra characters with target space of Rota-Baxter type, the…
In late October 2004 I did a search on Hopf algebras in the database ZMATH to find out where they occur and what use is made of them (I.e. what applications there are). The result is a little astonishing, as can be seen from what follows.
We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high…
In this paper, we first endow the space of decorated planar rooted forests with a coproduct that equips it with the structure of a bialgebra and further a Moerdijk Hopf algebra. We also present a combinatorial description of this coproduct,…
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…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…
We extend a classical construction on symmetric functions, the superization process, to several combinatorial Hopf algebras, and obtain analogs of the hook-content formula for the (q,t)-specializations of various bases. Exploiting the…
The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other parameters (including Ferrers dimension), obtaining a string…