Search arXivSearch

arXiv · 2506.03767

Construction of pre-and post-Lie algebras for stochastic PDEs

Abstract

We give and study a construction of pre-Lie algebra structures on rooted trees whose edges and vertices are decorated, with a grafting product acting, through a map $ϕ$, both on the decoration of the created edge and on the vertex that holds the grafting. We show that this construction gives a pre-Lie algebra if, and only if, the map $ϕ$ satisfies a commutation relation, called tree-compatibility. We show how to extend this pre-Lie algebra structure to a post-Lie one by a semi-direct extension with another post-Lie algebra. We also define several constructions to obtain tree-compatible maps, and give examples, including a description of all tree-admissible maps when the space of decorations of the vertices is $2$-dimensional and the space of decorations of the edges is finite-dimensional. A particular example of such a construction is used by Bruned, Hairer and Zambotti for the study of stochastic partial differential equations: when no noise is involved, we show that the underlying tree-compatible map is the exponential of a simpler one and deduce an explicit isomorphism with a classical pre-Lie algebra of rooted trees; when a noise is involved, we obtain the underlying tree-compatible map as a direct sum. We also obtain with our formalism the post-Lie algebras described by Bruned and Katsetsiadis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Loïc Foissy. 2026-08-12. Construction of pre-and post-Lie algebras for stochastic PDEs. https://doi.org/10.46298/jonas.17868

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO