Ordered Forests, Permutations, and Iterated Integrals

DOI10.1093/IMRN/RNR273MaRDI QIDQ5250674zbMATH OpenOpenAlexFDO

Authors Loïc Foissy, Jeremie Unterberger

Publication date 22 May 2015

Published in IMRN. International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.5208

zbMATH Keywords

decorated rooted treesHopf algebrasquasi-symmetric functionsrough path theory

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05) Symmetric functions and generalizations (05E05) Connections of Hopf algebras with combinatorics (16T30)

Abstract: We construct an explicit Hopf algebra isomorphism from the algebra of heap-ordered trees to that of quasi-symmetric functions, generated by formal permutations, which is a lift of the natural projection of the Connes-Kreimer algebra of decorated rooted trees onto the shuffle algebra. This isomorphism gives a universal way of lifting measure-indexed characters of the Connes-Kreimer algebra into measure-indexed characters of the shuffle algebra, already introduced in cite{Unterberger} in the framework of rough path theory as the so-called Fourier normal ordering algorithm.

Recommendations

• Ordered forests and parking functions.
• On the Turán number of ordered forests
• On the Turán number of ordered forests
• Forests and pattern-avoiding permutations modulo pure descents
• Linear forests and ordered cycles
• Hyperplane arrangements, interval orders, and trees.
• Some combinatorial problems on ordered trees
• Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers
• scientific article; zbMATH DE number 5119884
• Forest-like permutations

Cited in

(13)

• Iterated-sums signature, quasisymmetric functions and time series analysis
• A renormalized rough path over fractional Brownian motion
• Forest-like permutations
• Polynomial realizations of some combinatorial Hopf algebras
• Deformation of the Hopf algebra of plane posets.
• Plane posets, special posets, and permutations
• Preordered forests, packed words and contraction algebras
• Filtrations in Dyson-Schwinger equations: Next-to\(^{\{j \}}\)-leading log expansions systematically
• From constructive field theory to fractional stochastic calculus. I: An introduction: Rough path theory and perturbative heuristics
• Free and cofree Hopf algebras.
• From constructive field theory to fractional stochastic calculus. II: Constructive proof of convergence for the Lévy area of fractional Brownian motion with Hurst index \(\alpha \in \left(\frac{1}{8},\frac{1}{4}\right)\)
• A combinatorial Hopf algebra on partition diagrams
• Ramification of rough paths

This page was built for publication: Ordered Forests, Permutations, and Iterated Integrals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5250674)