Searcharxiv⌕ Search

arXiv subjects

Paul Laubie

Publications and source records attributed to Paul Laubie.

9 recordsLinked to original sources
arXiv2026

On the equivalence between the Polchinski flow and the Connes-Kreimer approaches to perturbative renormalisation

We prove a correspondence between the Polchinski flow and the Connes-Kreimer approaches to perturbative renormalisation, in the sense that the first yields the same renormalisation as the latter. More precisely, we show that an ansatz based on decorated graphs (Feynman diagrams),with a combinatorial renormalisation procedure solves the Polchinski equation. This result holds for very general Euclidean quantum field theories. We are able to derive from this the form of the renormalised potential which is, to the best of our knowledge, the most general one in the literature. The main ingredients of the proof are multiple morphism properties with respect to the renormalisation, as well as a novel duality formula for forests of decorated graphs.

math-ph↗
arXiv2026

Banach fixed point and flow approach for rough analysis

In this paper, we show that the main algebraic assumption required to perform a fixed point argument for rough differential equations implies the algebraic assumption for the Bailleul flow approach. This assumption requires that the rough path associated with the equation is given by a Hopf algebra whose coproduct admits a cocycle and has a tree-like basis. We show that the Hopf algebra of multi-indices does not satisfy the cocycle condition. This is a rigorous result on the impossibility, observed in practice, of performing a fixed point argument for multi-indices rough paths and multi-indices in Regularity Structures.

math.PR↗
arXiv2025

Elementary differentials from multi-indices to rooted trees

Rooted trees are essential for describing numerical schemes via the so-called B-series. They have also been used extensively in rough analysis for expanding solutions of singular Stochastic Partial Differential Equations (SPDEs). When one considers scalar-valued equations, the most efficient combinatorial set is multi-indices. In this paper, we investigate the existence of intermediate combinatorial sets that will lie between multi-indices and rooted trees. We provide a negative result stating that there is no combinatorial set encoding elementary differentials in dimension $d\neq 1$, and compatible with the rooted trees and the multi-indices aside from the rooted trees. This does not close the debate of the existence of such combinatorial sets, but it shows that it cannot be obtained via a naive and natural approach.

math.NA↗
arXiv2025

On Hilbert series of Koszul operads and a classification result for set-operads

Motivated by numerous examples in the literature, we state a conjecture on the Hilbert series of Koszul symmetric operads generated by one element of arity $2$. We prove this conjecture for all Koszul symmetric set-operads generated by one element of arity $2$ by explicitly classifying those. There are $11$ such operads; $4$ of them are new.

math.QA↗
arXiv2024

Volume preservation of Butcher series methods from the operad viewpoint

We study a coloured operad involving rooted trees and directed cycles of rooted trees that generalizes the operad of rooted trees of Chapoton and Livernet. We describe all the relations between the generators of a certain suboperad of that operad, and compute the Chevalley-Eilenberg homology of two naturally arising differential graded Lie algebras. This allows us to give short and conceptual new proofs of two important results on Butcher series methods of numerical solution of ODEs: absence of volume-preserving integration schemes and the acyclicity of the aromatic bicomplex, the key step in a complete classification of volume-preserving integration schemes using the so called aromatic Butcher series.

math.CT↗
arXiv2024

Hypertrees and embedding of the $\mathrm{FMan}$ operad

The operad $\mathrm{FMan}$ encodes the algebraic structure on vector fields of Frobenius manifolds, in the same way as the operad $\mathrm{Lie}$ encodes the algebraic structure on vector fields of a smooth manifold. It is well known that the operad $\mathrm{Lie}$ admits an embedding in the operad $\mathrm{PreLie}$ encoding pre-Lie algebras. We prove a conjecture of Dotsenko stating that the operad $\mathrm{FMan}$ admits an embedding in the operad $\mathrm{ComPreLie}$. The operad $\mathrm{ComPreLie}$ is the operad encoding pre-Lie algebras with an additional commutative product such that right pre-Lie multiplications act as derivations. To prove this result, we first remark a link between the Greg trees and the so-called operadic twisting of $\mathrm{PreLie}$. We then give a combinatorial description of the operad $\mathrm{ComPreLie}$ \emph{à la} Chapoton-Livernet with forests of rooted hypertrees. We generalize this construction to forests of rooted Greg hypertrees, and then use operadic twisting techniques to prove the conjecture.

math.QA↗
arXiv2023

Combinatorics of pre-Lie products sharing a Lie bracket

We study in detail the operad controlling several pre-Lie algebra structures sharing the same Lie bracket. Specifically, we show that this operad admits a combinatorial description similar to that of Chapoton and Livernet for the pre-Lie operad, and that it has many of the remarkable algebraic properties of the pre-Lie operad.

math.QA↗