Related papers: Rooted tree maps and the derivation relation for m…
We investigate several Hopf algebras of diagrams related to Quantum Field Theory of Partitions and whose product comes from the Hopf algebras WSym or WQSym respectively built on integer set partitions and set compositions. Bases of these…
This paper will show when a rooted path tree of a finite directed rooted graph has only finitely many orbits under the action of its undirected automorphism group (i.e. when it is cocompact). This will allow us to specify which trees are…
The natural Hopf algebra $\mathbf{N} \cdot \mathcal{O}$ of an operad $\mathcal{O}$ is a Hopf algebra whose bases are indexed by some words on $\mathcal{O}$. We construct polynomial realizations of $\mathbf{N} \cdot \mathcal{O}$ by using…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An…
This note derives asymptotic upper and lower bounds for the number of planted plane trees on $n$ nodes assigned labels from the set $\{1,2,\ldots, k\}$ with the restriction that on any path from the root to a leaf, the labels must strictly…
We introduce a class of polynomial maps that we call polynomial roots of powerseries, and show that automorphisms with this property generate the automorphism group in any dimension. In particular we determine generically which polynomial…
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…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
One of the features inherent in nested Archimedean copulas, also called hierarchical Archimedean copulas, is their rooted tree structure. A nonparametric, rank-based method to estimate this structure is presented. The idea is to represent…
We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…
We introduce the concept of a conical zeta value as a geometric generalization of a multiple zeta value in the context of convex cones. The quasi-shuffle and shuffle relations of multiple zeta values are generalized to open cone subdivision…
Using the block filtration as a realisation of the coradical filtration, we study the discrepancy between the depth filtration and the coradical filtration for motivic multiple zeta values. We construct an explicit dictionary between a…
This is an exposition in order to give an explicit way to understand (1) a non-topological proof for an existence of a base of an affine root system, (2) a Serre-type definition of an elliptic Lie algebra with rank =>2, and (3) the…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
In evolutionary biology, phylogenetic networks are graphs that provide a flexible framework for representing complex evolutionary histories that involve reticulate evolutionary events. Recently phylogenetic studies have started to focus on…
A graph is a $k$-leaf power of a tree $T$ if its vertices are leaves of $T$ and two vertices are adjacent in $T$ if and only if their distance in $T$ is at most $k$. Then $T$ is a $k$-leaf root of $G$. This notion was introduced by…
In this paper, we construct explicitly a noncommutative symmetric (${\mathcal N}$CS) system over the Grossman-Larson Hopf algebra of labeled rooted trees. By the universal property of the ${\mathcal N}$CS system formed by the generating…
We build, using the notion of zinbiel algebra, some commutative subalgebras $C_{u,v}$ inside an algebra of formal iterated integrals. There is a quotient map from this algebra of formal iterated integrals to the algebra of motivic multiple…