Combinatorial Hopf algebras from PROs

Size: px
Start display at page:

Download "Combinatorial Hopf algebras from PROs"

Transcription

1 Comintoril Hopf lgers from PROs Jen-Pul Bultel, Smuele Girudo To cite this version: Jen-Pul Bultel, Smuele Girudo. Comintoril Hopf lgers from PROs. Journl of Algeric Comintorics, Springer Verlg, 2016, < /s >. <hl > HAL Id: hl Sumitted on 10 My 2016 HAL is multi-disciplinry open ccess rchive for the deposit nd dissemintion of scientific reserch documents, whether they re pulished or not. The documents my come from teching nd reserch institutions in Frnce or rod, or from pulic or privte reserch centers. L rchive ouverte pluridisciplinire HAL, est destinée u dépôt et à l diffusion de documents scientifiques de niveu recherche, puliés ou non, émnnt des étlissements d enseignement et de recherche frnçis ou étrngers, des lortoires pulics ou privés.

2 COMBINATORIAL HOPF ALGEBRAS FROM PROS JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Astrct. We introduce generl construction tht tkes s input so-clled stiff PRO nd tht outputs Hopf lger. Stiff PROs re prticulr PROs tht cn e descried y genertors nd reltions with precise conditions. Our construction generlizes the clssicl construction from operds to Hopf lgers of vn der Ln. We study some of its properties nd review some exmples of ppliction. We get in prticulr Hopf lgers on heps of pieces nd retrieve some deformed versions of the noncommuttive Fà di Bruno lger introduced y Foissy. Contents Introduction 2 1. Algeric structures nd ckground Comintoril Hopf lgers The nturl Hopf lger of n operd PROs nd free PROs 6 2. From PROs to comintoril Hopf lgers The Hopf lger of free PRO Properties of the construction The Hopf lger of stiff PRO Relted constructions Exmples of ppliction of the construction Hopf lgers of forests The Fà di Bruno lger nd its deformtions Hopf lger of forests of itrees Hopf lger of heps of pieces Hopf lger of heps of frile pieces 31 Concluding remrks nd perspectives 33 References 34 Dte: My 5, Mthemtics Suject Clssifiction. 05E99, 05E05, 05C05, 57T05, 18D50. Key words nd phrses. Operd; PRO; Hopf lger; Noncommuttive symmetric function; Fà di Bruno lger. Phone numer nd emil ddress of the corresponding uthor: , smuele.girudo@u-pem.fr. 1

3 2 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Introduction Operds re lgeric structures introduced in the 70s y Bordmn nd Vogt [BV73] nd y My [My72] in the context of lgeric topology to offer formliztion of the notion of opertors nd their composition (see [Mr08] nd [LV12] for very complete presenttion of the theory of operds). Operds provide therefore unified frmework to study some sorts of priori very different lgers, such s ssocitive lgers, Lie lgers, nd commuttive lgers. Besides, the theory of operds is lso eneficil in comintorics [Ch08] since it provides some wys to decompose comintoril ojects into elementry pieces. On the other hnd, the theory of Hopf lgers holds specil plce in lgeric comintorics [JR79]. In recent yers, mny Hopf lgers were defined nd studied, nd most of these involve very fmous comintoril ojects such s permuttions [MR95,DHT02], stndrd Young tleux [PR95,DHT02], or inry trees [LR98, HNT05]. These two theories operds nd Hopf lgers hve severl interctions. One of these is construction [vdl04] tking n operd O s input nd producing ilger H (O) s output, which is clled the nturl ilger of O. This construction hs een studied in some recent works: in [CL07], it is shown tht H cn e rephrsed in terms of n incidence Hopf lger of certin fmily of posets, nd in [ML14], generl formul for its ntipode is estlished. Let us lso cite [Fr08] in which this construction is considered to study series of trees. The initil motivtion of our work ws to generlize this H construction with the im of constructing some new nd interesting Hopf lgers. The direction we hve chosen is to strt with PROs, lgeric structures which generlize operds in the sense tht PROs del with opertors with possily severl outputs. Surprisingly, these structures ppered erlier thn operds in the work of Mc Lne [ML65]. Intuitively, PRO P is set of opertors together with two opertions: n horizontl composition nd verticl composition. The first opertion tkes two opertors x nd y of P nd uilds new one whose inputs (resp. outputs) re, from left to right, those of x nd then those of y. The second opertion tkes two opertors x nd y of P nd produces new one otined y plugging the outputs of y onto the inputs of x. Bsic nd modern references out PROs re [Lei04] nd [Mr08]. Our min contriution consists in the definition of new construction H from PROs to ilgers. Roughly speking, the construction H cn e descried s follows. Given PRO P stisfying some mild properties, the ilger HP hs ses indexed y prticulr suset of elements of P. The product of HP is the horizontl composition of P nd the coproduct of HP is defined from the verticl composition of P, enling to seprte sis element into two smller prts. The properties stisfied y P imply, in nontrivil wy, tht the product nd the coproduct of HP stisfy the required xioms to e ilger. This construction generlizes H nd estlishes new connection etween the theory of PROs nd the theory of Hopf lgers. Our results re orgnized s follows. In Section 1, we recll some generl ckground out Hopf lgers, operds, nd PROs. In prticulr, we give description of free PROs in terms of progrphs, similr to the one of Lfont [Lf11]. We lso recll the nturl ilger construction of n operd. We provide in Section 2 the description of our new construction H. A first version of this construction is presented, ssociting ilger H(P) with free PRO P. We then present n extended version of the construction, tking s input non-necessrily free PROs

4 COMBINATORIAL HOPF ALGEBRAS FROM PROS 3 stisfying some properties, clled stiff PROs. Next, we consider two well-known constructions of PROs [Mr08], one, R, tking s input operds nd the other, B, tking s input monoids. We prove tht under some mild conditions, these constructions produce stiff PROs. We estlish tht the nturl ilger of n operd cn e reformulted s prticulr cse of our construction H. We conclude y giving some exmples of ppliction of H in Section 3. The Hopf lgers tht we otin re very similr to the Connes-Kreimer Hopf lger [CK98] in the sense tht their coproduct cn e computed y mens of dmissile cuts in vrious comintoril ojects. From very simple stiff PROs, we reconstruct the Hopf lger of noncommuttive symmetric functions Sym [GKL + 95,KLT97] nd the noncommuttive Fà di Bruno lger FdB 1 [BFK06]. Besides, we present wy of using H to reconstruct some of the Hopf lgers FdB γ, γ- deformtion of FdB 1 introduced y Foissy [Foi08]. We lso otin severl other Hopf lgers, which, respectively, involve forests of plnr rooted trees, some kind of grphs consisting of nodes with one prent nd severl children or severl prents nd one child tht we cll forests of itrees, heps of pieces (see [Vie86] for generl presenttion of these comintoril ojects), nd prticulr clss of heps of pieces tht we cll heps of frile pieces. All these Hopf lgers depend on nonnegtive integer s prmeter. Acknowledgments. The uthors would like to thnk Jen-Christophe Novelli for his suggestions during the preprtion of this pper. Moreover, the uthors would like to thnk the nonymous referee for its useful suggestions, improving the pper. The computtions of this work hve een done with the open-source mthemticl softwre Sge [S + 14] nd one of its extensions, Sge-Comint [SCc08]. Nottions. For ny integer n 0, [n] denotes the set {1,, n}. If u is word nd i is positive integer no greter thn the length of u, u i denotes the i-th letter of u. The empty word is denoted y ɛ. 1. Algeric structures nd ckground We recll in this preliminry section some sics out the lgeric structures in ply in ll this work, i.e., Hopf lgers, operds, nd PROs. We lso present some well-known Hopf lgers nd recll the construction ssociting comintoril Hopf lger with n operd Comintoril Hopf lgers. In the sequel, ll vector spces hve C s ground field. By lger we men unitry ssocitive lger nd y colger counitry cossocitive colger. We cll comintoril Hopf lger ny grded ilger H = n 0 H n such tht for ny n 1, the n-th homogeneous component H n of H hs finite dimension nd the dimension of H 0 is 1. The degree of ny element x H n is n nd is denoted y deg(x). Comintoril Hopf lgers re Hopf lgers ecuse the ntipode cn e defined recursively degree y degree. Let us now review some clssicl comintoril Hopf lgers which ply n importnt role in this work.

5 4 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Fà di Bruno lger nd its deformtions. Let FdB e the free commuttive lger generted y elements h n, n 1 with deg(h n ) = n. The ses of FdB re thus indexed y integer prtitions, nd the unit is denoted y h 0. This is the lger of symmetric functions [Mc95]. There re severl wys to endow FdB with coproduct to turn it into Hopf lger. In [Foi08], Foissy otins, s yproduct of his investigtion of comintoril Dyson-Schwinger equtions in the Connes-Kreimer lger, one-prmeter fmily γ, γ R, of coproducts on FdB, defined y using lphet trnsformtions (see [Mc95]), y n γ (h n ) := h k h n k ((kγ + 1)X), (1.1.1) k=0 ( ) α. where, for ny α R nd n N, h n (αx) is the coefficient of t n in k 0 h kt k In prticulr, 0 (h n ) = n h k h n k. (1.1.2) k=0 The lger FdB with the coproduct 0 is the clssicl Hopf lger of symmetric functions Sym [Mc95]. Moreover, for ll γ 0, ll FdB γ re isomorphic to FdB 1, which is known s the Fà di Bruno lger [JR79]. The coproduct 0 comes from the interprettion of FdB s the lger of polynomil functions on the multiplictive group (G(t) := {1 + k 1 kt k }, ) of forml power series of constnt term 1, nd 1 comes from its interprettion s the lger of polynomil functions on the group (tg(t), ) of forml diffeomorphisms of the rel line Noncommuttive nlogs. Forml power series in one vrile with coefficients in noncommuttive lger cn e composed (y sustitution of the vrile). This opertion is not ssocitive, so tht they do not form group. For exmple, when nd elong to noncommuttive lger, one hs ut (t 2 t) t = 2 t 2 t = 2 2 t 2 (1.1.3) t 2 (t t) = t 2 t = t 2. (1.1.4) However, the nlogue of the Fà di Bruno lger still exists in this context nd is known s the noncommuttive Fà di Bruno lger. It is investigted in [BFK06] in view of pplictions in quntum field theory. In [Foi08], Foissy lso otins n nlogue of the fmily FdB γ in this context. Indeed, considering noncommuttive genertors S n (with deg(s n ) = n) insted of the h n, for ll n 1, leds to free noncommuttive lger FdB whose ses re indexed y integer compositions. This is the lger of noncommuttive symmetric functions [GKL + 95]. The ddition of the coproduct γ defined y n γ (S n ) := S k S n k ((kγ + 1)A), (1.1.5) k=0 ( ) α, where, for ny α R nd n N, S n (αa) is the coefficient of t n in k 0 S kt k forms noncommuttive Hopf lger FdB γ. In prticulr, n 0 (S n ) = S k S n k, (1.1.6) k=0

6 COMBINATORIAL HOPF ALGEBRAS FROM PROS 5 where S 0 is the unit. In this wy, FdB with the coproduct 0 is the Hopf lger of noncommuttive symmetric functions Sym [GKL + 95,KLT97], nd for ll γ 0, ll the FdB γ re isomorphic to FdB 1, which is the noncommuttive Fà di Bruno lger The nturl Hopf lger of n operd. We shll consider in this work only nonsymmetric operds in the ctegory of sets. For this reson, we shll cll these simply operds Operds. In our context, n operd is triple (O, i, 1) where O := n 1 O(n) (1.2.1) is grded set, i : O(n) O(m) O(n + m 1), n, m 1, i [n], (1.2.2) is composition mp, clled prtil composition, nd 1 O(1) is unit. These dt hve to stisfy the reltions (x i y) i+j 1 z = x i (y j z), x O(n), y O(m), z O(k), i [n], j [m], (1.2.3) (x i y) j+m 1 z = (x j z) i y, x O(n), y O(m), z O(k), 1 i < j n, (1.2.4) 1 1 x = x = x i 1, x O(n), i [n]. (1.2.5) Besides, we shll denote y : O(n) O(m 1 ) O(m n ) O(m m n ), n, m 1,, m n 1, (1.2.6) the totl composition mp of O. It is defined for ny x O(n) nd y 1,, y n O y x [y 1,, y n ] := ( ((x n y n ) n 1 y n 1 ) ) 1 y 1. (1.2.7) If x is n element of O(n), we sy tht the rity x of x is n. An operd morphism is mp φ : O 1 O 2 etween two operds O 1 nd O 2 such tht φ commutes with the prtil composition mps nd preserves the rities. A suset S of n operd O is suoperd of O if 1 S nd the composition of O is stle in S. The suoperd of O generted y suset G of O is the smllest suoperd of O contining G The nturl ilger of n operd. Let us recll very simple construction ssociting Hopf lger with n operd. A slightly different version of this construction is considered in [vdl04, CL07, ML14]. Let O e n operd nd denote y O + the set O \ {1}. The nturl ilger of O is the free commuttive lger H (O) spnned y the T x, where the x re elements of O +. The ses of H (O) re thus indexed y finite multisets of elements of O +. The unit of H (O) is denoted y T 1 nd the coproduct of H (O) is the unique lger morphism stisfying, for ny element x of O +, (T x ) = T y T z1 T zl. (1.2.8) y,z 1,...,z l O y [z 1,...,z l ]=x

7 6 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO The ilger H (O) cn e grded y deg(t x ) := x 1. Note tht with this grding, when O(1) = {1} nd the O(n) re finite for ll n 1, H (O) ecomes comintoril Hopf lger PROs nd free PROs. We recll here the definitions of PROs nd free PROs in terms of progrphs nd introduce the notions of reduced nd indecomposle elements, which will e used in the following sections PROs. A PRO is qudruple (P,,, 1 p ) where P is igrded set of the form P := P(p, q), (1.3.1) p 0 q 0 such tht for ny p, q 0, P(p, q) contins elements x with i(x) := p s input rity nd o(x) := q s output rity, is mp of the form : P(p, q) P(p, q ) P(p + p, q + q ), p, p, q, q 0, (1.3.2) clled horizontl composition, is mp of the form : P(q, r) P(p, q) P(p, r), p, q, r 0, (1.3.3) clled verticl composition, nd for ny p 0, 1 p is n element of P(p, p) clled unit of rity p. These dt hve to stisfy for ll x, y, z P the six reltions (x y) z = x (y z), x, y, z P, (1.3.4) (x y) z = x (y z), x, y, z P, i(x) = o(y), i(y) = o(z), (1.3.5) (x y) (x y ) = (x x ) (y y ), x, x, y, y P, i(x) = o(y), i(x ) = o(y ), (1.3.6) 1 p 1 q = 1 p+q, p, q 0, (1.3.7) x 1 0 = x = 1 0 x, x P, (1.3.8) x 1 p = x = 1 q x, x P, p, q 0, i(x) = p, o(x) = q. (1.3.9) A PRO morphism is mp φ : P 1 P 2 etween two PROs P 1 nd P 2 such tht φ commutes with the horizontl nd verticl compositions nd preserves the input nd output rities. A suset S of PRO P is su-pro of P if 1 p S for ny p 0 nd the horizontl nd verticl compositions of P re stle in S. The su-pro of P generted y suset G of P is the smllest su-pro of P contining G. An equivlence reltion on P is congruence of PROs if ll the elements of sme -equivlence clss hve the sme input rity nd the sme output rity, nd is comptile with the horizontl nd the verticl composition. Any congruence of P gives rise to PRO quotient of P denoted y P/ nd defined in the expected wy.

8 COMBINATORIAL HOPF ALGEBRAS FROM PROS Free PROs. Let us now set our terminology out free PROs nd its elements in terms of progrphs. From now, G := G(p, q) (1.3.10) p 1 q 1 is igrded set. An elementry progrph e over G is forml opertor leled y n element of G(p, q). The input (resp. output) rity of e is p (resp. q). We represent e s rectngle leled y g with p incoming edges (elow the rectngle) nd q outgoing edges (ove the rectngle). For instnce, if G(2, 3), the elementry progrph leled y is depicted y (1.3.11) 1 2 A progrph over G is forml opertor defined recursively s follows. A progrph over G cn e either n elementry progrph over G, or specil element, the wire depicted y, (1.3.12) or comintion of two progrphs over G through the following two opertions. The first one, denoted y, consists in plcing two progrphs side y side. For instnce, if x is progrph with p inputs (resp. q outputs) nd y is progrph with p inputs (resp. q outputs), 1 q 1 q 1 q 1 q x 1 p y 1 p = x y 1 p 1 p. (1.3.13) The second one, denoted y, consists in connecting the inputs of first progrph over the outputs of second. For instnce, if x is progrph with p inputs (resp. q outputs) nd y is progrph with r inputs (resp. p outputs), 1 q 1 p 1 q 1 p 1 r = 1 r. (1.3.14) By definition, connecting the input (resp. output) of wire to the output (resp. input) of progrph x does not chnge x. The input (resp. output) rity of progrph x is its numer of inputs i(x) (resp. outputs o(x)). The inputs (resp. outputs) of progrph re numered from left to right from 1 to i(x) (resp. o(x)), possily implicitly in the drwings. The degree deg(x) of progrph x is the numer of

9 8 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO elementry progrphs required to uild it. For instnce, (1.3.15) is progrph over G := G(2, 2) G(3, 1) where G(2, 2) := {} nd G(3, 1) := {}. Its input rity is 7, its output rity is 5, nd its degree is 3. The free PRO generted y G is the PRO Free(G) whose elements re ll the progrphs on G, the horizontl composition eing the opertion on progrphs, nd the verticl composition eing the opertion. Its unit 1 1 is the wire, nd for ny p 0, 1 p is the horizontl composition of p occurrences of the wire. Notice tht y (1.3.10), there is no elementry progrph in Free(G) with null input or output rity. Therefore, 1 0 is the only element of Free(G) with null input (resp. output) rity. In this work, we consider only free PROs stisfying this property. Lemm 1.1. Let P e free PRO nd x, y, z, t P such tht x y = z t. Then, there exist four unique elements x 1, x 2, y 1, y 2 of P such tht x = x 1 x 2, y = y 1 y 2, z = x 1 y 1, nd t = x 2 y 2. Proof. Let us prove the uniqueness. Assume tht there re x 1, x 2, y 1, y 2 P nd x 1, x 2, y 1, y 2 P such tht x = x 1 x 2 = x 1 x 2, y = y 1 y 2 = y 1 y 2, z = x 1 y 1 = x 1 y 1, nd t = x 2 y 2 = x 2 y 2. Then, we hve in prticulr o(x 1 ) = o(x 1) nd o(y 1 ) = o(y 1). This, together with the reltion x 1 y 1 = x 1 y 1 nd the fct tht P is free, implies x 1 = x 1 nd y 1 = y 1. In the sme wy, we otin x 2 = x 2 nd y 2 = y 2. Let us now give geometricl proof for the existence sed upon the fct tht progrphs re plnr ojects. Since u := x y = z t, u is progrph otined y n horizontl composition of two progrphs. Then, u = x y depicted in plne P cn e split into two regions X nd Y such tht X contins the progrph x, Y contins the progrph y, nd y is t the right of x. On the other hnd, u = z t depicted in the sme plne P cn e split into two regions Z nd T such tht Z contins the progrph z, T contins the progrph t, nd t is elow z, the inputs of z eing connected to the outputs of t. We then otin division of P into four regions X Z, X T, Y Z, nd Y T, respectively contining progrphs x 1, x 2, y 1, nd y 2, nd such tht x 1 y 1 = z, x 2 y 2 = t, x 1 x 2 = x, nd y 1 y 2 = y Reduced nd indecomposle elements. Let P e free PRO. Since P is free, ny element x of P cn e uniquely written s x = x 1 x l where the x i re elements of P different from 1 0, nd l 0 is mximl. We cll the word dec(x) := (x 1,, x l ) the mximl decomposition of x nd the x i the fctors of x. Notice tht the mximl decomposition of 1 0 is the empty word. We hve, for instnce, dec =,,. (1.3.16)

10 COMBINATORIAL HOPF ALGEBRAS FROM PROS 9 An element x of P is reduced if ll its fctors re different from 1 1. For ny element x of P, we denote y red(x) the reduced element of P dmitting s mximl decomposition the longest suword of dec(x) consisting in fctors different from 1 1. We hve, for instnce, red =. (1.3.17) By extension, we denote y red(p) the set of the reduced elements of P. Note tht 1 0 elongs to red(p). Besides, we sy tht n element x of P is indecomposle if its mximl decomposition consists in exctly one fctor. Note tht 1 0 is not indecomposle while 1 1 is. Lemm 1.2. Let P e free PRO nd x, y P, such tht x = red(y). Then, y denoting y (x 1,, x l ) the mximl decomposition of x, there exists unique sequence of nonnegtive integers p 1,, p l, p l+1 such tht y = 1 p1 x 1 1 p2 x 2 x l 1 pl+1. (1.3.18) Proof. The existence comes from the fct tht, since x = red(y), the mximl decomposition of x is otined from the one of y y suppressing the fctors equl to the wire. The uniqueness comes from the fct tht P is free monoid for the horizontl composition. 2. From PROs to comintoril Hopf lgers We introduce in this section the min construction of this work nd review some of its properties. In ll this section, P is free PRO generted y igrded set G. Strting with P, our construction produces ilger H(P) whose ses re indexed y the reduced elements of P. We shll lso extend this construction over clss of non necessrily free PROs The Hopf lger of free PRO. The ses of the vector spce H(P) := Vect(red(P)) (2.1.1) re indexed y the reduced elements of P. The elements S x, x red(p), form thus sis of H(P), clled fundmentl sis. We endow H(P) with product : H(P) H(P) H(P) linerly defined, for ny reduced elements x nd y of P, y S x S y := S x y, (2.1.2) nd with coproduct : H(P) H(P) H(P) linerly defined, for ny reduced elements x of P, y (S x ) := S red(y) S red(z). (2.1.3) y,z P y z=x

11 10 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Throughout this section, we shll consider some exmples involving the free PRO generted y G := G(2, 2) G(3, 1) where G(2, 2) := {} nd G(3, 1) := {}, denoted y AB. For instnce, we hve in H(AB) S S = S (2.1.4) nd S = S 10 S + S S + S S + S S + S S + S S 10. (2.1.5) Lemm 2.1. Let P e free PRO. Then, the coproduct of H(P) is cossocitive. Proof. The ses of the vector spce Vect(P) re indexed y the (non-necessrily reduced) elements of P. Then, the elements R x, x P, form sis of Vect(P). Let us consider the coproduct defined, for ny x P, y (R x ) := y,z P y z=x R y R z. (2.1.6) The ssocitivity of the verticl composition of P (see (1.3.5)) implies tht is cossocitive nd hence, tht Vect(P) together with form colger. Consider now the mp φ : Vect(P) H(P) defined, for ny x P, y φ(r x ) := S red(x). Let us show tht φ commutes with the coproducts nd, tht is, (φ φ) = φ. Let x P. By Lemm 1.2, y denoting y (x 1,, x l ) the mximl decomposition of red(x), there is unique wy to write x s x = 1 p1 x 1 x l 1 l+1 where the p i re some integers. Then, thnks to

12 COMBINATORIAL HOPF ALGEBRAS FROM PROS 11 the ssocitivity of (see (1.3.4)), y itertively pplying Lemm 1.1, we hve (φ φ) (R x ) = S red(y) S red(z) (2.1.7) = = = y,z P y z=x y 1,...,y l P z 1,...,z l P (1 p1 y 1 y l 1 l+1 ) (1 p1 z 1 z l 1 l+1 )= 1 p1 x 1 x l 1 l+1 y 1,...,y l P z 1,...,z l P (y 1 y l ) (z 1 z l )=x 1 x l y,z P y z=red(x) S red(1p1 y 1 y l 1 l+1 ) S red(1p1 z 1 z l 1 l+1 ) (2.1.8) S red(y1 y l ) S red(z1 z l ) (2.1.9) S red(y) S red(z) (2.1.10) = (φ (R x )). (2.1.11) Now, the cossocitivity of comes from the fct tht φ is surjective mp commuting with nd. In more detils, if x is reduced element of P nd I is the identity mp on H(P), we hve ( I) (S x ) = ( I) (φ (R x )) (2.1.12) = (φ φ φ)( I) (R x ) (2.1.13) = (φ φ φ)(i ) (R x ) (2.1.14) = (I ) (φ (R x )) (2.1.15) = (I ) (S x ). (2.1.16) Lemm 2.2. Let P e free PRO. Then, the coproduct of H(P) is morphism of lgers. Proof. Let x nd y e two reduced elements of P. We hve (S x S y ) = S red(z) S red(t) (2.1.17) nd (S x ) (S y ) = x 1,x 2,y 1,y 2 P x 1 x 2=x y 1 y 2=y z,t P z t=x y S red(x1) red(y 1) S red(x2) red(y 2). (2.1.18) The coproduct is morphism of lgers if (2.1.17) nd (2.1.18) re equl. Let us show tht it is the cse. Assume tht there re two elements z nd t of P such tht z t = x y. Then, the pir (z, t) contriutes to the coefficient of the tensor S red(z) S red(t) in (2.1.17). Moreover, since P is free, y Lemm 1.1, there exist four unique elements x 1, x 2, y 1, nd y 2 of P such tht x = x 1 x 2,

13 12 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO y = y 1 y 2, z = x 1 y 1, nd t = x 2 y 2. Then, since red(x 1 ) red(y 1 ) = red(x 1 y 1 ) = red(z) nd red(x 2 ) red(y 2 ) = red(x 2 y 2 ) = red(t), the qudruple (x 1, x 2, y 1, y 2 ), wholly nd uniquely determined y the pir (z, t), contriutes to the coefficient of the tensor S red(z) S red(t) in (2.1.18). Conversely, ssume tht there re four elements x 1, x 2, y 1, nd y 2 in P such tht x 1 x 2 = x nd y 1 y 2 = y. Then, the qudruple (x 1, x 2, y 1, y 2 ) contriutes to the coefficient of the tensor S red(x1) red(y 1) S red(x2) red(y 2) in (2.1.18). Now, y (1.3.6), we hve x y = (x 1 x 2 ) (y 1 y 2 ) = (x 1 y 1 ) (x 2 y 2 ). (2.1.19) Then, since red(x 1 ) red(y 1 ) = red(x 1 y 1 ) nd red(x 2 ) red(y 2 ) = red(x 2 y 2 ), the pir (x 1 y 1, x 2 y 2 ), wholly nd uniquely determined y the qudruple (x 1, x 2, y 1, y 2 ), contriutes to the coefficient of the tensor S red(x1) red(y 1) S red(x2) red(y 2) in (2.1.17). Hence, the coefficient of ny tensor is the sme in (2.1.17) nd in (2.1.18). expressions re equl. Then, these Theorem 2.3. Let P e free PRO. Then, H(P) is ilger. Proof. The ssocitivity of comes directly from the ssocitivity of the horizontl composition of P (see (1.3.4)). Moreover, y Lemms 2.1 nd 2.2, the coproduct of H(P) is cossocitive nd is morphism of lgers. Thus, H(P) is ilger Properties of the construction. Let us now study the generl properties of the ilgers otined y the construction H Algeric genertors nd freeness. Proposition 2.4. Let P e free PRO. Then, H(P) is freely generted s n lger y the set of ll S g, where the g re indecomposle nd reduced elements of P. Proof. Any reduced element x of P cn e written s x = x 1 x l where (x 1,, x l ) is the mximl decomposition of x. This implies tht in H(P), we hve S x = S x1 S xl. Since for ll i [l], the S xi re indecomposle nd reduced elements of P, the set of ll S g genertes H(P). The uniqueness of the mximl decomposition of x implies tht H(P) is free on the S g Grdings. There re severl wys to define grdings for H(P) to turn it into comintoril Hopf lger. For this purpose, we sy tht mp ω : red(p) N is grding of P if it stisfies the following four properties: (G1) for ny reduced elements x nd y of P, ω(x y) = ω(x) + ω(y); (G2) for ny reduced elements x of P stisfying x = y z where y, z P, ω(x) = ω(red(y)) + ω(red(z)); (G3) for ny n 0, the fier ω 1 (n) is finite; (G4) ω 1 (0) = {1 0 }.

14 COMBINATORIAL HOPF ALGEBRAS FROM PROS 13 A very generic wy to endow P with grding consists in providing mp ω : G N \ {0} ssociting positive integer with ny genertor of P, nmely its weight; the degree ω(x) of ny element x of P eing the sum of the weights of the occurrences of the genertors used to uild x. For instnce, the mp ω defined y ω() := 3 nd ω() := 2 is grding of AB nd we hve ω = 8. (2.2.1) Proposition 2.5. Let P e free PRO nd ω e grding of P. Then, with the grding H(P) = n 0 Vect (S x : x red(p) nd ω(x) = n), (2.2.2) H(P) is comintoril Hopf lger. Proof. Notice first tht S 10 is the neutrl element of the product of H(P), nd, for ny reduced element x of P of degree different from 0, the coproduct (S x ) contins the tensors S 10 S x nd S x S 10. Then, together with the fct tht y (G4), S 10 is n element of the homogeneous component of degree 0 of H(P), H(P) dmits unit nd counit. Moreover, (G3) implies tht for ll n 0, the homogeneous components of degree n of H(P) re finite, nd (G4) implies tht H(P) is connected. Besides, respectively y (G1) nd y (G2), the grding provided y ω is comptile with the product nd the coproduct of H(P). Hence, together with the fct tht, y Theorem 2.3, H(P) is ilger, it is lso comintoril Hopf lger Antipode. Since the ntipode of comintoril Hopf lger cn e computed y induction on the degree, we otin n expression for the one of H(P) when P dmits grding. This expression is n instnce of the Tkeuchi formul [Tk71] nd is prticulrly simple since the product of H(P) is multiplictive. Proposition 2.6. Let P e free PRO dmitting grding. For ny reduced element x of P different from 1 0, the ntipode ν of H(P) stisfies ν(s x ) = ( 1) l S red(x1 x l ). (2.2.3) x 1,...,x l P,l 1 x 1 x l =x red(x i) 1 0,i [l] Proof. By Proposition 2.5, H(P) is comintoril Hopf lger, nd hence, the ntipode ν, which is the inverse of the identity morphism for the convolution product, exists nd is unique. Then, for ny reduced element x of P different from 1 0, ν(s x ) = S x ν ( ) S red(y) Sred(z). (2.2.4) y,z P\{x} y z=x Expression (2.2.3) for ν follows now y induction on the degree of x in P.

15 14 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO We hve for instnce in H(AB), νs = S + S + S S. (2.2.5) Dulity. When P dmits grding, let us denote y H(P) the grded dul of H(P). By definition, the djoint sis of the fundmentl sis of H(P) consists in the elements S x, x red(p). Proposition 2.7. Let P e free PRO dmitting grding. Then, for ny reduced elements x nd y of P, the product nd the coproduct of H(P) stisfy S x S y = x,y P x y red(p) red(x )=x,red(y )=y S x y (2.2.6) nd (S x) = y,z P y z=x S y S z. (2.2.7) Proof. Let us denote y, : H(P) H(P) C the dulity rcket etween H(P) nd its grded dul. By dulity, we hve S x S y = z red(p) (Sz ), S x S y S z. (2.2.8) Expression (2.2.6) follows from the fct tht for ny reduced element z of P, S x S y ppers in (S z ) if nd only if there exist x, y P such tht x y = z, red(x ) = x nd red(y ) = y. Besides, gin y dulity, we hve (S x) = y,z red(p) S y S z, S x S y S z. (2.2.9) Expression (2.2.7) follows from the fct tht for ny reduced elements y nd z of P, S x ppers in S y S z if nd only if y z = x.

16 COMBINATORIAL HOPF ALGEBRAS FROM PROS 15 For instnce, we hve in H(AB) S S = S + S + S + S + S + S + S + 2 S (2.2.10) nd S = S 1 0 S + S S + S S + S S 1 0. (2.2.11) Quotient ilgers. Proposition 2.8. Let G nd G e two igrded sets such tht G G. Then, the mp φ : H(Free(G)) H(Free(G )) linerly defined, for ny reduced element x of Free(G), y { Sx if x Free(G ), φ(s x ) := (2.2.12) 0 otherwise, is surjective ilger morphism. Moreover, H(Free(G )) is quotient ilger of H(Free(G)). Proof. Let V e the liner spn of the S x where the x re reduced elements of Free(G)\Free(G ). Immeditely from the definitions of the product nd the coproduct of H(Free(G)), we oserve tht V is ilger idel of H(Free(G)). The mp φ is the cnonicl projection from H(Free(G)) to H(Free(G))/ V H(Free(G )), whence the result The Hopf lger of stiff PRO. We now extend the construction H to clss nonnecessrily free PROs. Still in this section, P is free PRO. Let e congruence of P. For ny element x of P, we denote y [x] (or y [x] if the context is cler) the -equivlence clss of x. We sy tht is stiff congruence if the following three properties re stisfied: (C1) for ny reduced element x of P, the set [x] is finite; (C2) for ny reduced element x of P, [x] contins reduced elements only;

17 16 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO (C3) for ny two elements x nd x of P such tht x x, the mximl decompositions of x nd x re, respectively of the form (x 1,, x l ) nd (x 1,, x l ) for some l 0, nd for ny i [l], x i x i. We sy tht PRO is stiff PRO if it is the quotient of free PRO y stiff congruence. For ny -equivlence clss [x] of reduced elements of P, set T [x] := S x. (2.3.1) x [x] Notice tht thnks to (C1) nd (C2), T [x] is well-defined element of H(P). For instnce, if P is the quotient of the free PRO generted y G := G(1, 1) G(2, 2) where G(1, 1) := {} nd G(2, 2) := {} y the finest congruence stisfying, (2.3.2) one hs T = S + S + S + S. (2.3.3) Moreover, we cn oserve tht is stiff congruence. If is stiff congruence of P, (C2) nd (C3) imply tht ll the elements of sme - equivlence clss [x] hve the sme numer of fctors nd re ll reduced or ll nonreduced. Then, y extension, we shll sy tht -equivlence clss [x] of P/ is indecomposle (resp. reduced) if ll its elements re indecomposle (resp. reduced) in P. In the sme wy, the wire of P/ is the -equivlence clss of the wire of P. We shll now study how the product nd the coproduct of H(P) ehve on the T [x] Product. Let us show tht the liner spn of the T [x], where the [x] re -equivlence clsses of reduced elements of P, forms sulger of H(P). The product on the T [x] is multiplictive nd dmits the following simple description. Proposition 2.9. Let P e free PRO nd e stiff congruence of P. Then, for ny - equivlence clsses [x] nd [y], where x (resp. y) is ny element of [x] (resp. [y]). T [x] T [y] = T [x y], (2.3.4) Proof. We hve T [x] T [y] = S x y (2.3.5) x [x] y [y]

18 COMBINATORIAL HOPF ALGEBRAS FROM PROS 17 nd T [x y] = z [x y] S z. (2.3.6) Let us show tht (2.3.5) nd (2.3.6) re equl. It is enough to check tht these sums hve the sme support. Indeed, (2.3.6) is y definition multiplicity free nd (2.3.5) is multiplicity free ecuse P is free, nd ll elements of -equivlence clss hve the sme input rity nd the sme output rity. Assume tht there is reduced element t of P such tht S t ppers in (2.3.5). Then, one hs t = x y for two reduced elements x nd y of P such tht x [x] nd y [y]. Since is congruence of PROs, we hve [x y ] = [x y] nd thus, t [x y]. This shows tht S t lso ppers in (2.3.6). Conversely, ssume tht there is reduced element z of P such tht S z ppers in (2.3.6). Then, one hs z [x y]. Since stisfies (C3), the mximl decomposition of z stisfies dec(z) = (x 1,, x k, y 1,, y l ) where dec(x) = (x 1,, x k ), dec(y) = (y 1,, y l ), x i x i, nd y j y j for ll i [k] nd j [l]. Moreover, s is congruence of PROs, x := x 1 x k x nd y := y 1 y l y. We then hve z = x y with x [x] nd y [y]. This shows tht S z lso ppers in (2.3.5) Coproduct. To prove tht the liner spn of the T [x], where the [x] re -equivlence clsses of reduced elements of P, forms sucolger of H(P) nd provides the description of the coproduct of T [x], we need the following nottion. For ny element x of P, red ([x]) := {red (x ) : x [x]}. (2.3.7) Lemm Let P e free PRO nd e stiff congruence of P. For ny element x of P, red ([x]) = [red(x)]. (2.3.8) Proof. Let us denote y y the element red(x) nd let y red([x]). Let us show tht y [red(x)]. By Definition (2.3.7), there is n element x of P such tht x [x] nd red(x ) = y. Since stisfies (C3), dec(x ) nd dec(x) hve the sme length l nd dec(x ) i dec(x) i for ll i [l]. Moreover, since stisfies (C2), for ll i [l], dec(x ) i nd dec(x) i re oth reduced elements or re oth wires. Hence, since dec(y ) nd dec(y) re, respectively suwords of dec(x ) nd dec(x), they hve the sme length k nd dec(y ) j dec(y) j for ll j [k]. Finlly, since is congruence of PROs, y y. This shows tht y [red(x)] nd hence, red([x]) [red(x)]. Agin, let us denote y y the element red(x) nd let y [red(x)]. Let us show tht y red([x]). Since y y nd stisfies (C3), dec(y ) nd dec(y) hve the sme length l nd dec(y ) i dec(y) i for ll i [l]. Moreover, since y = red(x), y Lemm 1.2, for some p 1,, p l+1 0, we hve x = 1 p1 dec(y) 1 1 pl dec(y) l 1 pl+1. Now, y setting x := 1 p1 dec(y ) 1 1 pl dec(y ) l 1 pl+1, the fct tht is congruence of PROs implies x x. Since y = red(x ), this shows tht y red([x]) nd hence, [red(x)] red([x]).

19 18 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Lemm Let P e free PRO, e stiff congruence of P, nd y nd z e two elements of P such tht y z. Then, red(y) = red(z) implies y = z. Proof. By contrposition, ssume tht y z. Since y z nd stisfies (C3), dec(y) nd dec(z) hve the sme length l, nd dec(y) i dec(z) i for ll i [l]. Moreover, s y z, there exists j [l] such tht dec(y) j dec(z) j. Now, since stisfies (C2), dec(y) j nd dec(z) j re oth reduced elements. Moreover, for ll i [l], dec(y) i nd dec(z) i re oth reduced elements or re oth wires. Hence, there is j 1 such tht dec(red(y)) j = dec(y) j nd dec(red(z)) j = dec(z) j. Since P is free, this implies tht red(y) red(z). Proposition Let P e free PRO nd e stiff congruence of P. Then, for ny -equivlence clss [x], ( ) T [x] = T red([y]) T red([z]). (2.3.9) [y],[z] P/ [y] [z]=[x] Proof. We hve ( T [x] ) = y,z P y z [x] = = = = y,z P [y] [z]=[x] [y],[z] P/ [y] [z]=[x] [y],[z] P/ [y] [z]=[x] S red(y) S red(z) (2.3.10) S red(y) S red(z) (2.3.11) y [y] z [z] y red([y]) z red([z]) S red(y ) S red(z ) (2.3.12) S y S z (2.3.13) T red([y]) T red([z]). (2.3.14) [y],[z] P/ [y] [z]=[x] Let us comment the non-ovious equlities ppering in this computtion. The equlity etween (2.3.10) nd (2.3.11) comes from the fct tht is congruence of PROs. The equlity etween (2.3.12) nd (2.3.13) is consequence of Lemm Finlly, (2.3.13) is, thnks to Lemm 2.10, equl to (2.3.14) Su-ilger. The description of the product nd the coproduct on the T [x] leds to the following result. Theorem Let P e free PRO nd e stiff congruence of P. Then, the liner spn of the T [x], where the [x] re -equivlence clsses of reduced elements of P, forms su-ilger of H(P).

20 COMBINATORIAL HOPF ALGEBRAS FROM PROS 19 Proof. By Propositions 2.9 nd 2.12, the product nd the coproduct of H(P) re still well-defined on the T [x]. Then, since the T [x] re y (2.3.1) sums of some S x, this implies the sttement of the theorem. We shll denote, y slight use of nottion, y H(P/ ) the su-ilger of H(P) spnned y the T [x], where the [x] re -equivlence clsses of reduced elements of P. Notice tht the construction H s it ws presented in Section 2.1 is specil cse of this ltter when is the most refined congruence of PROs. Note tht this construction of su-ilgers of H(P) y tking n equivlence reltion stisfying some precise properties nd y considering the elements otined y summing over its equivlence clsses is nlog to the construction of certin su-ilgers of the Mlvenuto- Reutenuer Hopf lger [MR95]. Indeed, some fmous Hopf lgers re otined in this wy, s the Lody-Ronco Hopf lger [LR98] y using the sylvester monoid congruence [HNT05], or the Poirier-Reutenuer Hopf lger [PR95] y using the plctic monoid congruence [DHT02,HNT05] The importnce of the stiff congruence condition. Let us now explin why the stiff congruence condition required s premise of Theorem 2.13 is importnt y providing n exmple of non-stiff congruence of PROs filing to produce ilger. Consider the PRO P quotient of the free PRO generted y G := G(1, 1) G(2, 2) where G(1, 1) := {} nd G(2, 2) := {} y the finest congruence stisfying (2.3.15) Here, is not stiff congruence since it stisfies (C2) ut not (C3). We hve T [ ] T [ ] = S S = S (2.3.16) ut this lst element cnnot e expressed on the T [x].

21 20 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Besides, y strightforwrd computtion, we hve T = S + S + S = T [10] T + T T [10] + 2 T T + 2 T T + S S + S S, (2.3.17) showing tht the coproduct is neither well-defined on the T [x] Properties. By using similr rguments s those used to estlish Proposition 2.4 together with the fct tht stisfies (C3) nd the product formul of Proposition 2.9, we otin tht H(P/ ) is freely generted s n lger y the T [x] where the [x] re -equivlence clsses of indecomposle nd reduced elements of P. Moreover, when ω is grding of P so tht ll elements of sme -equivlence clss hve the sme degree, the ilger H(P/ ) is grded y the grding inherited from the one of H(P) nd forms hence comintoril Hopf lger. Proposition Let P e free PRO nd 1 nd 2 e two stiff congruences of P such tht 1 is finer thn 2. Then, H (P/ 2 ) is su-ilger of H (P/ 1 ). Proof. Since 1 is finer tht 2, ny T [x] 2, where [x] 2 is 2 -equivlence clss of reduced elements of P, is sum of some T [x ] 1. More precisely, we hve T [x] 2 = [x ] 1 [x] 2 T [x ] 1, (2.3.18) implying the result Relted constructions. In this section, we first descrie two constructions llowing to uild stiff PROs. The min interest of these constructions is tht the otined stiff PROs cn e plced t the input of the construction H. We next present wy to recover the nturl Hopf lger of n operd through the construction H nd the previous constructions of stiff PROs.

22 COMBINATORIAL HOPF ALGEBRAS FROM PROS From operds to stiff PROs. Any operd O gives nturlly rise to PRO R(O) whose elements re sequences of elements of O (see [Mr08]). We recll here this construction. Let us set R(O) := p 0 q 0 R(O)(p, q) where R(O)(p, q) := {x 1 x q : x i O(p i ) for ll i [q] nd p p q = p}. (2.4.1) The horizontl composition of R(O) is the conctention of sequences, nd the verticl composition of R(O) comes directly from the composition mp of O. More precisely, for ny x 1 x r R(O)(q, r) nd y 11 y 1q1 y r1 y rqr R(O)(p, q), we hve x 1 x r y 11 y 1q1 y r1 y rqr := x 1 [y 11,, y 1q1 ] x r [y r1,, y rqr ], (2.4.2) where for ny i [r], x i O(q i ) nd the occurrences of in the right-memer of (2.4.2) refer to the totl composition mp of O. For instnce, if O is the free operd generted y genertor of rity 2, O is n operd involving inry trees. Then, the elements of the PRO R(O) re forests of inry trees. The horizontl composition of R(O) is the conctention of forests, nd the verticl composition F 1 F 2 in R(O), defined only etween two forests F 1 nd F 2 such tht the numer of leves of F 1 is the sme s the numer of trees in F 2, consists in the forest otined y grfting, from left to right, the roots of the trees of F 2 on the leves of F 1. Proposition Let O e n operd such tht the monoid (O(1), 1 ) does not contin ny nontrivil sugroup. Then, R(O) is stiff PRO. Proof. As ny operd, O is the quotient y certin operdic congruence of the free operd generted y certin set of genertors G. It follows directly from the definition of the construction R tht the PRO R(O) is the quotient y the congruence of PROs of the free PRO generted y G where { G(p) if p 1 nd q = 1, G (p, q) := (2.4.3) otherwise, nd is the finest congruence of PROs stisfying x y for ny reltion x y etween elements x nd y of the free operd generted y G. Since y hypothesis (O(1), 1 ) does not contin ny nontrivil sugroup, for ll elements x nd y of O(1) \ {1}, x 1 y 1. Then, stisfies (C2). Moreover, y definition of R, stisfies (C3). Hence, R(O) is stiff PRO From monoids to stiff PROs. Any monoid M cn e seen s n operd concentrted in rity one. Then, strting from monoid M, one cn construct PRO B(M) y pplying the construction R on M seen s n operd. This construction cn e rephrsed s follows. We hve B(M) = p 0 q 0 B(M)(p, q) where B(M)(p, q) = { {x1 x p : x i M for ll i [p]} if p = q, otherwise. (2.4.4)

23 22 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO The horizontl composition of B(M) is the conctention of sequences nd the verticl composition : B(M)(p, p) B(M)(p, p) B(M)(p, p) of B(M) stisfies, for ny x 1 x p B(M)(p, p) nd y 1 y q B(M)(q, q), where is the product of M. x 1 x p y 1 y p = (x 1 y 1 ) (x p y p ), (2.4.5) For instnce, if M is the dditive monoid of nturl numers, the PRO B(M) contins ll words over N. The horizontl composition of B(M) is the conctention of words, nd the verticl composition of B(M), defined only on words with sme length, is the componentwise ddition of their letters. Proposition Let M e monoid tht does not contin ny nontrivil sugroup. Then, B(M) is stiff PRO. Proof. Since M does not contin ny nontrivil sugroup, seen s n operd, the elements of rity one of M do not contin ny nontrivil sugroup. Hence, y definition of the construction B pssing y R nd y Proposition 2.15, B(M) is stiff PRO The nturl Hopf lger of n operd. We cll eliniztion of ilger H the quotient of H y the ilger idel spnned y the x y y x for ll x, y H. Here is the link etween our construction H nd the construction H. Proposition Let O e n operd such tht the monoid (O(1), 1 ) does not contin ny nontrivil sugroup. Then, the ilger H (O) is the eliniztion of H(R(O)). Proof. By Proposition 2.15, R(O) is stiff PRO, nd then, y Theorem 2.13, H(R(O)) is ilger. By construction, this ilger is freely generted y the T x where x O. Hence, the mp φ : H(R(O)) H (O) defined for ny x O y φ(t x ) := T x cn e uniquely extended into ilger morphism, which we denote lso y φ. Since H (O) is generted y the T x where x O, φ is surjective. Directly from the definition of the construction H, we oserve tht the kernel of φ is the ilger idel I spnned y the T x y T y x for ll x, y R(O). Then, the ssocited mp φ I : H(R(O))/ I H (O) is ilger isomorphism. 3. Exmples of ppliction of the construction We conclude this pper y presenting exmples of ppliction of the construction H. The PROs considered in this section fit into the digrm represented y Figure 1 nd the otined Hopf lgers fit into the digrm represented y Figure Hopf lgers of forests. We present here the construction of two Hopf lgers of forests, one depending on nonnegtive integer γ, nd with different grdings. The PRO we shll define in this section will intervene in the next exmples.

24 COMBINATORIAL HOPF ALGEBRAS FROM PROS 23 FBT γ Hep γ PRF γ BAs γ As γ FHep γ Figure 1. Digrm of PROs where rrows (resp. ) re injective (resp. surjective) PRO morphisms. The prmeter γ is positive integer. When γ = 0, PRF 0 = As 0 = Hep 0 = FHep 0 nd FBT 0 = BAs 0. H(FBT γ ) H(Hep γ ) H(PRF γ ) H(BAs γ ) H(As γ ) H(FHep γ ) Figure 2. Digrm of comintoril Hopf lgers where rrows (resp. ) re injective (resp. surjective) PRO morphisms. The prmeter γ is positive integer. When γ = 0, H(PRF 0 ) = H(As 0 ) = H(Hep 0 ) = H(FHep 0 ) nd H(FBT 0 ) = H(BAs 0 ) PRO of forests with fixed rity. Let γ e nonnegtive integer nd PRF γ e the free PRO generted y G := G(γ + 1, 1) := {}, with the grding ω defined y ω() := 1. Any progrph x of PRF γ cn e seen s plnr forest of plnr rooted trees with only internl nodes of rity γ + 1. Since the reduced elements of PRF γ hve no wire, they re encoded y forests of nonempty trees Hopf lger. By Theorem 2.3 nd Proposition 2.5, H(PRF γ ) is comintoril Hopf lger. By Proposition 2.4, s n lger, H(PRF γ ) is freely generted y the S T, where the T re nonempty plnr rooted trees with only internl nodes of rity γ + 1. Its ses re indexed y plnr forests of such trees where the degree of sis element S F is the numer of internl nodes of F. Notice tht the ses of H(PRF 0 ) re indexed y forests of liner trees nd tht H(PRF 0 ) nd Sym re trivilly isomorphic s comintoril Hopf lgers Coproduct. By definition of the construction H, the coproduct of H(PRF γ ) is given on genertor S T y (S T ) = S T S T/T, (3.1.1) T Adm(T ) where Adm(T ) is the set of dmissile cuts of T, tht is, the empty tree or the sutrees of T contining the root of T nd where T/ T denotes the forest consisting in the mximl sutrees

25 24 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO of T whose roots re leves of T, y respecting the order of these leves in T nd y removing the empty trees. For instnce, we hve S = S S + S S + S S + S S + S S + S S + S S. (3.1.2) This coproduct is similr to the one of the noncommuttive Connes-Kreimer Hopf lger CK [CK98]. The min difference etween H(PRF γ ) nd CK lies in the fct tht in coproduct of CK, the dmissile cuts cn chnge the rity of some internl nodes; it is not the cse in H(PRF γ ) ecuse for ny T Adm(T ), ny internl node x of T hs the sme rity s it hs in T Dimensions. The series of the lgeric genertors of H(PRF γ ) is G(t) := n 1 1 nγ + 1 ( n(γ + 1) n ) t n (3.1.3) since its coefficients re the Fuss-Ctln numers, counting plnr rooted trees with n internl nodes of rity γ + 1. Since H(PRF γ ) is free s n lger, its Hilert series is H(t) := 1 1 G(t). The first dimensions of H(PRF 1 ) re nd those of H(PRF 2 ) re 1, 1, 3, 10, 35, 126, 462, 1716, 6435, 24310, 92378, (3.1.4) 1, 4, 19, 98, 531, 2974, 17060, 99658, , , (3.1.5) The first sequence is listed in [Slo] s Sequence A nd the second s Sequence A PRO of generl forests. We denote y PRF the free PRO generted y G := n 1 G(n, 1) := n 1 { n }. Any progrph x of PRF cn e seen s plnr forest of plnr rooted trees. Since the reduced elements of PRF hve no wire, they re encoded y forests of nonempty trees. Oserve tht for ny nonnegtive integer γ, PRF γ is su-pro of PRF.

26 COMBINATORIAL HOPF ALGEBRAS FROM PROS Hopf lger. By Theorem 2.3, H(PRF ) is ilger. By Proposition 2.4, s n lger, H(PRF ) is freely generted y the S T, where the T re nonempty plnr rooted trees. Its ses re indexed y plnr forests of such trees. Besides, y Proposition 2.8, since PRF γ is generted y suset of the genertors of PRF, H(PRF γ ) is ilger quotient of H(PRF ). Moreover, the coproduct of H(PRF ) stisfies (3.1.1). To turn H(PRF ) into comintoril Hopf lger, we cnnot consider the grding ω defined y ω( n ) := 1 ecuse there would e infinitely mny elements of degree 1. Therefore, we consider on H(PRF ) the grding ω defined y ω( n ) := n. In this wy, the degree of sis element S F is the numer of edges of the forest F. By Proposition 2.5, H(PRF ) is comintoril Hopf lger Dimensions. The series of the lgeric genertors of H(PRF ) is G(t) := ( ) 1 2n t n (3.1.6) n + 1 n n 1 since its coefficients re the Ctln numers, counting plnr rooted trees with n edges. As H(PRF ) is free s n lger, its Hilert series is 1 H(t) := 1 G(t) = 1 + ( ) 1 2n t n. (3.1.7) 2 n n 1 The dimensions of H(PRF ) re then the sme s the dimensions of H(PRF 1 ) (see (3.1.4)) The Fà di Bruno lger nd its deformtions. We shll give here method to construct the Hopf lgers FdB γ of Foissy [Foi08] from our construction H in the cse where γ is nonnegtive integer Associtive PRO. Let γ e nonnegtive integer nd As γ e the quotient of PRF γ y the finest congruence stisfying, k 1 + k 2 = γ, l 1 + l 2 = γ. (3.2.1) k 1 k 2 l 1 l 2 We cn oserve tht As γ is stiff PRO ecuse stisfies (C2) nd (C3) nd tht As 0 = PRF 0. Moreover, oserve tht, when γ 1, there is in As γ exctly one indecomposle element of rity nγ + 1 for ny n 0. We denote y α n this element. We consider on As γ the grding ω inherited from the one of PRT γ. This grding is still well-defined in As γ since ny -equivlence clss contins progrphs of sme degree nd stisfies, for ll n 0, ω(α n ) = n. Any element of As γ is then word α k1 α kl nd cn e encoded y word of nonnegtive integers k 1 k l. Since the reduced elements of As γ hve no wire, they re encoded y words of positive integers.

27 26 JEAN-PAUL BULTEL AND SAMUELE GIRAUDO Hopf lger. By Theorem 2.13 nd Proposition 2.5, H(As γ ) is comintoril Hopf lger. As n lger, H(As γ ) is freely generted y the T n, n 1, nd its ses re indexed y words of positive integers where the degree of sis element T k1...k l is k k l Coproduct. Since ny element α n of As γ decomposes into α n = x y if nd only if x = α k nd y = α i1 α ikγ+1 with i i kγ+1 = n k, y Proposition 2.12, for ny n 1, the coproduct of H(As γ ) expresses s n (T n ) = T k T i1 T ikγ+1, (3.2.2) k=0 i 1+ +i kγ+1 =n k where T 0 is identified with the unity T ɛ of H(As γ ). For instnce, in H(As 1 ), we hve (T 3 ) = T 0 T 3 + T 1 (T 0 T 2 + T 1 T 1 + T 2 T 0 ) + T 2 (T 0 T 0 T 1 + T 0 T 1 T 0 + T 1 T 0 T 0 ) + T 3 (T 0 T 0 T 0 T 0 ) = T ɛ T T 1 T 2 + T 1 T T 2 T 1 + T 3 T ɛ, (3.2.3) nd in H(As 2 ), we hve (T 3 ) = T 0 T 3 + T 1 (T 0 T 0 T 2 + T 0 T 2 T 0 + T 2 T 0 T 0 + T 0 T 1 T 1 + T 1 T 0 T 1 + T 1 T 1 T 0 ) + T 2 (T 0 T 0 T 0 T 0 T 1 + T 0 T 0 T 0 T 1 T 0 + T 0 T 0 T 1 T 0 T 0 + T 0 T 1 T 0 T 0 T 0 + T 1 T 0 T 0 T 0 T 0 ) + T 3 T 0 T 0 T 0 T 0 T 0 T 0 T 0 = T ɛ T T 1 T T 1 T T 2 T 1 + T 3 T ɛ. (3.2.4) Isomorphism with the deformtion of the noncommuttive Fà di Bruno Hopf lger. Theorem 3.1. For ny nonnegtive integer γ, the Hopf lger H(As γ ) is the deformtion of the noncommuttive Fà di Bruno Hopf lger FdB γ. Proof. Let us set σ 1 := n 0 T n. By (3.2.2), we hve (σ 1 ) = n T k T i1 T ikγ+1 (3.2.5) n 0 k=0 i 1+ +i kγ+1 =n k = T k T i1 T ikγ+1 (3.2.6) k 0 n k i 1+ +i kγ+1 =n k = T k T i1 T ikγ+1 (3.2.7) k 0 i 1+ +i kγ+1 0 = T k T i k 0 i 0 = k 0 kγ+1 (3.2.8) T k σ kγ+1 1, (3.2.9)

Coalgebra, Lecture 15: Equations for Deterministic Automata

Coalgebra, Lecture 15: Equations for Deterministic Automata Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined

More information

CM10196 Topic 4: Functions and Relations

CM10196 Topic 4: Functions and Relations CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input

More information

Lecture 3: Equivalence Relations

Lecture 3: Equivalence Relations Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts

More information

p-adic Egyptian Fractions

p-adic Egyptian Fractions p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction

More information

Parse trees, ambiguity, and Chomsky normal form

Parse trees, ambiguity, and Chomsky normal form Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs

More information

Bases for Vector Spaces

Bases for Vector Spaces Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything

More information

Math 4310 Solutions to homework 1 Due 9/1/16

Math 4310 Solutions to homework 1 Due 9/1/16 Mth 4310 Solutions to homework 1 Due 9/1/16 1. Use the Eucliden lgorithm to find the following gretest common divisors. () gcd(252, 180) = 36 (b) gcd(513, 187) = 1 (c) gcd(7684, 4148) = 68 252 = 180 1

More information

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University

Farey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions

More information

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors:

Vectors , (0,0). 5. A vector is commonly denoted by putting an arrow above its symbol, as in the picture above. Here are some 3-dimensional vectors: Vectors 1-23-2018 I ll look t vectors from n lgeric point of view nd geometric point of view. Algericlly, vector is n ordered list of (usully) rel numers. Here re some 2-dimensionl vectors: (2, 3), ( )

More information

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35

MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 MATH 101A: ALGEBRA I PART B: RINGS AND MODULES 35 9. Modules over PID This week we re proving the fundmentl theorem for finitely generted modules over PID, nmely tht they re ll direct sums of cyclic modules.

More information

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q.

Analytically, vectors will be represented by lowercase bold-face Latin letters, e.g. a, r, q. 1.1 Vector Alger 1.1.1 Sclrs A physicl quntity which is completely descried y single rel numer is clled sclr. Physiclly, it is something which hs mgnitude, nd is completely descried y this mgnitude. Exmples

More information

set is not closed under matrix [ multiplication, ] and does not form a group.

set is not closed under matrix [ multiplication, ] and does not form a group. Prolem 2.3: Which of the following collections of 2 2 mtrices with rel entries form groups under [ mtrix ] multipliction? i) Those of the form for which c d 2 Answer: The set of such mtrices is not closed

More information

ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS

ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS ON ALTERNATING POWER SUMS OF ARITHMETIC PROGRESSIONS A. BAZSÓ Astrct. Depending on the prity of the positive integer n the lternting power sum T k n = k + k + + k...+ 1 n 1 n 1 + k. cn e extended to polynomil

More information

Things to Memorize: A Partial List. January 27, 2017

Things to Memorize: A Partial List. January 27, 2017 Things to Memorize: A Prtil List Jnury 27, 2017 Chpter 2 Vectors - Bsic Fcts A vector hs mgnitude (lso clled size/length/norm) nd direction. It does not hve fixed position, so the sme vector cn e moved

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

Random subgroups of a free group

Random subgroups of a free group Rndom sugroups of free group Frédérique Bssino LIPN - Lortoire d Informtique de Pris Nord, Université Pris 13 - CNRS Joint work with Armndo Mrtino, Cyril Nicud, Enric Ventur et Pscl Weil LIX My, 2015 Introduction

More information

Rectangular group congruences on an epigroup

Rectangular group congruences on an epigroup cholrs Journl of Engineering nd Technology (JET) ch J Eng Tech, 015; 3(9):73-736 cholrs Acdemic nd cientific Pulisher (An Interntionl Pulisher for Acdemic nd cientific Resources) wwwsspulishercom IN 31-435X

More information

Theoretical foundations of Gaussian quadrature

Theoretical foundations of Gaussian quadrature Theoreticl foundtions of Gussin qudrture 1 Inner product vector spce Definition 1. A vector spce (or liner spce) is set V = {u, v, w,...} in which the following two opertions re defined: (A) Addition of

More information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

Review of Gaussian Quadrature method

Review of Gaussian Quadrature method Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge

More information

Torsion in Groups of Integral Triangles

Torsion in Groups of Integral Triangles Advnces in Pure Mthemtics, 01,, 116-10 http://dxdoiorg/1046/pm011015 Pulished Online Jnury 01 (http://wwwscirporg/journl/pm) Torsion in Groups of Integrl Tringles Will Murry Deprtment of Mthemtics nd Sttistics,

More information

A negative answer to a question of Wilke on varieties of!-languages

A negative answer to a question of Wilke on varieties of!-languages A negtive nswer to question of Wilke on vrieties of!-lnguges Jen-Eric Pin () Astrct. In recent pper, Wilke sked whether the oolen comintions of!-lnguges of the form! L, for L in given +-vriety of lnguges,

More information

Formal Languages and Automata

Formal Languages and Automata Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University

More information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information

Convert the NFA into DFA

Convert the NFA into DFA Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:

More information

Symbolic enumeration methods for unlabelled structures

Symbolic enumeration methods for unlabelled structures Go & Šjn, Comintoril Enumertion Notes 4 Symolic enumertion methods for unlelled structures Definition A comintoril clss is finite or denumerle set on which size function is defined, stisfying the following

More information

The Regulated and Riemann Integrals

The Regulated and Riemann Integrals Chpter 1 The Regulted nd Riemnn Integrls 1.1 Introduction We will consider severl different pproches to defining the definite integrl f(x) dx of function f(x). These definitions will ll ssign the sme vlue

More information

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS. THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS RADON ROSBOROUGH https://intuitiveexplntionscom/picrd-lindelof-theorem/ This document is proof of the existence-uniqueness theorem

More information

Frobenius numbers of generalized Fibonacci semigroups

Frobenius numbers of generalized Fibonacci semigroups Frobenius numbers of generlized Fiboncci semigroups Gretchen L. Mtthews 1 Deprtment of Mthemticl Sciences, Clemson University, Clemson, SC 29634-0975, USA gmtthe@clemson.edu Received:, Accepted:, Published:

More information

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.

Lecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations. Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one

More information

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3

I1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3 2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is

More information

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers.

8. Complex Numbers. We can combine the real numbers with this new imaginary number to form the complex numbers. 8. Complex Numers The rel numer system is dequte for solving mny mthemticl prolems. But it is necessry to extend the rel numer system to solve numer of importnt prolems. Complex numers do not chnge the

More information

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4

Intermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4 Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one

More information

Introduction to Group Theory

Introduction to Group Theory Introduction to Group Theory Let G be n rbitrry set of elements, typiclly denoted s, b, c,, tht is, let G = {, b, c, }. A binry opertion in G is rule tht ssocites with ech ordered pir (,b) of elements

More information

Bernoulli Numbers Jeff Morton

Bernoulli Numbers Jeff Morton Bernoulli Numbers Jeff Morton. We re interested in the opertor e t k d k t k, which is to sy k tk. Applying this to some function f E to get e t f d k k tk d k f f + d k k tk dk f, we note tht since f

More information

arxiv: v1 [math.ra] 1 Nov 2014

arxiv: v1 [math.ra] 1 Nov 2014 CLASSIFICATION OF COMPLEX CYCLIC LEIBNIZ ALGEBRAS DANIEL SCOFIELD AND S MCKAY SULLIVAN rxiv:14110170v1 [mthra] 1 Nov 2014 Abstrct Since Leibniz lgebrs were introduced by Lody s generliztion of Lie lgebrs,

More information

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014

CMPSCI 250: Introduction to Computation. Lecture #31: What DFA s Can and Can t Do David Mix Barrington 9 April 2014 CMPSCI 250: Introduction to Computtion Lecture #31: Wht DFA s Cn nd Cn t Do Dvid Mix Brrington 9 April 2014 Wht DFA s Cn nd Cn t Do Deterministic Finite Automt Forml Definition of DFA s Exmples of DFA

More information

Review: set theoretic definition of the numbers. Natural numbers:

Review: set theoretic definition of the numbers. Natural numbers: Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies

More information

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C.

u(t)dt + i a f(t)dt f(t) dt b f(t) dt (2) With this preliminary step in place, we are ready to define integration on a general curve in C. Lecture 4 Complex Integrtion MATH-GA 2451.001 Complex Vriles 1 Construction 1.1 Integrting complex function over curve in C A nturl wy to construct the integrl of complex function over curve in the complex

More information

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O

M A T H F A L L CORRECTION. Algebra I 2 1 / 0 9 / U N I V E R S I T Y O F T O R O N T O M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #1 CORRECTION Alger I 2 1 / 0 9 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O 1. Suppose nd re nonzero elements of field F. Using only the field xioms,

More information

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION

KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION Fixed Point Theory, 13(2012), No. 1, 285-291 http://www.mth.ubbcluj.ro/ nodecj/sfptcj.html KRASNOSEL SKII TYPE FIXED POINT THEOREM FOR NONLINEAR EXPANSION FULI WANG AND FENG WANG School of Mthemtics nd

More information

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.

1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true. York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech

More information

Three termination problems. Patrick Dehornoy. Laboratoire de Mathématiques Nicolas Oresme, Université de Caen

Three termination problems. Patrick Dehornoy. Laboratoire de Mathématiques Nicolas Oresme, Université de Caen Three termintion prolems Ptrick Dehornoy Lortoire de Mthémtiques Nicols Oresme, Université de Cen Three termintion prolems Ptrick Dehornoy Lortoire Preuves, Progrmmes, Systèmes Université Pris-Diderot

More information

Bridging the gap: GCSE AS Level

Bridging the gap: GCSE AS Level Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions

More information

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH

IN GAUSSIAN INTEGERS X 3 + Y 3 = Z 3 HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008), #A2 IN GAUSSIAN INTEGERS X + Y = Z HAS ONLY TRIVIAL SOLUTIONS A NEW APPROACH Elis Lmpkis Lmpropoulou (Term), Kiprissi, T.K: 24500,

More information

Christine Bessenrodt. Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 1, Hannover, Germany

Christine Bessenrodt. Fakultät für Mathematik und Physik, Leibniz Universität Hannover, Welfengarten 1, Hannover, Germany Séminire Lothringien de Comintoire 54A (2006), Article B54Ag ALGEBRA INVARIANTS FOR FINITE DIRECTED GRAPHS WITH RELATIONS Christine Bessenrodt Fkultät für Mthemtik und Physik, Leiniz Universität Hnnover,

More information

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn

More information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

308K. 1 Section 3.2. Zelaya Eufemia. 1. Example 1: Multiplication of Matrices: X Y Z R S R S X Y Z. By associativity we have to choices:

308K. 1 Section 3.2. Zelaya Eufemia. 1. Example 1: Multiplication of Matrices: X Y Z R S R S X Y Z. By associativity we have to choices: 8K Zely Eufemi Section 2 Exmple : Multipliction of Mtrices: X Y Z T c e d f 2 R S X Y Z 2 c e d f 2 R S 2 By ssocitivity we hve to choices: OR: X Y Z R S cr ds er fs X cy ez X dy fz 2 R S 2 Suggestion

More information

Chapter 6 Techniques of Integration

Chapter 6 Techniques of Integration MA Techniques of Integrtion Asst.Prof.Dr.Suprnee Liswdi Chpter 6 Techniques of Integrtion Recll: Some importnt integrls tht we hve lernt so fr. Tle of Integrls n+ n d = + C n + e d = e + C ( n ) d = ln

More information

Section 6.1 INTRO to LAPLACE TRANSFORMS

Section 6.1 INTRO to LAPLACE TRANSFORMS Section 6. INTRO to LAPLACE TRANSFORMS Key terms: Improper Integrl; diverge, converge A A f(t)dt lim f(t)dt Piecewise Continuous Function; jump discontinuity Function of Exponentil Order Lplce Trnsform

More information

N 0 completions on partial matrices

N 0 completions on partial matrices N 0 completions on prtil mtrices C. Jordán C. Mendes Arújo Jun R. Torregros Instituto de Mtemátic Multidisciplinr / Centro de Mtemátic Universidd Politécnic de Vlenci / Universidde do Minho Cmino de Ver

More information

Linear Systems with Constant Coefficients

Linear Systems with Constant Coefficients Liner Systems with Constnt Coefficients 4-3-05 Here is system of n differentil equtions in n unknowns: x x + + n x n, x x + + n x n, x n n x + + nn x n This is constnt coefficient liner homogeneous system

More information

Lecture 09: Myhill-Nerode Theorem

Lecture 09: Myhill-Nerode Theorem CS 373: Theory of Computtion Mdhusudn Prthsrthy Lecture 09: Myhill-Nerode Theorem 16 Ferury 2010 In this lecture, we will see tht every lnguge hs unique miniml DFA We will see this fct from two perspectives

More information

MTH 505: Number Theory Spring 2017

MTH 505: Number Theory Spring 2017 MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c

More information

7.2 The Definite Integral

7.2 The Definite Integral 7.2 The Definite Integrl the definite integrl In the previous section, it ws found tht if function f is continuous nd nonnegtive, then the re under the grph of f on [, b] is given by F (b) F (), where

More information

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer

(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.

More information

The practical version

The practical version Roerto s Notes on Integrl Clculus Chpter 4: Definite integrls nd the FTC Section 7 The Fundmentl Theorem of Clculus: The prcticl version Wht you need to know lredy: The theoreticl version of the FTC. Wht

More information

Hamiltonian Cycle in Complete Multipartite Graphs

Hamiltonian Cycle in Complete Multipartite Graphs Annls of Pure nd Applied Mthemtics Vol 13, No 2, 2017, 223-228 ISSN: 2279-087X (P), 2279-0888(online) Pulished on 18 April 2017 wwwreserchmthsciorg DOI: http://dxdoiorg/1022457/pmv13n28 Annls of Hmiltonin

More information

Rudimentary Matrix Algebra

Rudimentary Matrix Algebra Rudimentry Mtrix Alger Mrk Sullivn Decemer 4, 217 i Contents 1 Preliminries 1 1.1 Why does this document exist?.................... 1 1.2 Why does nyone cre out mtrices?................ 1 1.3 Wht is mtrix?...........................

More information

20 MATHEMATICS POLYNOMIALS

20 MATHEMATICS POLYNOMIALS 0 MATHEMATICS POLYNOMIALS.1 Introduction In Clss IX, you hve studied polynomils in one vrible nd their degrees. Recll tht if p(x) is polynomil in x, the highest power of x in p(x) is clled the degree of

More information

Quadratic Forms. Quadratic Forms

Quadratic Forms. Quadratic Forms Qudrtic Forms Recll the Simon & Blume excerpt from n erlier lecture which sid tht the min tsk of clculus is to pproximte nonliner functions with liner functions. It s ctully more ccurte to sy tht we pproximte

More information

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages

Grammar. Languages. Content 5/10/16. Automata and Languages. Regular Languages. Regular Languages 5//6 Grmmr Automt nd Lnguges Regulr Grmmr Context-free Grmmr Context-sensitive Grmmr Prof. Mohmed Hmd Softwre Engineering L. The University of Aizu Jpn Regulr Lnguges Context Free Lnguges Context Sensitive

More information

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω.

dx dt dy = G(t, x, y), dt where the functions are defined on I Ω, and are locally Lipschitz w.r.t. variable (x, y) Ω. Chpter 8 Stility theory We discuss properties of solutions of first order two dimensionl system, nd stility theory for specil clss of liner systems. We denote the independent vrile y t in plce of x, nd

More information

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30

Talen en Automaten Test 1, Mon 7 th Dec, h45 17h30 Tlen en Automten Test 1, Mon 7 th Dec, 2015 15h45 17h30 This test consists of four exercises over 5 pges. Explin your pproch, nd write your nswer to ech exercise on seprte pge. You cn score mximum of 100

More information

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004

Advanced Calculus: MATH 410 Notes on Integrals and Integrability Professor David Levermore 17 October 2004 Advnced Clculus: MATH 410 Notes on Integrls nd Integrbility Professor Dvid Levermore 17 October 2004 1. Definite Integrls In this section we revisit the definite integrl tht you were introduced to when

More information

Sturm-Liouville Theory

Sturm-Liouville Theory LECTURE 1 Sturm-Liouville Theory In the two preceing lectures I emonstrte the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series re just the tip of the iceerg of the theory

More information

2. VECTORS AND MATRICES IN 3 DIMENSIONS

2. VECTORS AND MATRICES IN 3 DIMENSIONS 2 VECTORS AND MATRICES IN 3 DIMENSIONS 21 Extending the Theory of 2-dimensionl Vectors x A point in 3-dimensionl spce cn e represented y column vector of the form y z z-xis y-xis z x y x-xis Most of the

More information

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p

THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS. Circa 1870, G. Zolotarev observed that the Legendre symbol ( a p THE QUADRATIC RECIPROCITY LAW OF DUKE-HOPKINS PETE L CLARK Circ 1870, Zolotrev observed tht the Legendre symbol ( p ) cn be interpreted s the sign of multipliction by viewed s permuttion of the set Z/pZ

More information

5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9.

5. (±±) Λ = fw j w is string of even lengthg [ 00 = f11,00g 7. (11 [ 00)± Λ = fw j w egins with either 11 or 00g 8. (0 [ ffl)1 Λ = 01 Λ [ 1 Λ 9. Regulr Expressions, Pumping Lemm, Right Liner Grmmrs Ling 106 Mrch 25, 2002 1 Regulr Expressions A regulr expression descries or genertes lnguge: it is kind of shorthnd for listing the memers of lnguge.

More information

New Expansion and Infinite Series

New Expansion and Infinite Series Interntionl Mthemticl Forum, Vol. 9, 204, no. 22, 06-073 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.2988/imf.204.4502 New Expnsion nd Infinite Series Diyun Zhng College of Computer Nnjing University

More information

AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir

AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS. I. Fedotov and S. S. Dragomir RGMIA Reserch Report Collection, Vol., No., 999 http://sci.vu.edu.u/ rgmi AN INEQUALITY OF OSTROWSKI TYPE AND ITS APPLICATIONS FOR SIMPSON S RULE AND SPECIAL MEANS I. Fedotov nd S. S. Drgomir Astrct. An

More information

7. Indefinite Integrals

7. Indefinite Integrals 7. Indefinite Integrls These lecture notes present my interprettion of Ruth Lwrence s lecture notes (in Herew) 7. Prolem sttement By the fundmentl theorem of clculus, to clculte n integrl we need to find

More information

Computing with finite semigroups: part I

Computing with finite semigroups: part I Computing with finite semigroups: prt I J. D. Mitchell School of Mthemtics nd Sttistics, University of St Andrews Novemer 20th, 2015 J. D. Mitchell (St Andrews) Novemer 20th, 2015 1 / 34 Wht is this tlk

More information

Lecture 08: Feb. 08, 2019

Lecture 08: Feb. 08, 2019 4CS4-6:Theory of Computtion(Closure on Reg. Lngs., regex to NDFA, DFA to regex) Prof. K.R. Chowdhry Lecture 08: Fe. 08, 2019 : Professor of CS Disclimer: These notes hve not een sujected to the usul scrutiny

More information

WENJUN LIU AND QUÔ C ANH NGÔ

WENJUN LIU AND QUÔ C ANH NGÔ AN OSTROWSKI-GRÜSS TYPE INEQUALITY ON TIME SCALES WENJUN LIU AND QUÔ C ANH NGÔ Astrct. In this pper we derive new inequlity of Ostrowski-Grüss type on time scles nd thus unify corresponding continuous

More information

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24

Matrix Algebra. Matrix Addition, Scalar Multiplication and Transposition. Linear Algebra I 24 Mtrix lger Mtrix ddition, Sclr Multipliction nd rnsposition Mtrix lger Section.. Mtrix ddition, Sclr Multipliction nd rnsposition rectngulr rry of numers is clled mtrix ( the plurl is mtrices ) nd the

More information

Harvard University Computer Science 121 Midterm October 23, 2012

Harvard University Computer Science 121 Midterm October 23, 2012 Hrvrd University Computer Science 121 Midterm Octoer 23, 2012 This is closed-ook exmintion. You my use ny result from lecture, Sipser, prolem sets, or section, s long s you quote it clerly. The lphet is

More information

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.)

MORE FUNCTION GRAPHING; OPTIMIZATION. (Last edited October 28, 2013 at 11:09pm.) MORE FUNCTION GRAPHING; OPTIMIZATION FRI, OCT 25, 203 (Lst edited October 28, 203 t :09pm.) Exercise. Let n be n rbitrry positive integer. Give n exmple of function with exctly n verticl symptotes. Give

More information

Integral points on the rational curve

Integral points on the rational curve Integrl points on the rtionl curve y x bx c x ;, b, c integers. Konstntine Zeltor Mthemtics University of Wisconsin - Mrinette 750 W. Byshore Street Mrinette, WI 5443-453 Also: Konstntine Zeltor P.O. Box

More information

arxiv: v1 [math.co] 1 Feb 2017

arxiv: v1 [math.co] 1 Feb 2017 OPERADS OF DECORATED CLIQUES SAMUELE GIRAUDO rxiv:7.7v [mth.co] Feb 7 ABSTRACT. The vector spce of ll polygons with configurtions of digonls is endowed with n operd structure. This is the consequence of

More information

INEQUALITIES FOR TWO SPECIFIC CLASSES OF FUNCTIONS USING CHEBYSHEV FUNCTIONAL. Mohammad Masjed-Jamei

INEQUALITIES FOR TWO SPECIFIC CLASSES OF FUNCTIONS USING CHEBYSHEV FUNCTIONAL. Mohammad Masjed-Jamei Fculty of Sciences nd Mthemtics University of Niš Seri Aville t: http://www.pmf.ni.c.rs/filomt Filomt 25:4 20) 53 63 DOI: 0.2298/FIL0453M INEQUALITIES FOR TWO SPECIFIC CLASSES OF FUNCTIONS USING CHEBYSHEV

More information

Simple Gamma Rings With Involutions.

Simple Gamma Rings With Involutions. IOSR Journl of Mthemtics (IOSR-JM) ISSN: 2278-5728. Volume 4, Issue (Nov. - Dec. 2012), PP 40-48 Simple Gmm Rings With Involutions. 1 A.C. Pul nd 2 Md. Sbur Uddin 1 Deprtment of Mthemtics University of

More information

Decomposition of terms in Lucas sequences

Decomposition of terms in Lucas sequences Journl of Logic & Anlysis 1:4 009 1 3 ISSN 1759-9008 1 Decomposition of terms in Lucs sequences ABDELMADJID BOUDAOUD Let P, Q be non-zero integers such tht D = P 4Q is different from zero. The sequences

More information

Designing finite automata II

Designing finite automata II Designing finite utomt II Prolem: Design DFA A such tht L(A) consists of ll strings of nd which re of length 3n, for n = 0, 1, 2, (1) Determine wht to rememer out the input string Assign stte to ech of

More information

The maximal number of runs in standard Sturmian words

The maximal number of runs in standard Sturmian words The miml numer of runs in stndrd Sturmin words Pwe l Bturo Mrcin Piątkowski Wojciech Rytter Fculty of Mthemtics nd Computer Science Nicolus Copernicus University Institute of Informtics Wrsw University

More information

Handout: Natural deduction for first order logic

Handout: Natural deduction for first order logic MATH 457 Introduction to Mthemticl Logic Spring 2016 Dr Json Rute Hndout: Nturl deduction for first order logic We will extend our nturl deduction rules for sententil logic to first order logic These notes

More information

Linearly Similar Polynomials

Linearly Similar Polynomials Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd

More information

Lecture 2: Fields, Formally

Lecture 2: Fields, Formally Mth 08 Lecture 2: Fields, Formlly Professor: Pdric Brtlett Week UCSB 203 In our first lecture, we studied R, the rel numbers. In prticulr, we exmined how the rel numbers intercted with the opertions of

More information

QUADRATURE is an old-fashioned word that refers to

QUADRATURE is an old-fashioned word that refers to World Acdemy of Science Engineering nd Technology Interntionl Journl of Mthemticl nd Computtionl Sciences Vol:5 No:7 011 A New Qudrture Rule Derived from Spline Interpoltion with Error Anlysis Hdi Tghvfrd

More information

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system.

Here we study square linear systems and properties of their coefficient matrices as they relate to the solution set of the linear system. Section 24 Nonsingulr Liner Systems Here we study squre liner systems nd properties of their coefficient mtrices s they relte to the solution set of the liner system Let A be n n Then we know from previous

More information

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras

Intuitionistic Fuzzy Lattices and Intuitionistic Fuzzy Boolean Algebras Intuitionistic Fuzzy Lttices nd Intuitionistic Fuzzy oolen Algebrs.K. Tripthy #1, M.K. Stpthy *2 nd P.K.Choudhury ##3 # School of Computing Science nd Engineering VIT University Vellore-632014, TN, Indi

More information

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique? XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=

More information

MATH 573 FINAL EXAM. May 30, 2007

MATH 573 FINAL EXAM. May 30, 2007 MATH 573 FINAL EXAM My 30, 007 NAME: Solutions 1. This exm is due Wednesdy, June 6 efore the 1:30 pm. After 1:30 pm I will NOT ccept the exm.. This exm hs 1 pges including this cover. There re 10 prolems.

More information

Quasiperiodic Sturmian words and morphisms

Quasiperiodic Sturmian words and morphisms Qusiperiodic Sturmin words nd morphisms Florence Levé, Gwenël Richomme To cite this version: Florence Levé, Gwenël Richomme. Qusiperiodic Sturmin words nd morphisms. Theoreticl Computer Science, Elsevier,

More information

Linear Inequalities. Work Sheet 1

Linear Inequalities. Work Sheet 1 Work Sheet 1 Liner Inequlities Rent--Hep, cr rentl compny,chrges $ 15 per week plus $ 0.0 per mile to rent one of their crs. Suppose you re limited y how much money you cn spend for the week : You cn spend

More information

Lecture Solution of a System of Linear Equation

Lecture Solution of a System of Linear Equation ChE Lecture Notes, Dept. of Chemicl Engineering, Univ. of TN, Knoville - D. Keffer, 5/9/98 (updted /) Lecture 8- - Solution of System of Liner Eqution 8. Why is it importnt to e le to solve system of liner

More information

2.4 Linear Inequalities and Interval Notation

2.4 Linear Inequalities and Interval Notation .4 Liner Inequlities nd Intervl Nottion We wnt to solve equtions tht hve n inequlity symol insted of n equl sign. There re four inequlity symols tht we will look t: Less thn , Less thn or

More information

Formal Languages and Automata Theory. D. Goswami and K. V. Krishna

Formal Languages and Automata Theory. D. Goswami and K. V. Krishna Forml Lnguges nd Automt Theory D. Goswmi nd K. V. Krishn Novemer 5, 2010 Contents 1 Mthemticl Preliminries 3 2 Forml Lnguges 4 2.1 Strings............................... 5 2.2 Lnguges.............................

More information

Nondeterminism and Nodeterministic Automata

Nondeterminism and Nodeterministic Automata Nondeterminism nd Nodeterministic Automt 61 Nondeterminism nd Nondeterministic Automt The computtionl mchine models tht we lerned in the clss re deterministic in the sense tht the next move is uniquely

More information