Ordered forests, permutations and iterated integrals

Details Ordered forests, permutations and iterated integrals Ordered forests, permutations and iterated integrals

2010-04-29

arxiv.org/abs/1004.5208v1

Mathematics

Combinatorics

23 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Ordered forests, permutations and iterated integrals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ordered forests, permutations and iterated integrals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordered forests, permutations and iterated integrals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-284623