Related papers: Tree algebras over topological vector spaces in ro…
In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…
Given any simple biorientable graph it is shown that there exists a weak {*}-Hopf algebra constructed on the vector space of graded endomorphisms of essential paths on the graph. This construction is based on a direct sum decomposition of…
The Malvenuto-Reutenauer algebra is a well-studied combinatorial Hopf algebra with a basis indexed by permutations. This algebra contains a wide variety of interesting sub Hopf algebras, in particular the Hopf algebra of plane binary trees…
Realization by linear vector fields is constructed for any Lie algebra which admits a biorthogonal system and for its any suitable representation. The embedding into Lie algebras of linear vector fields is analogous to the classical…
The m-Tamari lattice of F. Bergeron is an analogue of the clasical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the…
The renormalization of quantum field theory twists the antipode of a noncocommutative Hopf algebra of rooted trees, decorated by an infinite set of primitive divergences. The Hopf algebra of undecorated rooted trees, ${\cal H}_R$, generated…
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 linear mapping upon real n-dimensional space, where the dimension n is odd, has a real eigenvalue-eigenvector pair. The corresponding statement for complex vector spaces holds true for any dimension n, but should be easy to demonstrate…
We consider the approach of replacing trees by multi-indices as an index set of the abstract model space $\mathsf{T}$ introduced by Otto, Sauer, Smith and Weber to tackle quasi-linear singular SPDEs. We show that this approach is consistent…
We give a natural and complete description of Ecalle's mould-comould formalism within a Hopf-algebraic framework. The arborification transform thus appears as a factorization of characters, involving the shuffle or quasishuffle Hopf…
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.…
We introduce normal coordinates on the infinite dimensional group $G$ introduced by Connes and Kreimer in their analysis of the Hopf algebra of rooted trees. We study the primitive elements of the algebra and show that they are generated by…
We show that several spaces of holomorphic functions on a Riemann domain over a Banach space, including the nuclear and Hilbert-Schmidt bounded type, are locally $m$-convex Fr\'echet algebras. We prove that the spectrum of these algebras…
Let R be a perfect F_p-algebra, equipped with the trivial norm. Let W(R) be the ring of p-typical Witt vectors over R, equipped with the p-adic norm. At the level of nonarchimedean analytic spaces (in the sense of Berkovich), we demonstrate…
In this paper, we investigate reflected backward stochastic differential equations driven by rough paths (rough RBSDEs), which can be viewed as probabilistic representations of nonlinear rough partial differential equations (rough PDEs) or…
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…
With the algebraic trees, L\"ohr and Winter (2021) introduced a generalization of the notion of graph-theoretic trees to account for potentially uncountable structures. The tree structure is given by the map which assigns to each triple of…
In 2015, Bailleul presented a mechanism to solve rough differential equations by constructing flows, using the log-ODE method. We extend this notion in two ways: On the one hand, we localize Bailleul's notion of an almost-flow to solve RDEs…
A tree is pathwise-random if all of its paths are Martin-Lof random. We show that (a) no weakly 2-random real computes a perfect pathwise-random tree; it follows that the class of perfect pathwise-random trees is null, with respect to any…
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…