Frédéric Menous
email: frederic.menous@math.u-psud.fr

Frédéric Patras
email: frederic.patras@unice.fr

Renormalization: a quasi-shuffle approach

come

Introduction.

In the early 2000s, the usual BPHZ algorithm for renormalization in perturbative quantum field theory has been interpreted, after dimensional regularization, as a Birkhoff decomposition of characters on the Hopf algebra of Feynman graphs, with values in a Rota-Baxter algebra of amplitudes [START_REF] Connes | Renormalization in quantum field theory and the Riemann-Hilbert problem. I: The Hopf algebra structure of graphs and the main theorem[END_REF][START_REF] Connes | Renormalization in quantum field theory and the Riemann-Hilbert problem. II: The β-function, diffeomorphisms and the renormalization group[END_REF][START_REF] Ebrahimi-Fard | Birkhoff type decompositions and the Baker-Campbell-Hausdorff recursion[END_REF]. This idea was later shown to be meaningful in a broad variety of contexts: in the theory of dynamical systems, in analysis and numerical analysis (Rayleigh-Schrödinger series) or, more recently, in the theory of regularity structures and the study of very irregular stochastic differential equations or stochastic partial differential equations, see e.g. [START_REF] Menous | On the stability of some groups of formal diffeomorphisms by the Birkhoff decomposition[END_REF][START_REF] Menous | Formal differential equations and renormalization[END_REF][START_REF] Menous | From Dynamical Systems to Renormalization[END_REF][START_REF] Hairer | A theory of regularity structures[END_REF][START_REF] Bruned | Algebraic renormalisation of regularity structures[END_REF] In this context, P. Cartier suggested the existence of a hidden universal symmetry group (the "cosmical Galois group") that would underlie renormalization. Using geometrical tools such as universal singular frames, Connes and Marcolli constructed a candidate group in 2004 [START_REF] Connes | From physics to number theory via noncommutative geometry[END_REF]. Their construction was translated in the langage of Hopf algebras in [START_REF] Ebrahimi-Fard | A Lie theoretic approach to renormalization[END_REF] and the group shown to coincide with the prounipotent group of group-like elements in the completion with respect to the grading of the descent algebra -a Hopf algebra that, as an algebra, is the free associative algebra generated by the Dynkin operators [START_REF] Patras | L'algèbre des descentes d'une bigèbre graduée[END_REF].

However, the action of this group or of the descent algebra on the Hopf algebras of Feynman diagrams showing up in pQFT does not actually perform renormalization. It captures nicely certain phenomena related to Lie theory and the behaviour of the Dynkin operators: for example, the structure of certain renormalization group equations and the algebraic properties of beta functions (see the original article by Connes and Marcolli [START_REF] Connes | From physics to number theory via noncommutative geometry[END_REF] and the detailed algebraic and combinatorial analysis of these phenomena in [START_REF] Patras | Dynkin operators and renormalization group actions in pQFT[END_REF]. Further insights on the role of (generalized) Dynkin operators in the theory of differential equations can be found in [START_REF] Menous | Logarithmic Derivatives and Generalized Dynkin Operators[END_REF]). However, the group and the descent algebra act on Feynman diagrams and do not encode operations that occur at the level of the target algebra of amplitudes. They fail therefore to capture typical renormalization operations such as projections on divergent or regular components of amplitudes. Substraction maps, for example, cannot be encoded in it, and neither are more advanced operations such as the construction of the counterterm.

In the present article, we follow a different approach that complements Connes-Marcolli's and its Hopf algebraic and combinatorial interpretation by showing show how a semigroup of operators can be associated to the algebra of coefficients of a given regularization and renormalization scheme in pQFT. Its construction relies heavily on the universal properties of commutative and noncommutative quasi-shuffle algebras. This semigroup acts in a natural way on regularized amplitudes and perform the expected operations: preparation map, extraction of counterterms, renormalization. Notice that many of our results and constructions do not require the algebra of coefficients to be commutative.

Let us sketch up the ideas and results. Concretely we deal with conilpotent bialgebras H = k ⊕ H + . These bialgebras are Hopf algebras and the coalgebra structure on H induces a convolution product on the space L(H, A) of linear morphisms from H to an associative algebra A. If A is unital, then the subset U(H, A) of linear morphisms that send the unit 1H of H on the unit 1A of A is a group for the convolution and, if A is commutative, the subset C(H, A) of characters (i.e. algebra morphisms) is a subgroup of U(H, A).

In pQFT, the algebra A is often called the algebra of (regularized) amplitudes, and we will often use this terminology. In this context, the renormalization process equips the target unital algebra A with a projection operator p+ such that

A = Im p+ ⊕ Im p-= A+ ⊕ A-,
where p-= Id -p+ and A+ and A-are subalgebras. Here, p-should be thought of as a projection on the "divergent part", so that p+ substract divergences. For example, in dimensional regularization, A identifies with the algebra of Laurent series, [[ε, ε -1 ], and p-(resp. p+) is the projection on ε -1 [ε -1 ] (resp.

[[ε]]). As was first observed by Ebrahimi-Fard, building on previous results by Brouder and Kreimer, these data define a Rota-Baxter algebra structure on A and L(H, A).

The choice of the subtraction operator is not always unique -for example when using momentum subtraction schemes. How this phenomenon impacts the combinatorics and Rota-Baxter structures was investigated in [START_REF] Ebrahimi-Fard | Exponential Renormalization II: Bogoliubov's Roperation and momentum subtraction schemes[END_REF]. Although we do not investigate it further here, the tools we develop in the present article should be useful in that context since they put forward the idea that one should study for its own the combinatorial structure of the target algebra of amplitudes A, independently of the choice of a particular subtraction map p+.

It is then well-know that, given p+, there exists a unique Birkhoff decomposition of any

morphism ϕ ∈ U(H, A) ϕ- * ϕ = ϕ+ ϕ+, ϕ-∈ U(H, A)
where ϕ+(H + ) ⊂ A+ and ϕ-(H + ) ⊂ A-. Moreover, if A is commutative, this decomposition is defined in the subgroup C(H, A). The classical proofs of this result are recursive, using the filtration on H (they rely ultimately on the Bogoliubov recursion [START_REF] Ebrahimi-Fard | A noncommutative Bohnenblust-Spitzer identity for Rota-Baxter algebras solves Bogolioubov's recursion[END_REF]). We propose to develop here a "universal" framework to handle the combinatorics of renormalization and to give in this framework explicit, and in some sense universal, formulas for ϕ+ and ϕ-. To do so, we consider the quasi-shuffle Hopf algebra QSh(A) over an algebra A, that is, the standard tensor coalgebra over A equipped with the quasi-shuffle (or stuffle) product. Using the properties of the functor QSh (including the surprising property, for any Hopf algebra H to be canonically embedded into QSh(H + )), we compute then the inverse and the Birkhoff decomposition of a fundamental element j ∈ U(QSh(A), A) defined by

j(1) = 1A, j(a1) = a1, j(a1 ⊗ . . . ⊗ as) = 0 if s ≥ 2.
We show then the existence of an action of U(QSh(A), A) on U(H, A). More precisely we define a map

U(QSh(A), A) × U(H, A) → U(H, A) (f, ϕ) → f ⊙ ϕ, such that j ⊙ ϕ = ϕ and (f * g) ⊙ ϕ = (f ⊙ ϕ) * (g ⊙ ϕ),
and obtain explicit formulas such as:

1. If j * -1 is the inverse of j, then ϕ * -1 = j * -1 ⊙ ϕ.

2. If j- * j = j+ (Birkhoff decomposition), then ϕ- * ϕ = ϕ+ where ϕ± = j± ⊙ ϕ.

The article is organized as follows. After a preliminary section fixing notations and recalling general properties of Hopf algebras, section 2 analyses the algebraic properties of algebras of regularized amplitudes and explains how they give rise to quasi-shuffle algebra structures. Section 3 introduces Hoffman's quasi-shuffle functor (i.e. the notion of quasishuffle algebra over an algebra -in the commutative case, it is the left adjoint to the forgetful functor from quasi-shuffle algebras to commutative algebras). Section 4 investigates its categorical properties, including a surprising right adjoint property (Thm. 1). Section 5 studies, using these techniques, the map j (mapping a cofree coalgebra to its cogenerating vector space). This is the key to latter applications to renormalization which are the purpose of Section 6, as well as the construction, for each algebra of amplitudes, of a "universal semigroup" in which the operations characteristic of renormalization are encoded. The last two sections survey various applications, in particular to Dynamics and Analysis.

We acknowledge support from the CARMA grant ANR-12-BS01-0017, "Combinatoire Algébrique, Résurgence, Moules et Applications"and the CNRS GDR "Renormalisation". We thank warmly K. Ebrahimi-Fard, from whom we learned some years ago already the meaningfulness of Rota-Baxter algebras and their links with quasi-shuffle algebras.

Notation and Hopf algebra fundamentals

Everywhere in the article, algebraic structures are defined over a fixed ground field k of characteristic 0. We fix here the notations relative to bialgebras and Hopf algebras, following [START_REF] Figueroa | Combinatorial Hopf algebras in quantum field theory[END_REF] (see also [START_REF] Cartier | A primer of Hopf algebras[END_REF], [START_REF] Majid | Foundations of quantum group theory[END_REF] and [START_REF] Sweedler | Hopf algebras[END_REF]) and refer to these articles and surveys for details and generalities on the subject. Recall that a bialgebra B is an associative algebra with unit and a coassociative coalgebra with counit such that the product is a morphism of coalgebras (or, equivalently, the coproduct is a morphism of algebras). We will usually write m the product, ∆ the coproduct, u : k → B the unit and η : B → k the counit. When ambiguities might arise we put an index (and denote e.g. mB the product instead of m).

We use freely the Sweedler notation and write

∆h = h (1) ⊗ h (2) . (1)
Thanks to coassociativity, we can define recursively and without any ambiguity the linear morphisms ∆ [n] : B → B ⊗n (n ≥ 1) by ∆ [1] = Id and, for n ≥ 1,

∆ [n+1] = (Id ⊗∆ [n] ) • ∆ = (∆ [n] ⊗ Id) • ∆ = (∆ [k] ⊗ ∆ [n+1-k] ) • ∆ (1 ≤ k ≤ n) (2)
and write

∆ [n] h = h (1) ⊗ . . . ⊗ h (n) (3)
In the same way, for n ≥ 1, we define m [n] : B ⊗ n → B by m [1] = Id and

m [n+1] = m • (Id ⊗m [n] ) = m • (m [n] ⊗ Id) (4)
The reduced coproduct ∆ ′ on H + := Ker η is defined by

∆ ′ h = ∆h -1 ⊗ h -h ⊗ 1 (5)
Its iterates (defined as for ∆) are written ∆ ′ [n] . A bialgebra is conilpotent (or, more precisely, locally conilpotent) is for any h ∈ H + there exists a n ≥ 1 (depending on h) such that ∆ ′[n] (h) = 0.

A bialgebra H is a Hopf algebra if there exists an antipode S, that is to say a linear map S : H → H such that :

m • (Id ⊗S) • ∆ = m • (S ⊗ Id) • ∆ = u • η : H → H (6)
In this article, we will consider only conilpotent bialgebras, which are automatically Hopf algebras.

Given a connected bialgebra H and an algebra A with product mA and unit uA, the coalgebra structure of H induces an associative convolution product on the vector space L(H, A) of k-linear maps :

∀(f, g) ∈ L(H, A) × L(H, A), f * g = mA • (f ⊗ g) • ∆ (7)
with a unit given by uA • η, such that (L(H, A), * , uA • η) is an associative unital algebra.

Lemma 1 Let H be a conilpotent bialgebra (and therefore a Hopf algebra) and set

U(H, A) = {f ∈ L(H, A) ; f (1H ) = 1A} (8)
then U(H, A) is a group for the convolution product.

Proof U(H, A) is obviously stable for the convolution product. Following [START_REF] Figueroa | Combinatorial Hopf algebras in quantum field theory[END_REF], we will remind why any element f ∈ U(H, A) as a unique inverse f * -1 in U(H, A). One can write formally

f * -1 = (uA • η -(uA • η -f )) * -1 = uA • η + k≥1 (uA • η -f ) * k (9)
This series seems to be infinite but, because of the conilpotency assumption, for any

h ∈ H ′ (uA • η -f ) * k (h) = (-1) k m [k] A • f ⊗k • ∆ ′[k] (h) (10)
vanishes for k large enough.

When this result is applied to Id : H → H ∈ U(H, H), then its convolution inverse is the antipode S (this is the usual way of proving that any conilpotent bialgebra is a Hopf algebra).

Notation 1 If B ⊂ A is a subalgebra of A which is not unital, then we write

U(H, B) = {f ∈ L(H, A) ; f (1H ) = 1A and f (H + ) ⊂ B}

This is a subgroup of U(H, A).

Let now C(H, A) be the subset of L(H, A) whose elements are algebra morphisms (also called characters over A). Of course, C(H, A) ⊂ U(H, A) but this shall not be a subgroup: if A is not commutative, there is no reason why it should be stable for the convolution product. Nonetheless if A is commutative, the product from A ⊗ A to A is an algebra map: it follows that the convolution of algebra morphisms is an algebra morphism and C(H, A) is a subgroup of U(H, A).

Moreover if f ∈ U(H, A) is an algebra map, then its inverse f * -1 in U(H, A) is an antialgebra map given by f * -1 = f • S :

f * f • S = mA • (f ⊗ f • S) • ∆ = mA • (f ⊗ f ) • (Id ⊗S) • ∆ = f • m • (Id ⊗S) • ∆ = f • u • η = uA • η, (11)
where we recall that the antipode is an antialgebra morphism:

S(gh) = S(h)S(g).
2 From renormalization to quasi-shuffle algebras

The fundamental ideas of renormalization in pQFT were already alluded at in the introduction, we recall them very briefly and refer to textbooks for details (this first paragraph is mainly motivational, we will move immediately after to an algebraic framework that can be understood without mastering the quantum field theoretical background). Starting from a given quantum field theory, one expands perturbatively the quantities of interest (such as Green's functions). This expansion is indexed by Feynman diagrams, and to each of these diagrams is associated a quantity computed by means of certain integrals. Very often, these integrals are divergent and need to be regularized and renormalized. Typically, a quantity such as φ(c) := ∞ 0 dy y + c is divergent, but becomes convergent up to the introduction of an arbitrary small regularizing parameter ε (for dimensional reasons, one also introduces a mass term µ)

φ(c; ε) := ∞ 0 µ ε dy (y + c) 1+ε = 1 ε + log(µ/c) + O(ε).
In that toy model case, close to the dimensional regularization method, the "regularized amplitude" φ(c; ε)

lives in A = [[ε, ε -1
] and is renormalized by removing the divergency 1 ε (the component of the expansion in ε -1 [ε -1 ]). These ideas are axiomatized using the notion of Rota-Baxter algebras as follows. Following [START_REF] Ebrahimi-Fard | Integrable renormalization. I: The ladder case[END_REF], let p+ an idempotent of L(A, A) where A is a unital algebra (in our toy model example, p+ would stand for the projection on [[ε]]). If we have for x, y in A :

p+(x)p+(y) + p+(xy) = p+(xp+(y)) + p+(p+(x)y)), (12)
then p+ is a Rota-Baxter operator, (A, p+) is a Rota-Baxter algebra and if p-= Id -p+, A+ = Im p+ and A-= Im p-then

• A = A+ ⊕ A-.
• p-satisfies the same relation.

• A+ and A-are subalgebras.

Conversely if A = A+ ⊕ A-and A+ and A-are subalgebras, then the projection p+ on A+ parallel to A-defines a Rota-Baxter algebra (A, p+). The idempotency condition is not required to define a Rota-Baxter algebra. In general:

Definition 1 A Rota-Baxter (RB) algebra is an associative algebra A equipped with a linear endomorphism R such that

∀x, y ∈ A, R(x)R(y) = R(R(x)y + xR(y) -xy).
It is an idempotent RB algebra if R is idempotent (in that case we will set p+ := R to emphasize that we are in the framework typical for renormalization). It is a commutative Rota-Baxter algebra if it is commutative as an algebra.

The notion of Rota-Baxter algebra is actually slightly more general: a Rota-Baxter algebra of weight θ is defined by the identity

∀x, y ∈ A, R(x)R(y) = R(R(x)y + xR(y) + θxy).
We restrict here the definition to the weight -1 case, which is the one meaningful for renormalization.

Using Rota-Baxter algebras of amplitudes, the principle of renormalization in physics can be formulated algebraically in the following way.

Proposition 1 Let H be a conilpotent bialgebra and (A, p+) an idempotent Rota-Baxter algebra (so that A = A-⊕ A+). Then for any ϕ ∈ U(H, A) there exists a unique pair

(ϕ+, ϕ-) ∈ U(H, A+) × U(H, A-) such that ϕ- * ϕ = ϕ+ (13)
Moreover, if A is commutative and ϕ is a character, then ϕ+ and ϕ-are also characters. This factorization is called the Birkhoff decomposition of ϕ.

Proof Let us postpone the assertion on characters and prove the existence and unicity -notions such as the one of Bogoliubov's preparation map will be useful later. As A+ and A-are subalgebras of A, U(H, A+) and U(H, A-) are subgroups of U(H, A). If such a factorization exists, then it is unique :

If ϕ = ϕ * -1 - * ϕ+ = ψ * -1 - * ψ+, then φ = ψ + * ϕ * -1 + = ψ- * ϕ * -1 - ∈ U(H, A+) ∩ U(H, A-) thus for h ∈ H + , φ(h) ∈ A+ ∩ A-= 0.
We finally get that

ψ + * ϕ * -1 + = ψ- * ϕ * -1 - = uA • η and ϕ+ = ψ+, ϕ-= ψ-.
Let us prove now that the factorization exists. Let ϕ ∈ U(H, A), we must have ϕ+(1H ) = ϕ-(1H ) = 1A. Let φ ∈ U(H, A) the Bogoliubov preparation map defined recursively on the increasing sequence of vector spaces

H + n := Ker∆ ′[n] (n ≥ 1) by φ(h) = ϕ(h) -mA • (p-⊗ Id) • ( φ ⊗ ϕ) • ∆ ′ (h) (14)
(since H is conilpotent,

H + = ∪nH + n ). Now if ϕ+ and ϕ-are the elements of U(H, A) defined on H + by ϕ+(h) = p+ • φ(h) , ϕ-(h) = -p-• φ(h) ( φ(h) = ϕ+(h) -ϕ-(h)), then ϕ+ ∈ U(H, A+) , ϕ-∈ U(H, A-) , ϕ- * ϕ = ϕ+
We turn now to another algebraic structure, induced by the one of RB algebras, but weaker -the one we will be concerned later on: quasi-shuffle algebras. Concretely, the target algebras of amplitudes (such as the algebra of Laurent series) happen to be quasishuffle algebras, whereas the algebras of linear forms on Feynman diagrams with values in a commutative RB algebra of amplitudes happen to be noncommutative quasi-shuffle algebras.

Indeed, a RB algebra is always equipped with an associative product, the RB double product ⋆, defined by:

x ⋆ y := R(x)y + xR(y) -xy (15)
so that: R(

x)R(y) = R(x ⋆ y). Setting x ≺ y := xR(y), x ≻ y := R(x)y, one gets (xy) ≺ z = xyR(z) = x(y ≺ z), (x ≺ y) ≺ z = xR(y)R(z) = x ≺ (y ⋆ z), (x ≻ y) ≺ z = R(x)yR(z) = x ≻ (y ≺ z),
and so on. These observations give rise to the axioms of noncommutative quasi-shuffle algebras (NQSh, also called tridendriform, algebras). On an historical note, we learned recently from K. Ebrahimi-Fard that the following axioms and relations seem to have first appeared in the context of stochastic calculus, namely in the work of Karandikar in the early 80's on matrix semimartingales, see e.g. [START_REF] Karandikar | Multiplicative decomposition of non-singular matrix valued continuous semimartingales[END_REF]. See also [START_REF] Foissy | Lie theory for quasi-shuffle algebras[END_REF] for details and other references.

Definition 2 A noncommutative quasi-shuffle algebra (NQSh algebra) is a nonunital associative algebra (with product written •) equipped with two other products ≺, ≻ such that, for all x, y, z ∈ A:

(x ≺ y) ≺ z = x ≺ (y ⋆ z), (x ≻ y) ≺ z = x ≻ (y ≺ z) (16)
(x ⋆ y) ≻ z = x ≻ (y ≻ z), (x ≺ y) • z = x • (y ≻ z) (17)
(x ≻ y) • z = x ≻ (y • z), (x • y) ≺ z = x • (y ≺ z). ( 18
)
where x ⋆ y := x ≺ y + x ≻ y + x • y.

Notice that (x • y) • z = x • (y • z) and ( 16) + ( 17) + ( 18) imply the associativity of ⋆:

(x ⋆ y) ⋆ z = x ⋆ (y ⋆ z). ( 19
)
When the RB algebra is commutative, the relations between the three products ≺, ≻, • simplify (since x ≺ y = xR(y) = y ≻ x) and one arrives at the definition: Definition 3 A quasi-shuffle (QSh) algebra A is a nonunital commutative algebra (with product written •) equipped with another product ≺ such that

(x ≺ y) ≺ z = x ≺ (y ⋆ z) (20)
(x • y) ≺ z = x • (y ≺ z). ( 21
)
where x ⋆ y := x ≺ y + y ≺ x + x • y.

We also set for further use x ≻ y := y ≺ x (this makes a QSh algebra a NQSh algebra). The product ⋆ is automatically associative and commutative and defines another commutative algebra structure on A.

It is sometimes convenient to equip NQSh and QSh algebras with a unit. The phenomenon is exactly similar to the case of shuffle algebras [START_REF] Schützenberger | Sur une propriété combinatoire des algèbres de Lie libres pouvant être utilisée dans un problème de mathématiques appliquées, Séminaire Dubreil-Jacotin Pisot (Algèbre et théorie des nombres)[END_REF]. Given a NQSh algebra, one sets B := k ⊕ A, and the products ≺, ≻, • have a partial extension to B defined by, for x ∈ A:

1 • x = x • 1 := 0, 1 ≺ x := 0, x ≺ 1 := x, 1 ≻ x := x, x ≻ 1 := 0.
The products 1 ≺ 1, 1 ≻ 1 and 1 • 1 cannot be defined consistenly, but one sets 1 ⋆ 1 := 1, making B a unital commutative algebra for ⋆. The categories of NQSh/QSh and unital NQSh/QSh algebras are equivalent (under the operation of adding or removing a copy of the ground field). Formally, the relations between RB algebras and NQSh algebras are encoded by the Lemma:

Lemma 2 The identities x ≺ y := xR(y), x ≻ y := R(x)y, x • y := xy induce a forgetful functor from RB algebras to NQSh algebras, resp. from commutative RB algebras to QSh algebras.

We already alluded to the fact that, in a given quantum field theory, the set of linear forms from the linear span of Feynman diagrams (or equivalently algebra maps from the polynomial algebra they generate) to a commutative RB algebra of amplitudes carries naturally the structure of a noncommutative RB algebra. In the context of QSh algebras, this result generalizes as follows:

Proposition 2 Let C be a (coassociative) coalgebra with coproduct ∆ and A be a NQSh algebra. Then the set of linear maps Hom(C, A) is naturally equipped with the structure of a NQSh algebra by the products:

f ≺ g(c) := f (c (1) ) ≺ g(c (2) ), f ≻ g(c) := f (c (1) ) ≻ g(c (2) ), f • g(c) := f (c (1) ) • g(c (2) ),
where we used Sweedler's notation ∆(c) = c (1) ⊗ c (2) .

The proposition follows from the fact that the relations defining NQSh algebras are nonsymmetric (in the sense that they do not involve permutations: for example, in the equation (x ≺ y) ≺ z = x ≺ (y ⋆ z), the letters x, y, z appear in the same order in the left and right hand side, and similarly for the other defining relations).

3 The quasi-shuffle Hopf algebra QSh(A).

For details on the constructions in this section, we refer the reader to [START_REF] Hoffman | Quasi-shuffle products[END_REF][START_REF] Foissy | Lie theory for quasi-shuffle algebras[END_REF][START_REF] Hoffman | Quasi-shuffle products revisited[END_REF]. Let A be an associative algebra. We write QSh(A) for the graded vector space QSh(A)

= n≥0 QSh(A)n = k ⊕ n≥1 QSh(A)n =: k ⊕ QSh + (A)
where, for n ≥ 1, QSh(A)n = A ⊗n and QSh(A)0 = k (notice that when A is unital, one has to distinguish between 1 ∈ k = QSh(A)0 and 1A ∈ A ⊂ QSh(A)1). We denote l(a) = n the length of an element a of QSh(A)n.

For convenience, an element a = a1 ⊗ . . . ⊗ an of QSh(A) will be called a word and will be written a1 . . . an (it should not be confused with the product of the ai in A). We will reserve the tensor product notation for the tensor product of elements of QSh(A) (so that for example, a1a2 ⊗ a3 ∈ QSh(A)2 ⊗ QSh(A)1). Also, we distinghish between the concatenation product of words (written •: a1a2a3 • b1b2 = a1a2a3b1b2) and the product in A by writing a •A b the product of a and b in A (whereas a • b would stand for the word ab of length 2).

The graded vector space QSh + (A) (resp. QSh(A)) is given a graded (resp. unital) NQSh algebra structure by induction on the length of tensors such that for all a, b ∈ A, for all v, w ∈ QSh(A):

av

≺ bw = a(v ⋆ bw), av ≻ bw = b(av ⋆ w), av • bw = (a.Ab)(v ⋆ w),
where

-:= ⋆ =≺ + ≻ +• is usually called the quasi-shuffle (or stuffle) product (by definition: ∀v ∈ QSh(A), 1 -v = v = v -1)
. Notice that this productcan be defined directly by the two equivalent inductions

av -bw := a(v -bw) + b(av -w) + a •A b(v -w) or va -wb := (v -bw)a + (av -w)b + (v -w)a •A b.
When A is commutative, QSh(A) is a unital quasi-shuffle algebra For example :

a1a2 -b = a1a2b + a1ba2 + ba1a2 + a1(a2 •A b) + (a1 •A b)a2 (22)
Notice at last that, under the action of the four products ≺, ≻, ⋆, •, the image of QSh(A)r ⊗ QSh(A)s is contained in r+s t=max(r,s) QSh(A)t One can also define :

• a counit η : QSh(A) → k by η(1) := 1 and for s ≥ 1, η(a1 . . . as) = 0,

• a coproduct (called deconcatenation coproduct) ∆ :

QSh(A) → QSh(A) ⊗ QSh(A)
such that ∆(1) = 1 ⊗ 1 and for s ≥ 1 and a = a1 . . . as ∈ QSh(A)s,

∆(a) = a ⊗ 1 + 1 ⊗ a + s-1 r=1 (a1 . . . ar) ⊗ (ar+1 . . . as) (23)
making QSh(A) a graded coalgebra. It is a matter of fact to check that QSh(A) is a unital conilpotent bialgebra (and thus a Hopf algebra, see e.g. [START_REF] Cartier | A primer of Hopf algebras[END_REF]), which is called the quasi-shuffle or stuffle Hopf algebra on A (this terminology, that we adopt, is convenient, usual, but slightly misleading because when A is only associative, QSh(A) is a unital noncommutative quasi-shuffle algebra).

Operations and universal properties

Let us focus now in the first part of this section on the case relevant to renormalization, that is when A is commutative but not necessarily unital. It follows then from standard arguments in universal algebra that, given a quasi-shuffle algebra B, morphisms of quasishuffle algebras from QSh + (A) to B are naturally in bijection with morphisms of (non unital) algebras from A to B:

Hom QSh (QSh + (A), B) ∼ = Hom Alg (A, B).
In categorical terms (see [START_REF] Foissy | Lie theory for quasi-shuffle algebras[END_REF] for a direct and elementary proof):

Proposition 3 (Quasi-shuffle PBW theorem) The left adjoint U of the forgetful functor from the category of quasi-shuffle algebras QSh to the category of non unital commutative algebras Com, or "quasi-shuffle enveloping algebra" functor from Com to QSh, is Hoffman's quasi-shuffle algebra functor A -→ QSh + (A).

It is interesting to analyse the concrete meaning of this Proposition. Let us consider first the counit of the adjunction, that is the quasi-shuffle algebra map from QSh + (A) to A, when A is a quasi-shuffle algebra. By definition of ≺, the element a1 . . . an ∈ QSh(A)n can be rewritten (in QSh(A)) a1 ≺ (a2 ≺ . . . (an-1 ≺ an)). The trick goes back to Schützenberger who used it in his seminal but not enough acknowledged study of shuffle algebras [START_REF] Schützenberger | Sur une propriété combinatoire des algèbres de Lie libres pouvant être utilisée dans un problème de mathématiques appliquées, Séminaire Dubreil-Jacotin Pisot (Algèbre et théorie des nombres)[END_REF]. It follows that the counit of the adjunction maps a1 . . . an ∈ QSh(A)n to a1 ≺ (a2 ≺ . . . (an-1 ≺ an)) (computed now in A).

Let us move now to the case when A is a commutative RB algebra. Then, A is in particular a quasi-shuffle algebra with a ≺ b := aR(b). The counit of the same adjunction is then the map that sends a1 . . . an ∈ QSh(A)n to a1R(a2R(a3 . . . R(an-1R(an))). In particular, a n is mapped to aR(aR(a . . . R(aR(a))) -a term that is known to play a key role in renormalization, see in particular [START_REF] Ebrahimi-Fard | A noncommutative Bohnenblust-Spitzer identity for Rota-Baxter algebras solves Bogolioubov's recursion[END_REF].

This relatively standard adjunction analysis can be completed in the case we are interested in (maps from QSh + (A) to B, when B is a quasi-shuffle algebra), due to the existence of a Hopf algebra structure on QSh(A). According to Proposition 2, we have first that Lemma 3 Let A be an associative algebra and B a NQSh algebra, the vector space of linear morphisms L(QSh(A), B) is a NQSh algebra.

Furthermore, by properties that hold for arbitrary maps from a conilpotent Hopf algebra to an algebra, if B is unital, the set of linear maps that map the unit of QSh(A) to the unit of B, U(QSh(A), B) is a group for the product ⋆. Moreover, when B is commutative, the subset of algebra maps from QSh(A) to B, C(QSh(A), B), is a subgroup.

Next, notice that the functor QSh is compatible with Hopf algebra structures: an algebra map l from A to B induces a map QSh(l) of quasi-shuffle algebras from QSh(A) to QSh(B) defined by QSh(l)(1) = 1 and QSh(l)(a1 . . . ar) = l(a1) . . . l(ar) (r ≥ 1) and therefore ∆ • QSh(l) = (QSh(l) ⊗ QSh(l)) • ∆. In particular, QSh(l) is a Hopf algebra morphism.

The last universal property of the QSh functor that we would like to emphasize is more intriguing and does not seem to have been noticed before. Whereas QSh is naturally a left adjoint, it also happens indeed to be a right adjoint, a property that will prove essential in our later developments.

Theorem 1 Let H be a conilpotent Hopf algebra and A be a unital associative algebra, then we have a natural isomorphism between (unital) algebra maps from H to A and Hopf algebra maps from H to QSh(A):

Hom Alg (H, A) ∼ = Hom Hopf (H, QSh(A)).
Indeed, QSh(A) is, as a coalgebra, the cofree coalgebra over A (viewed as a vector space) in the category of conilpotent coalgebras. These properties are dual to the ones of tensor algebras (more familiar, but equivalent up to the fact that the dual of a coalgebra is an algebra but the converse is not always true -this is the reason for the conilpotency hypothesis): the tensor algebra over a vector space V is, when equipped with the concatenation product, the free associative algebra over V . There is therefore a natural isomorphism between linear maps from the kernel C + of the counit of a coaugmented conilpotent coalgebra C to A and coalgebra maps from C to QSh(A)

L(C + , A) ∼ = Hom Coalg (C, QSh(A)).
Coaugmented means that there is a coalgebra map from the ground field to C, insuring that C decomposes as the direct sum of k and of the kernel of the counit (as happens for a Hopf algebra, for which the composition of the unit and the counit is a projection on the ground field orthogonally to the kernel of the counit).

The isomorphism is given explicitly as follows: it maps φ ∈ L(C + , A) to φ :

= ∞ i=0 φ ⊗n • ∆ ′[n] (where φ ⊗0 • ∆ ′[0]
stands for the composition of the counit of C with the unit of QSh(A)). In particular, the map φ factorizes as (the restriction to C + of) j • φ, where j ∈ L(QSh(A), A) is defined by j(1) = 1A, j(a1) = a1 and j(a1 . . . ar) = 0 if r ≥ 2.

To prove the Theorem, it is therefore enough to show that, when a linear map φ from H + to A is the restriction to H + of an algebra map from H to A, then the induced map φ is also an algebra map (since we already know it is a coalgebra map). Concretely, we have to prove that, for h, h ′ ∈ H + , φ(hh ′ ) = φ(h) -φ(h ′ ). The Theorem will then follow if we prove that

∞ n=1 φ ⊗n • ∆ ′[n] (hh ′ ) = ∞ p=1 φ ⊗p • ∆ ′[p] (h) - ∞ q=1 φ ⊗p • ∆ ′[q] (h ′ ).
Using that φ and that ∆ are algebra maps, this follows from the following Lemma (where, to avoid ambiguities, we use the notation ∆ ′

[p] (h) = h ′ (1,p) ⊗ • • • ⊗ h ′ (p,p)
) by identification of the terms in the left and right hand side.

Lemma 4

We have, for the iterated coproduct and h ∈ H + ,

∆ [n] (h) = n i=1 f ∈Inj(i,n) f * (h ′ (1,i) ⊗ • • • ⊗ h ′ (i,i) ),
where Inj(i, n) stands for the set of increasing injections from [i] := {1, . . . , i} to [n] and

f * (h ′ (1,i) ⊗ • • • ⊗ h ′ (i,i) ) = l (1) ⊗ • • • ⊗ l (n)
with l (q) := h ′ (p,i) if q = f (p) and l (q) := 1 if q is not in the image of f .

For example, ∆ [1] (h

) = ∆ ′[1] (h) = h = h ′ (1,1) , ∆ [2] (h) = ∆(h) = h ′ (1,1) ⊗ 1 + 1 ⊗ h ′ (1,1) + h ′ (1,2) ⊗ h ′ (2,2)
and ∆ [2] (hk) = ∆ [2] (h)∆ [2] (k)

= (h ′ (1,1) ⊗ 1 + 1 ⊗ h ′ (1,1) + h ′ (1,2) ⊗ h ′ (2,2) ) × (k ′ (1,1) ⊗ 1 + 1 ⊗ k ′ (1,1) + k ′ (1,2) ⊗ k ′ (2,2) ), so that ∆ ′[2] (hk) = h ′ (1,1) ⊗ k ′ (1,1) + k ′ (1,1) ⊗ h ′ (1,1) + h ′ (1,1) k ′ (1,2) ⊗ k ′ (2,2) + k ′ (1,2) ⊗ h ′ (1,1) k ′ (2,2) +h ′ (1,2) k ′ (1,1) ⊗ h ′ (2,2) + h ′ (1,2) ⊗ h ′ (2,2) k ′ (1,1) + h ′ (1,2) k ′ (1,2) ⊗ h ′ (2,2) k ′ (2,2)
, where one recognizes the tensor degree 2 component of (∆ ′ [1] (h) + ∆ ′ [2] (h)) -(∆ ′ [1] (k) + ∆ ′ [2] (k)).

The Theorem has an important corollary, that we state also as a Theorem in view of its importance for our approach to renormalization.

Theorem 2 Let H be a conilpotent bialgebra, then, the unit, written ι, of the adjunction in the previous Theorem, (ι(1) := 1 and ∀h ∈ H + , ι(h) = k≥1 ∆ ′[k] (h)) defines an injective Hopf algebra morphism from H to QSh(H + ). In particular, any conilpotent (resp. conilpotent commutative) Hopf algebra embeds into a noncommutative quasi-shuffle (resp. a quasi-shuffle) Hopf algebra.

We let the reader check the following Lemma, that will be important later in the article and makes Theorem 1 more precise: Lemma 5 The map j ∈ L(QSh(A), A) is a morphism of algebras.

5 The map j ∈ U (QSh(A), A).

We shall now illustrate the ideas of the previous section on the map j ∈ U(QSh(A), A) (recall it is defined by j(1) = 1A, j(a1) = a1 and j(a1 . . . ar) = 0 if r ≥ 2). In a sense, this will be the only computation of inverse and of Birkhoff decomposition we will need. This map j plays a fundamental role. We already saw that it appears in the adjunction L(C + , A) ∼ = Hom Coalg (C, QSh(A)). It will also appear later to be the unit of a semigroup structure on U(QSh(A), A) to be introduced in the next section.

For the inverse, we get j * -1 :

j * -1 = uA • η + k≥1 (uA • η -j) * k
Which means that j * -1 (1) = 1A and for a = a1 . . . as ∈ QSh(A) + ,

j * -1 (a) = k≥1 (-1) k m [k] A • j ⊗k • ∆ ′[k] (a) = k≥1 (-1) k a 1 •...•a k =a a i ∈QSh(A) + m [k] A • j ⊗k (a 1 ⊗ . . . ⊗ a k ) = (-1) s m [s] A (a1 ⊗ . . . ⊗ as) = (-1) s a1 •A . . . •A as = j • S(a) (24)
where

S(a) = k≥1 (-1) k m [k] • ∆ ′[k] (a) = k≥1 (-1) k a 1 •...•a k =a a i ∈QSh(A) + a 1 -. . . -a k . ( 25
)
Note that the previous sums run over all the possible factorizations in nonempty words of a for the concatenation product. If (A, p+) is a Rota-Baxter algebra then the Bogoliubov preparation map j associated to j, see equation ( 14), is such that j(1) = 1A and can be defined recursively on vector spaces QSh(A)n (n ≥ 1) by

j(h) = j(h) -mA • (p-⊗ Id) • ( j ⊗ j) • ∆ ′ (h) ( 26
)
Let us begin the recursion on the length of the sequence. If a = a1 then j(a1) = j(a1) = a1.

Now, if a = a1 • a2 = a1a2, j(a1a2) = j(a1a2) -mA • (p-⊗ Id) • ( j ⊗ j)((a1) ⊗ (a2)) = -p-(a1) •A a2 (27) and j(a1a2a3) = -mA • (p-⊗ Id) • ( j ⊗ j)((a1a2) ⊗ (a3)) = p-(p-(a1) •A a2) •A a3 (28)
Thus, for r ≥ 2, j(a1 . . . ar) = -p-( j(a1 . . . ar-1))

•A ar (29)
It is then easy to prove that in general (see e.g. [START_REF] Ebrahimi-Fard | A noncommutative Bohnenblust-Spitzer identity for Rota-Baxter algebras solves Bogolioubov's recursion[END_REF] for a systematic study of combinatorial approaches and closed solutions to the Bogoliubov recursion)

Proposition 4
The Birkhoff decomposition

(j+, j-) ∈ U(QSh(A), A+) × U(QSh(A), A-)
such that j- * j = j+ is given by the formula : for r ≥ 1 and a = a1 ⊗ . . . ⊗ ar ∈ QSh(A) + , A) is a group and j + and j-are characters.

j+(a) = p+( j(a)) = (-1) r-1 p+(p-(. . . (p-(a1) •A a2) . . . •A ar-1) •A ar) j-(a) = -p-( j(a)) = (-1) r p-(p-(. . . (p-(a1) •A a2) . . . •A ar-1) •A ar) (30) Moreover, if A is commutative then C(QSh(A),
Proof Let us prove the last assumption, when A is commutative. Since j is a character it is sufficient to prove that j-is a character. By induction on t ≥ 0 we will show that for two tensors a and b in QSh

(A), if l(a) + l(b) = t, then j-(a -b) = j-(a)j-(b) (31)
This identity is trivial for t = 0 and t = 1 since at least one of the sequences is the empty sequence. This also trivial for any t if one of the sequences is empty. Now suppose that t ≥ 2 and that a = a1 . .

= j-((ã -b) • ar) + j-((a -b) • bs) + j-((ã -b) • (arbs)) = j-((ã -b) • ar + (a -b) • bs + (ã -b) • (arbs)) = j-(a -b)
In the sequel, when there is no ambiguity, we shall omit the notation •A when applying formula [START_REF] Menous | Formal differential equations and renormalization[END_REF].

As we will see these formulas are almost sufficient to compute the Birkhoff decomposition for any conilpotent bialgebra. [START_REF] Cartier | A primer of Hopf algebras[END_REF] The universal semigroup and renormalization.

Let A be a unital algebra. Then, by adjunction we know that

U(QSh(A), A) ∼ = Hom Coalg (QSh(A), QSh(A)).
In particular, the composition of coalgebra endomorphisms of QSh(A) equips U(QSh(A), A) with a semigroup structure.

Definition 4

The universal semigroup associated to a unital algebra A is the set U(QSh(A), A) equipped with the associative unital product induced by composition of coalgebra endomorphisms of QSh(A): for f and g in U(QSh(A), A)

f ⊙ g := f • QSh(g) • ι.
Its unit is the map j:

f ⊙ j = f • QSh(j) • ι = f • Id = f.
This semigroup structure generalizes to an action on linear maps from a Hopf algebra to A as follows.

Definition 5 Let H be a conilpotent bialgebra. For ϕ ∈ U(H, A) and f ∈ U(QSh(A), A)

we set f ⊙ ϕ := f • QSh(ϕ) • ι.
This morphism f ⊙ ϕ is linear from H to A and unital:

f ⊙ ϕ(1H ) = f • QSh(ϕ) • ι(1H ) = f • QSh(ϕ)(1) = f (1) = 1A.
We get a left action of U(QSh(A), A) on U(H, A):

⊙ : U(QSh(A), A) × U(H, A) → U(H, A).
Moreover, when A is commutative, if ϕ ∈ C(H, A) and f ∈ C(QSh(A), A) it is clear, by composition of algebra morphisms, that f ⊙ ϕ ∈ C(H, A).

That j acts as the identity map on U(H, A) follows from: for h ∈ H + ,

j ⊙ ϕ(h) = j • QSh(ϕ)   h + k≥2 h ′ (1) ⊗ . . . ⊗ h ′ (k)   = j   ϕ(h) + k≥2 ϕ(h ′ (1) ) • . . . • ϕ(h ′ (k) )   = ϕ(h) (32)
Proposition 5 The action ⊙ and the convolution product * (recall that QSh(A) is a Hopf algebra) satisfy the distributivity relation: For f and g in U(QSh(A), A) and ϕ in U(H, A),

(f * g) ⊙ ϕ = (f ⊙ ϕ) * (g ⊙ ϕ). Indeed, (f * g) ⊙ ϕ = mA • (f ⊗ g) • ∆ • QSh(ϕ) • ι = mA • (f ⊗ g) • (QSh(ϕ) ⊗ QSh(ϕ)) • ∆ • ι = mA • (f ⊗ g) • (QSh(ϕ) ⊗ QSh(ϕ)) • (ι ⊗ ι) • ∆ = mA(f ⊙ ϕ ⊗ g ⊙ ϕ) • ∆ = (f ⊙ ϕ) * (g ⊙ ϕ) (33)
Note that, in the case H = QSh(A), U(QSh(A), A) is equipped with two products * and ⊙ that look similar, in their interactions, to the product and composition of power series.

Remark 1 These constructions generalize as follows. Let B be another unital algebra. For ϕ ∈ U(H, A) and f ∈ U(QSh(A), B) we define

f ⊙ ϕ = f • QSh(ϕ) • ι. The morphism f ⊙ ϕ is linear from H to B and f ⊙ ϕ(1H ) = f • QSh(ϕ) • ι(1H ) = f • QSh(ϕ)(1) = f (1) = 1B. thus f ⊙ ϕ ∈ U(H, B). Moreover, when A and B are commutative, if ϕ ∈ C(H, A) and f ∈ C(QSh(A), B) it is clear, by composition of algebra morphisms that f ⊙ ϕ ∈ C(H, B).
Corollary 1 Let ϕ ∈ U(H, A), then its convolution inverse if given by

ϕ * -1 = j * -1 ⊙ ϕ. Indeed, since j ⊙ ϕ = ϕ, if ψ := j * -1 ⊙ ϕ, then ψ * ϕ = (j * -1 ⊙ ϕ) * (j ⊙ ϕ) = (j * -1 * j) ⊙ ϕ = (uA • η) ⊙ ϕ = uA • η. For example, if h ∈ H + with ∆ ′[4] (h) = 0, then ι(h) = h + h ′ (1) ⊗ h ′ (2) + h ′ (1) ⊗ h ′ (2) ⊗ h ′ (3)
so,

QSh(ϕ) • ι(h) = ϕ(h) + ϕ(h ′ (1) ) • ϕ(h ′ (2) ) + ϕ(h ′ (1) ) • ϕ(h ′ (2) ) • ϕ(h ′ (3)
) and finally

ϕ * -1 (h) = j * -1 • QSh(ϕ) • ι(h) = -ϕ(h) + ϕ(h ′ (1) )ϕ(h ′ (2) ) - ϕ(h ′ (1) )ϕ(h ′ (2) )ϕ(h ′ (3) )
We recover the usual formula for the inverse.

Theorem 3 Assume now that A is an idempotent Rota-Baxter algebra. Let ϕ ∈ U(H, A).

Then the Birkhoff-Rota-Baxter decomposition of ϕ is given by

ϕ-= j-⊙ ϕ, ϕ+ = j+ ⊙ ϕ.
Proof Indeed, since j ⊙ ϕ = ϕ, we have

ϕ- * ϕ = (j-⊙ ϕ) * (j ⊙ ϕ) = (j- * j) ⊙ ϕ = j+ ⊙ ϕ = ϕ+
and, of course, ϕ± ∈ U(H, A±).

For example, if h ∈ H ′ with ∆ ′ [4] (h) = 0, then

ϕ+(h) = p+(ϕ(h)) -p+(p-(ϕ(h ′ (1) ))ϕ(h ′ (2) )) + p+(p-(p-(ϕ(h ′ (1) ))ϕ(h ′ (2) ))ϕ(h ′ (3) )) ϕ-(h) = -p-(ϕ(h)) + p-(p-(ϕ(h ′ (1) ))ϕ(h ′ (2) )) -p-(p-(p-(ϕ(h ′ (1) ))ϕ(h ′ (2) ))ϕ(h ′ (3)
)) Needless to say that if A is commutative, these computations works in the subgroup C(H, A).

Once these formulas are given, we get formulas in the different contexts where renormalization, or rather Birkhoff decomposition, is needed. We end this paper with two sections that illustrate how these formulas could be used :

• to perform inversion and Birkhoff decomposition of diffeomorphisms that correspond to characters on the Fa à di Bruno Hopf algebra,

• to perform the Birkhoff decomposition with the same formula in various cofree Hopf algebras that differ by their algebra structures, but for which the map ι is the same as these Hopf algebras are tensor coalgebras.

Renormalizing diffeomorphisms in pQFT and Dynamics

Let us focus in this section on the example of the Fa à di Bruno Hopf algebra H FdB (see [START_REF] Brouder | Non-Commutative Hopf Algebra of Formal Diffeomorphisms[END_REF][START_REF] Figueroa | Combinatorial Hopf algebras in quantum field theory[END_REF][START_REF] Frabetti | Five Interpretations of Fa à Di Bruno's Formula[END_REF][START_REF] Menous | On the stability of some groups of formal diffeomorphisms by the Birkhoff decomposition[END_REF]) whose group of characters corresponds to the group of formal identity-tangent diffeomorphisms. We will first express the reduced coproduct and then the map ι from this Hopf algebra to its associated quasi-shuffle Hopf algebra and then focus on the Birkhoff decomposition of characters with values in the Laurent series that appear in several areas, as a factorisation of diffeomorphisms for the composition.

Recall that the decomposition is unique: the same results could be obtained by induction using the classical renormalization process (the Bogoliubov recursion). One advantage of the present approach is to encode the combinatorics of renormalization into a universal framework, probably similar to the one P. Cartier suggested when advocating the existence of a "Galois group" underlying renormalization. Compare in particular our approach with [START_REF] Connes | Renormalization in quantum field theory and the Riemann-Hilbert problem. I: The Hopf algebra structure of graphs and the main theorem[END_REF][START_REF] Ebrahimi-Fard | Birkhoff type decompositions and the Baker-Campbell-Hausdorff recursion[END_REF][START_REF] Ebrahimi-Fard | A noncommutative Bohnenblust-Spitzer identity for Rota-Baxter algebras solves Bogolioubov's recursion[END_REF].

Consider the group of formal identity tangent diffeomorphisms with coefficients in a commutative C-algebra A: The action of these functionals on a product in G(A) defines a coproduct on H FdB that turns to be a graded connected Hopf algebra (see [START_REF] Figueroa | Combinatorial Hopf algebras in quantum field theory[END_REF] for details). For n ≥ 0, the coproduct is defined by an

G(A) = {f (x) = x + n≥1 fnx n+1 ∈ A[[x]]} with its product µ : G(A) × G(A) → G(A) : µ(f, g) = f • g.
• µ = m • ∆(an) ( 34
)
where m is the usual product in A, and the antipode reads

S • an = an • inv where inv(ϕ) = ϕ •-1 is the composition inverse of ϕ. For example if f (x) = x + n≥1 fnx n+1 and g(x) = x + n≥1 gnx n+1 then if h(x) = f • g(x) = x + n≥1 hnx n+1 , a0(h) = 1 = a0(f )a0(g) → ∆a0 = a0 ⊗ a0 a1(h) = f1 + h1 → ∆a1 = a1 ⊗ a0 + a0 ⊗ a1 a2(h) = f2 + 2f1g1 + g2 → ∆a2 = a2 ⊗ a0 + 2a1 ⊗ a1 + a0 ⊗ a2.
More generally, using classical formulas on the composition of diffeomorphisms (see [START_REF] Brouder | Non-Commutative Hopf Algebra of Formal Diffeomorphisms[END_REF][START_REF] Ebrahimi-Fard | Exponential Renormalization Annales Henri Poincar à c[END_REF][START_REF] Frabetti | Five Interpretations of Fa à Di Bruno's Formula[END_REF][START_REF] Menous | Formulas for the Connes-Moscovici Hopf Algebra[END_REF]), we have

∆(an) = n k=0 l 0 +...l k =n-k l i ≥0 a k ⊗ a l 0 . . . a l k (35)
∆ ′ (an) = n-1 k=1 n∈N n-k k + 1 l(n) a k ⊗ an (36)
and when iterating the coproduct, we get,

Proposition 6 For n ≥ 1, ι(an) = n∈Nn n 1 ...n t =n t≥1,l(n 1 )=1 λ(n 1 , . . . , n t )a n 1 ⊗ • • • ⊗ a n t (37)
where the sums run over all the decompositions in non empty sequences n 1 . . . n t = n and λ(n 1 , . . . ,

n t ) = t i=2 n 1 . . . n i-1 + 1 l(n i )
Note that we kept in formula [START_REF] Schützenberger | Sur une propriété combinatoire des algèbres de Lie libres pouvant être utilisée dans un problème de mathématiques appliquées, Séminaire Dubreil-Jacotin Pisot (Algèbre et théorie des nombres)[END_REF] the tensor product notation to avoid confusion since we deal with words whose letters are monomials. The proof is simply based on the recursive definition of reduced iterated coproduct and already provides a formula for the composition inverse of a diffeomorphism in G(A).

Corollary 2 Let f (x) = x + n≥1 fnx n+1 ∈ G(A), we can consider its associated character defined by ϕ(an) = fn and then, using our previous formulas, the coefficients of the composition inverse g of f are given by

gn = ϕ * -1 (an) = n=(n 1 ,...,ns)∈Nn     n 1 ...n t =n t≥1,l(n 1 )=1 (-1) t λ(n 1 , . . . , n t )     fn 1 . . . fn s
This result, as the following one, uses the obvious isomorphism between G(A) and C(H FdB , A). One can also compute the Birkhoff decomposition in the group of formal identity-tangent diffeomorphism with coefficients in the a Rota-Baxter algebra of Laurent series A = [[ε, ε -1 ] with its usual projections p+ and p-on the regular and polar parts of such series. Any element

f (x) = x + n≥1 fn(ε)x n+1 , fn(ε) ∈ [[ε, ε -1 ] can be decomposed as f-• f = f+ with f-(x) = x + n≥1 f-,n(ε)x n+1 f-,n(ε) ∈ ε -1 [ε -1 ] f+(x) = x + n≥1 f+,n(ε)x n+1 f+,n(ε) ∈ [[ε]].
Using proposition 6, we get for n ≥ 1, (38) where ϕ, ϕ+ and ϕ-are the characters associated to f , f+ and f-(ϕ(an) = fn).

Proposition
Let us explain how such diffeomorphisms appear in various area, where there Birkhoff decomposition makes sense.

Such a factorization appears first classicaly in quantum field theory: after dimensional regularization, the unrenormalized effective coupling constants are the image by a formal identity-tangent diffeomorphism of the coupling constants of the theory (see [START_REF] Connes | Renormalization in quantum field theory and the Riemann-Hilbert problem. II: The β-function, diffeomorphisms and the renormalization group[END_REF][START_REF] Ebrahimi-Fard | Exponential Renormalization Annales Henri Poincar à c[END_REF] for a Hopf algebraic approach). Moreover, the coefficients of this diffeomorphism are Laurent series in the parameter ε associated to the dimensional regularization process and the Birkhoff decomposition of this diffeomorphism gives directly the bare coupling constants and the renormalized coupling constants.

As proved in [START_REF] Connes | Renormalization in quantum field theory and the Riemann-Hilbert problem. II: The β-function, diffeomorphisms and the renormalization group[END_REF], in the case of the massless φ 3 6 theory, the unrenormalized effective coupling constant can be written as a diffeomorphism f (x) = x + n≥1 fn(ε)x n+1 where x is the initial coupling constant. From the physical point of view, the decomposition f-• f = f+ is such that, x + n≥1 f+,n(0)x n+1 is the renormalized effective constant of the theory.

Such diffeomorphisms (and the need for renormalization) also appear in the classification of dynamical systems, especially when dealing with dynamical systems that cannot be analytically of formally linearized. Let us illustrate this on a very simple example (see [START_REF] Menous | From Dynamical Systems to Renormalization[END_REF] for a general approach). The following autonomous analytic dynamical system ẋ = αx ż = βz + b(x)z 2 can be considered as a perturbation of the linear system ẋ = αx ẏ = βy so that one could expect that a change of coordinate (x, y) = ψ(x, z) = (x, f (x, z)) allows to go from one system to the other one, that is to linearize the first system. In this simple case (see [START_REF] Menous | From Dynamical Systems to Renormalization[END_REF] for details) the solution should be f

(x, z) = z 1-a(x)z where αxa ′ (x) + βa(x) + b(x) = 0 that yields formally, if b(x) = n≥0 bnx n , a(x) = - n≥0 bn αn + β x n .
This series could be ill-defined whenever there exists n0 such that αn0 + β = 0. This happens for example with n = 0 for (α, β) = (1, 0) and, in this case, we could regularize by considering the system with linear part (α, β) = (1 + ε, ε). As a function of z, f (x, z) is then an identity-tangent diffeomorphism whose coefficients are in

[[x]][[ε, ε -1 ]: f (x, z) = z 1 -a(x)z = z + n≥1 a(x) n z n+1 , a(x) = - b(0) ε - n≥1 bn n(1 + ε) + ε x n .
This very simple case can be handled directly and, after Birkhoff decomposition, the regular part in ε is

f+(x, z) = z 1 -a+(x)z = z + n≥1 a+(x) n z n+1 , a+(x) = - n≥1 bn n(1 + ε) + ε x n
and, for ε = 0, the corresponding change of coordinate conjugates the system

ẋ = x ż = b(x)z 2 to ẋ = x ẏ = b(0)y 2 .
This approach can be generalized to more general systems for which the Birkhoff decomposition is not so obvious, so that formula (38) could be useful. For instance, the same process of regularization/factorization allows to conjugate the system

ẋ = x ż = k≥1 b k (x)z k+1
to a system ẋ = x ẏ = k≥1 c k y k+1 which is called a "normal form", with coefficients c k that do not depend any more on x.

Diffeomorphisms in higher dimension (and thus the corresponding Hopf algebra) appear as well in physics (with more than one coupling constant) and in dynamics: let us consider vector fields given by ν series u(x) = (u1(x), . . . , uν (x)) ∈ ≥2 {x} of ν variables x = (x1, . . . , xν) that can be seen as "perturbations" of linear vector fields (λ1x1, . . . , λνxν):

dxi dt = λixi + ui(x) = Xi(x), i = 1, . . . , ν. (39)
The linearization problem consists in finding an identity-tangent diffeomorphism ϕ in dimension ν such that the change of coordinates x = ϕ(y) transforms the previous object into its linear part. For differential equations, this reads, for i = 1, . . . , ν:

dxi dt = ν j=1 dyj dt ∂ϕi ∂yj (y) = ν j=1 λj yj ∂ϕi ∂yj (y) = λiϕi(y) + ui(ϕ(y)) = λixi + ui(x). (40)
When trying to solve these so-called "homological equations", some obstructions can occur, independently on any assumption on the analycity of ϕ. These equations cannot be formally systematically solved when some combinations m1λ1 + . . . mνλνλi vanish (here i ∈ {1, . . . , ν}, mj ≥ 0, mj 2): Such cancellations, which are called resonances, prevent from linearizing the differential and one can once again use regularization of the linear part and Birkhoff decomposition to get a change of coordinate that conjugate the vector field to a so-called normal form, see [START_REF] Menous | From Dynamical Systems to Renormalization[END_REF].

Tensor coalgebras, MZVs, Analysis

If X be an alphabet (that is a set), its associated tensor vector space T (X) inherits a coalgebra structure related to the concatenation. If we note tensors products as words

x = x1 ⊗ • • • ⊗ xs = x1 . . . xs, ∆(x) = 1 ⊗ x + x 1 x 2 =x x 1 ⊗ x 2 + x ⊗ 1
where the central sum, that corresponds to the reduced coproduct, is over nonempty words x 1 , x 2 whose concatenation is x.

The quasi-shuffle Hopf algebras QSh(A) are examples of such coalgebras (choose simply a linear basis X of A!). There are however many Hopf algebras with such a coalgebra structure that differ as algebras -but the associated map ι and the associated formula for the Birkhoff decomposition of characters, does not depend on the algebra structure. For the map ι, we obviously get:

ι(x) = x 1 x 2 ...x t =x t≥1 ; x i =∅ x 1 ⊗ x 2 ⊗ • • • ⊗ x t (41)
and if ϕ is a character from a Hopf algebra with such a coalgebra structure, with values in a commutative Rota-Baxter algebra (A, p+), the factorization ϕ- * ϕ = ϕ+ is given for any x ∈ T (X) by ϕ+(x) = • the coefficients of word series in [START_REF] Murua | Computing Normal Forms and Formal Invariants of Dynamical Systems by Means of Word Series[END_REF],

• "symmetral moulds" in mould calculus (see [START_REF] Fauvet | Ecalle's arborification-coarborification transforms and Connes-Kreimer Hopf algebra[END_REF][START_REF] Ecalle | Singularités non abordables par la géométrie. (French) [Singularities that are inaccessible by geometry[END_REF])

• or Chen's iterated integrals (see for instance [START_REF] Kreimer | Chen's iterated integral represents the operator product expansion[END_REF][START_REF] Manchon | Shuffle relations for regularised integrals of symbols[END_REF]).

Let us just give the example of a simple differential equation related to mould calculus (see [START_REF] Menous | Formal differential equations and renormalization[END_REF]). Let b(x, y) = n≥0 x n bn(y) ∈ y One can try to compute this diffeomorphism as a "mould series": 44)) that conjugates x∂xy = b(x, y) to x∂xz = 0 with a price to pay : it contains monomials in x and log x. See [START_REF] Menous | Formal differential equations and renormalization[END_REF] for details.

Not also that the same ideas can be used for the the even-odd factorization of characters in combinatorial Hopf algebras (see [START_REF] Aguiar | Combinatorial Hopf algebras and generalized Dehn-Sommerville relations[END_REF], [START_REF] Aguiar | Canonical characters on quasi-symmetric functions and bivariate Catalan numbers[END_REF] and [START_REF] Ebrahimi-Fard | Birkhoff type decompositions and the Baker-Campbell-Hausdorff recursion[END_REF]).

  . ar ∈ QSh(A)r and b = b1 . . . bs ∈ QSh(A)s with r ≥ 1, s ≥ 1 and r+s = t. Let ã = a1 . . . ar-1 ∈ QSh(A)r-1 (ã = 1 if r = 1) and b = b1 . . . bs-1 ∈ QSh(A)s-1 ( b = 1 if s = 1), then : ab = (ãb) • ar + (a -b) • bs + (ã -b) • (ar •A bs) Now we have j-(a) = -p-(j-(ã) •A ar) = -p-(x) and j-(b) = -p-(j-( b) •A bs) = -p-(y), where x := j-(ã) •A ar and y := j-( b) •A bs. Thanks to the Rota-Baxter identity, and omitting •A in the following computations in A, j-(a)j-(b) = p-(x)p-(y) = p-(xp-(y)) + p-(p-(x)y)p-(xy) = p-(j-(ã)arp-(j-( b)bs)) + p-(p-(j-(ã)ar)j-( b)bs) -p-(j-(ã)arj-( b)bs) but as A is commutative, by induction we get j-(a)j-(b) = -p-(j-(ã)j-(b)ar)p-(j-(a)j-( b)bs)p-(j-(ã)j-( b)arbs) = -p-(j-(ãb)ar)p-(j-(a -b)bs)p-(j-(ã -b)arbs)

For n ≥ 0 ,

 0 the functionals on G(A) defined by an(= fn an : G(A) → A are called de Fa à di Bruno coordinates on the group G(A) and a0 = 1 being the unit, they generates a graded unital commutative algebra H FdB = [a1, . . . , an, . . .] (gr(an) = n)

  Let us consider sequences of positive integers N = {n = (n1, . . . , ns) ∈ (AE * ) s , s ≥ 1} For n = (n1, . . . , ns) ∈ N , we denote n = n1 + . . . + ns, l(n) = s, an = an 1 . . . an s and, if n ≥ 1, Nn = {n ∈ N ; n = n} With these notations, the reduced coproduct (with a0 = 1) reads

x 1 x 2 Example 1 (Example 2 (Example 3 (

 2123 ...x t =x t≥1 ; x i =∅ (-1) t-1 p+(p-(. . . (p-(ϕ(x 1 ))ϕ(x 2 )) . . .)ϕ(x t ))ϕ-(x) = x 1 x 2 ...x t =x t≥1 ; x i =∅ (-1) t p-(p-(. . . (p-(ϕ(x 1 ))ϕ(x 2 )) . . .)ϕ(x t ))(42)Let us list some example where this formula appear or can be used. Renormalization af Multiple Zeta Values (MZV)) In [21, Section 3] Guo and Zhang consider regularized MZV as characters on a quasi-shuffle algebra H M = T (M) whose quasi-shuffle product stems from the additive semigroup structure of the alphabetM = [ s r ] ; (s, r) ∈ Z × R + * .They propose then a directional regularization of MZV defined on wordsZ([ s1 r1 ] . . . [ s k r k ]; ε) = n 1 >•••>n k >0 e n 1 r 1 ε . . . e n k r k ε n s 1 1 . . . n s k kthat defines a character on H M with values in an algebra of Laurent series. The formula they give for the Birkhoff decomposition (Theorem 3.8) coincide equation (42). Rooted ladders) As a toy model for applications in physics [14, section 4.2] considers a character on the polynomial commutative Hopf algebra H lad of ladder trees. If the ladder tree with n nodes is tn, then∆(tn) = tn ⊗ 1 + n-1 k=1 t k ⊗ t n-k + 1 ⊗ tn.It is a matter of fact to identify the coalgebra structure of H lad with the tensor deconcatenation coalgebra T ({x}) over an alphabet with one letter, where tn corresponds to the word x . . . x n . Formula (42) can be applied to the character mapping the tree tn to an n-fold Chen's iterated integral defined recursively byψ(p; ε, µ)(tn) = µ ε ∞ p ψ(x; ε, µ)(tn-1) dx x 1+ε = e -nε log(p/µ) n!ε n = fn(ε)with values in the Laurent series in ε. We get for the couterterms:ψ-(p; ε, µ)(tn)) = n 1 +•••+n t =n t≥1 , n i >0 (-1) t (-1) t p-(p-(. . . (p-(fn 1 (ε))fn 2 (ε)) . . .)fn t (ε)) (43) Differential equations) When dealing with differential equations and associated diffeomorphisms (flow, conjugacy map), characters on shuffle Hopf algebras appear almost naturally. For instance, such characters correspond to:

  2 [[x, y]] and d ∈ AE. If one looks for a formal identity tangent diffeomorphism ϕ(x, y) in y, with coefficients in[[x]] such that, if y is a solution of (E b,d ) x 1-d ∂xy = b(x, y) then z = ϕ(x, y) is a solution of (E 0,d ) x 1-d ∂xz = 0.

ϕ

  d (x, y) = y + s≥1 n 1 ,...ns∈AE V d (n1, . . . , ns) ns . . . n 1 .y ( n = bn(y)∂y) (44) where V d is a character on the shuffle algebra T (AE), with values in [[x]]. Whenever d is a positive integer, this character can be computed and for any word (n1, . . . , ns) V d (n1, . . . , ns) = (-1) s x n 1 +...+ns+sd (ň1 + d)(ň2 + 2d) . . . (ňs + sd) (ňi = n1 + . . . + ni).(45)The map ϕ d (x, y) ∈ C[[x, y]] is then well defined and conjugates (E b,d ) to (E 0,d ). For d = 0, there may be divisions by 0 and, in this case, one can consider d = ε as a real parameter and use the expansionx ε = (ε log x)) n n! so that the character Vε has its values in B[[ε]][ε -1 ] where B = [[log x, x].If one uses the same formula (42) to perform the Birkhoff decomposition, the regular character Vε,+, evaluated at ε = 0 allows to find a diffeomorphism (as in equation (

  , . . . , n t )(-1) t p-(p-(. . . (p-(ϕ(a n 1 ))ϕ(a n 2 )) . . .)ϕ(a n t ))

	7 The coefficients of the Birkhoff decomposition of a formal identity-tangent
	diffeomorphism are given by
	ϕ+(an) =	λ(n 1 , . . . , n t )(-1) t-1 p+(p-(. . . (p-(ϕ(a n 1 ))ϕ(a n 2 )) . . .)ϕ(a n t ))
	n∈Nn n 1 ...n t =n t≥1,l(n 1 )=1
	ϕ-(an) =	λ(n 1
	n∈Nn n 1 ...n t =n t≥1,l(n 1 )=1


BOOK REVIEW

Quantitative Methods in Tourism. A Handbook, 2 nd edition

Rodolfo Baggio and Jane Klobas (editors) (Channel View Publications, Aspects of Tourism, Bristol, UK;2017;252pp;Hardcover, £89,95;ISBN-13: 978-1-84541-618-8 (pbk)) Sylvain Petit, Associate Professor GDI (EA 4240), University of French Polynesia and associate researcher at IDP (EA 1384), Univ. of Valenciennes (Reference: S. Petit (2018), « BOOK REVIEW: Quantitative Methods in Tourism. A Handbook, 2nd edition », Tourism Analysis, forthcoming) This book is very important in the field of quantitative methods applied to the study of the tourism sector. The second edition contains new chapters and notably one which focuses on the use of big data in the tourism industry. This topic is a growing area with an important potential for application. In this book, the authors focus on the application of the quantitative methods and the technics on various fields (economics, management, geography, sociology, etc.) which are used in interdisciplinary research related to tourism. The presentation is very clearly written, quite educational, and describes very well the latest methods, yet with some technical paragraphs which may be difficult to understand. This book is particularly recommended for students or researchers with a thorough knowledge of the tourism literature, and a good mastery of mathematical tools but little knowledge of quantitative methods. It will help them to select and use the right method for their research.

However, if the reader has a low level of mathematics and computer programming, some parts may prove too technical. On the other hand, with little knowledge of the tourism literature, a reader might have difficulty understanding which method is best suited for a particular problem.

I agree with the choice to present the tools/methods and not the disciplinary topics concerned by the methods, but there is a risk of losing the reader who is just embarking on research in the field of tourism and whose mathematical level is insufficient. . In general, the book is very well written but the structure could be more balanced. The first section is much more developed than the second. This is due to Chapter 4, which is almost as long as all chapters in Section 2. It would have been preferable to have 3 sections by dividing the first one into two sections: one concerning the preliminary study of the data and the sample and another one on the aspect of the econometric models.

In addition, the technical presentation of methods is supplemented by very useful boxes on examples of applications to tourism. However, there seems to lack references concerning the applications already implemented (for each quantitative method), their objectives, their data and the limits. The Handbook of Research method in tourism, edited by N. Seetaram, L. Dwyer and A. Gill. in 20121 present many references which use some methods mentioned in this second edition of Quantitative Methods in Tourism. A Handbook. If these two books are read together, the reader has a better understanding about the potential application of these empirical methods to the tourism sector.

Chapter 1 is an excellent introduction which allows the reader to take ownership of a database and find out what the main existing data in tourism are. The important educational value of this chapter lies in the end with the presentation of public databases. This basic information is certainly a gold mine for a reader wanting to embark on the search for international data on tourism. However, the end of this chapter would benefit from a more detailed presentation of the data available on the websites mentioned.

Chapter 2 explains well simple methods which are placed in the context of sampling tourist data. However, the authors speak of the p-values according to the applied tests, and in particular the Student test (page 23, table 2.3). It would have been useful to recall why some laws are used rather than others for the tests presented. In addition, the bootstrap sub-chapter seems to have been treated too fast. How can this method be technically implemented? In addition, the table on page 35 could be accompanied by examples of applications (in one line for example, to make it easier to define which test to choose for the reader).

Chapters 3 and 4 appear to be the most interesting chapters in the book but also the longest. The models for the quantitative data and the models for the qualitative data (which can be moved to chapter 6) could have been split. The main problems encountered in econometrics with tourism data are discussed in these chapters and solutions are provided. However, the problem related to panel data are not discussed. Moreover, I have suggestions about chapter 4. First, on page 90, it would have been interesting to give examples of concrete applications for the different specifications (linear, log-linear, etc.). How is the most appropriate specification selected? For example, in the box on page 98, could the problem of forecasting tourism arrivals by forecasting temperatures be solved with a change of specification (e.g. from linear to a log-linear specification)? Second, on page 100, when the author introduces the notions of dummy variables, it would have been useful to provide key elements to interpret the coefficients of these variables (i.e. in comparison with the constant term). Third, the paragraphs on "Path Modelling" are very technical. The authors could have presented some examples of applications for the different tests of the table 4.4.

The two chapters on big data and simulations add a lot of value to the book. These chapters are very original and provide a lot more of information than the current literature proposes. In the simulation chapter, the example used ("Increasing the attractiveness of a tourism destination") is clearly innovative. I suggest a second example of an application related to the topics of sustainable tourism. For example, what is the effect of a tourism accommodation localization close to (or far away to) the accommodations of the residents?

The growing literature on DEA (Data Envelopment Analysis) methods and on measuring the performance, efficiency or effectiveness of a destination could also be discussed, since it concerns geographers, economists, marketers, managers, etc. These methods do not suffer from parametric constraints and can be used, above all, by public decision-makers 2 .

In conclusion I intend these remarks to be constructive to improve the future editions of the handbook. I highly recommend the reading of this book to all tourism researchers using quantitative methods. It offers a complete vision of all the methods that can be used, and provides important and extensive information. From a technical point of view, it is the most rigorous and reliable book in this field.

Sylvain Petit

University of French Polynesia and University of Valenciennes, France

2 Some examples : Anderson, R. I., Fish, M., Xia, Y., & Michello, F. (1999). "Measuring efficiency in the hotel industry: a stochastic frontier approach". International Journal of Hospitality Management, 18(1), 45-57. Anderson, R. I., Fok, R., & Scott, J. (2000). "Hotel industry efficiency: an advanced linear programming examination". American Business Review, 18(1), 40-48. Baker, M., & Riley, M. (1994). "New perspectives on productivity in hotels: some advances and new directions". International Journal of Hospitality Management, 13(4), 297-311. Barros, C.P., Botti, L., Peypoch, N., Robinot, E., Solonandrasana, B. and A.G Assaff (2011), "Performance of French destinations: Tourism attraction perspectives", Tourism Management,32,[141][142][143][144][145][146]

Dwyer, L. Gill. A. and Seetaram, N. (2012). Handbook of Research method in tourism, Edward Elgard Publishing, Cheltenham, UK. Northampton, MA, USA.