相关论文: Trees, functional equations, and combinatorial Hop…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…

We describe the proalgebraic groups represented by three Hopf algebras on planar binary trees previously introduced by the author and Christian Brouder in relation with the renormalization of quantum electrodynamics. Using two monoidal…

The subject of this paper are two Hopf algebras which are the non-commutative analogues of two different groups of formal power series. The first group is the set of invertible series with the multiplication, while the second group is the…

In Chapter 1 we fully characterise pairs of finite graphs which form a gap in the full homomorphism order. This leads to a simple proof of the existence of generalised duality pairs. We also discuss how such results can be carried to…

In this work a combinatorial description is provided of a Faa di Bruno type Hopf algebra which naturally appears in the context of Fliess operators in nonlinear feedback control theory. It is a connected graded commutative and…

Using methods from math-ph/9907010, we study families of Hopf algebra structures on coloured trees.

As a fundamental and ubiquitous combinatorial notion, species has attracted sustained interest, generalizing from set-theoretical combinatorial to algebraic combinatorial and beyond. The Rota-Baxter algebra is one of the algebraic…

Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…

In the paper, the representation rings (or the Green rings) for a family of Hopf algebras of tame type, the 2-rank Taft algebra (at $q=-1$) and its two relatives twisted by 2-cocycles are explicitly described via a representation theoretic…

Convolution trees, loopy belief propagation, and fast numerical p-convolution are combined for the first time to efficiently solve networks with several additive constraints between random variables. An implementation of this "convolution…

Full binary trees naturally represent commutative non-associative products. There are many important examples of these products: finite-precision floating-point addition and NAND gates, among others. Balance in such a tree is highly…

Networks having the geometry and the connectivity of trees are considered as the spatial support of spatiotemporal dynamical processes. A tree is characterized by two parameters: its ramification and its depth. The local dynamics at the…

Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of…

We give a proof, using harmonic maps from disks to real trees, of Skora's theorem (Morgan-Otal (1993), Skora (1990), originally conjectured by Shalen): if G is the fundamental group of a surface of genus at least 2, then any small minimal…

The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…

We prove that extension groups in strict polynomial functor categories compute the rational cohomology of classical algebraic groups. This result was previously known only for general linear groups. We give several applications to the study…

This is a review paper on recent work about the connections between rough path theory, the Connes-Kreimer Hopf algebra on rooted trees and the analysis of finite and infinite dimensional differential equation. We try to explain and motivate…

In this paper we face the problem of representation of functional data with the tools of algebraic topology. We represent functions by means of merge trees, which, like the more commonly used persistence diagrams, are invariant under…

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…