PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES
|
|
- Mervyn Hart
- 5 years ago
- Views:
Transcription
1 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES MATT SZCZESNY Abstract. The incidence category C F of a family F of colored posets closed under disjoint unions and the operation of taking convex sub-posets was introduced by the author in [], where the Ringel-Hall algebra H F of C F was also defined. We show that if the Hasse diagrams underlying F are rooted trees, then the subspace n F of primitive elements of H F carries a pre-lie structure, defined over Z, and with positive structure constants. We give several examples of n F, including the nilpotent subalgebras of sl n, Lgl n, and several others.. Introduction A left pre-lie algebra is a k vector space A endowed with a binary bilinear operation satisfying the identity (.) (a b) c a (b c) = (b a) c b (a c) It follows easily from. that anti-symmetrizing yields a Lie bracket [a, b] = a b b a on A. However, not every Lie algebra arises from a pre-lie algebra. Pre-Lie algebras first appeared in the works of E.B. Vinberg [3] and M. Gerstenhaber [3], and have since found applications in several areas. One prominent example is perturbative quantum field theory [4], where insertion of Feynman graphs into each other equips them with a pre-lie structure which controls the combinatorics of the renormalization procedure. In this paper, we show that pre-lie algebras arise naturally from incidence categories introduced by that author in []. An incidence category is built from a collection F of colored posets, which is closed under the operations of disjoint union and convex subposet - we will denote it by C F. The objects of C F are the posets in F, and for P, P F Hom(P, P ) := {(I, I, f) I j is an order ideal in P j, f : P \I I an isomorphism } Here, the poset I should be viewed as the kernel of the morphism, and I as the image. All morphisms in C F have kernels and cokernels, and so the notion of exact sequence makes sense. In [], the Ringel-Hall algebra H CF of C F was defined. The author is supported by an NSA grant.
2 MATT SZCZESNY H CF is the Q vector space of finitely supported functions on isomorphism classes of C F : H CF := {f : Iso(C F ) Q supp(f) < } with product given by convolution: (.) f g(m) = A M f(a)g(m/a). H CF possesses a co-commutative co-product given by (.3) (f)(m, N) = f(m N) (where M N denotes the disjoint union of M and N) as well as an antipode, making it a Hopf algebra. H CF is graded, connected, and co-commutative, and so by the Milnor-Moore theorem isomorphic to U(n F ), where n F is the Lie algebra of its primitive elements. It follows from.3 that n F = span{δ P P F, P connected } We show that if F consists of posets whose Hasse diagrams are rooted trees, then n F carries a pre-lie structure, with δ P δ P := δ P δ P δ P P. A more concrete description of is the following: δ P δ P is a sum of deltafunctions supported on connected posets P F whose Hasse diagram is obtained by grafting the root of P onto a vertex of P. It follows from the definition of that the structure constants are non-negative integers. The paper is organized as follows. Section recalls the definition of pre-lie algebra and introduces the universal example, namely the pre-lie algebra of colored rooted trees. In section 3 we recall the construction of the incidence category C F as well as its main properties. The Ringel-Hall algebra of C F is introduced in section 4. In section 5 we define the pre-lie structure on n F and verify that it satisfies the identity.. Finally, section 6 is devoted to examples - among these are pre-lie structures on nilpotent Lie subalgebras of sl n and Lgl n. Acknowledgements: The author is very grateful to Pavel Etingof for valuable discussions and suggestions.. Pre-Lie algebras In this section, we recall the definition and some examples of (left) pre-lie algebras. Let k be a field. Definition. A left pre-lie algebra is a k vector space A endowed with a binary bilinear operation satisfying the left pre-lie identity (.) (a b) c a (b c) = (b a) c b (a c) for a, b, c A.
3 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 3 One checks easily that antisymmetrizing the operation gives A the structure of a Lie algebra. [a, b] = a b b a Example. Any associative k algebra A is a pre-lie algebra with the pre-lie structure given by a b := ab, where the right hand side refers to the associative multiplication in A. Example. One of the most important examples of pre-lie algebras is given by colored rooted trees. Recall that a tree is a graph with no cycles. We denote by E(t), V (t) the edge and vertex sets of t respectively. Let S be a finite set. By a rooted tree colored by S we mean a tree with a distinguished vertex r(t) V (t) called the root, and an assignment of an element of S to each v V (t). We adopt the convention that rooted trees are always drawn with the root on top. For example, if S = {a, b}, then the following are rooted trees colored by S: a b a a b b b b a a b b a Let T S denote the set of rooted trees whose vertices are colored by S. Given t T S, and e E(t), removing e disconnects t into two colored rooted trees: R e (t) containing r(t) and P e (t), whose root is the end of e. Let T S be the k vector space spanned by T S. We have T S = n=0 T S[n] where T S [n] is the subspace of T S spanned by trees with n vertices. For colored rooted trees t, t T S, let t t := s T S n(t, t, s)s where For example, we have n(t, t, s) = #{e E(s) P e (s) = t, R e (s) = t }. b a b = a b + ab b b It is well-known (see for instance []) that defines a pre-lie structure on T S. The following theorem is proven in [] Theorem. T S is the free pre-lie algebra on S generators. Remark. In what follows, unless stated otherwise, k = Q.
4 4 MATT SZCZESNY 3. Incidence categories 3.. Recollections on posets. We begin by recalling some basic notions and terminology pertaining to posets ( partially ordered sets) following [0, ]. () An interval is a poset having unique minimal and maximal elements. For x, y in a poset P, we denote by [x, y] the interval [x, y] := {z P : x z y} If P is an interval, we will often denote by 0 P and P the minimal and maximal elements. () An order ideal in a poset P is a subset L P such that whenever y L and x y in P, then x L. (3) A sub-poset Q of P is convex if, whenever x y in Q and z P satisfies x z y, then z Q. Equivalently, Q is convex if Q = L\I for order ideals I L in P. (4) Given two posets P, P, their disjoint union is naturally a poset, which we denote by P +P. In P +P, x y if both lie in either P or P, and x y there. (5) A poset which is not the union of two non-empty posets is said to be connected. (6) The cartesian product P P is a poset where (x, y) (x, y ) iff x x and y y. (7) A distributive lattice is a poset P equipped with two operations, that satisfy the following properties: (a), are commutative and associative (b), are idempotent - i.e. x x = x, x x = x (c) x (x y) = x = x (x y) (d) x y = x x y = y x y (e) x (y z) = (x y) (x z) (f) x (y z) = (x y) (x z) (8) For a poset P, denote by J P the poset of order ideals of P, ordered by inclusion. J P forms a distributive lattice with I I := I I and I I := I I for I, I J P. If P, P are posets, we have J P +P = J P J P, and if I, L J P, and I L, then [I, L] is naturally isomorphic to the lattice of order ideals J L\I. Remark. Suppose that the Hasse diagram of a poset P is a rooted tree - that is, P has a unique maximal element r(p), and the Hasse diagram contains no cycles. It is then easy to see that order ideals I P correspond to admissible cuts of P, where the latter is a collection of edges C E(P), having the property that at most one edge of C is encountered along any path from root to leaf. For
5 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 5 instance, the dotted edges of the poset T below yield an admissible cut: b b a b Each admissible cut C E(P) divides the tree into a rooted connected tree R C (P) containing r(p), and a rooted forest (a disjoint union of rooted trees) P C (P). The notation is clearly an extension of that used in example. In the last example, we have R C (T) = b P C (T) = b b a 3.. From posets to categories. Let F be a family of colored posets which is closed under the formation of disjoint unions and the operation of taking convex subposets, and let P(F) = {J P : P F} be the corresponding family of distributive lattices of order ideals. For each pair P, P F, let M(P, P ) denote the set of colored poset isomorphisms P P. It follows that M(P, P) forms a group, which we denote Aut M (P) The category C F. We proceed to define a category C F, called the incidence category of F as follows. Let Ob(C F ) := F = {P F} and Hom(P, P ) := {(I, I, f) : I i J Pi, f M(P \I, I )} i =, We need to define the composition of morphisms Hom(P, P ) Hom(P, P 3 ) Hom(P, P 3 ) Suppose that (I, I, f) Hom(P, P ) and (I, I 3, g) Hom(P, P 3 ). Their composition is the morphism (K, K 3, h) defined as follows. We have I I I, and since f : P \I I is an isomorphism, f (I I ) is an order ideal of P \I. Since in J P, [I, P] J P \I, we have that f (I I ) corresponds to an order ideal K J P such that I K. We have I I I, and since [I, P ] J P \I, I I corresponds to an order ideal L J P \I. Since g : P \I I 3 is an isomorphism, g(l ) J I 3, and since J I 3 J P3, g(l ) corresponds to an order ideal K 3 J P3 contained in I 3. The isomorphism f : P \I I restricts to an isomorphism f : P \K I \I I = I \I, and the isomorphism g : P \I restricts to an isomorphism ḡ : I I \I = I \I K 3. Thus, g f : P \K K 3 is an isomorphism and g f M(P \K, K 3 ) by the property (4) above.
6 6 MATT SZCZESNY As shown in [], the composition of morphisms is associative. Remark 3. We refer to I as the image of the morphism (I, I, f) : P P. We denote by Iso(C F ) the collection of isomorphism classes of objects in C F, and by [P] the isomorphism class of P C F Properties of the categories C F. We now enumerate some of the properties of the categories C F. () The empty poset is an initial, terminal, and therefore null object. We will sometimes denote it by. () We can equip C F with a symmetric monoidal structure by defining P P := P + P. (3) The indecomposable objects of C F are the P with P a connected poset in F. (4) The simple objects of C F are the P where P is a one-element poset. (5) Every morphism (3.) (I, I, f) : P P has a kernel (, I, id) : I P (6) Similarly, every morphism 3. possesses a cokernel (I, P \I, id) : P P \I We will use the notation P /P for coker((i, I, f)). Note: Properties 5 and 6 imply that the notion of exact sequence makes sense in C F. (7) All monomorphisms are of the form (, I, f) : Q P where I J P, and f : Q I M(Q, I). Monomorphisms Q P with a fixed image I form a torsor over Aut M (I). All epimorphisms are of the form (I,, g) : P Q
7 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 7 where I J P and g : P \I Q M(P \I, Q). Epimorphisms with fixed kernel I form a torsor over Aut M (P \I) (8) Sequences of the form (3.) (,,id) I (,I,id) P (I,,id) (P \I,,id) P \I with I J P are short exact, and all other short exact sequences with P in the middle arise by composing with isomorphisms I I and P \I Q on the left and right. (9) Given an object P and a subobject I, I J P, the isomorphism J P \I [I, P] translates into the statement that there is a bijection between subobjects of P/I and order ideals J J P such that I J P. The bijection is compatible with quotients, in the sense that (P/I)/(J/I) J/I. (0) Since the posets in F are finite, Hom(P, P ) is a finite set. () We may define Yoneda Ext n (P, P ) as the equivalence class of n step exact sequences with P, P on the right and left respectively. Ext n (P, P ) is a finite set. Concatenation of exact sequences makes into a monoid. Ext := A,B I(CF ),n Ext n (A, B) () We may define the Grothendieck group of C F, K 0 (C F ), as K(C F ) = A C F Z[A]/ where is generated by A + B C for short exact sequences A C B We denote by k(a) the class of an object in K 0 (C F ). 4. Ringel-Hall algebras For an introduction to Ringel-Hall algebras in the context of abelian categories, see [8]. We define the Ringel-Hall algebra of C F, denoted H CF, to be the Q vector space of finitely supported functions on isomorphism classes of C F. I.e. H CF := {f : Iso(C F ) Q supp(f) < } As a Q vector space it is spanned by the delta functions δ A, A Iso(C F ). The algebra structure on H CF is given by the convolution product: (4.) f g(m) = A M f(a)g(m/a)
8 8 MATT SZCZESNY for M Iso(C F ). In what follows, it will be conceptually useful to choose a representative in each isomorphism class. For M, N, Q Iso(C F ), let F Q M,N be the number of exact sequences M i Q π N where (i, π) and (i, π ) are considered equivalent iff i = i and π = π (this makes sense, since we have fixed a representative in each isomorphism class). It follows from the definition 4. that δ M δ N = Q Iso(C F ) F Q M,N Aut(M) Aut(N) δ Q, from which it is apparent that H CF encodes the structure of extensions in C F. H CF possesses a co-commutative co-product given by (4.) (f)(m, N) = f(m N) as well as a natural K + 0 (C F ) grading in which δ A has degree k(a) K + 0 (C F ). If F is colored by the set S, it is easy to see that K + 0 (C F) N S. The subobjects of P C F are exactly I J P, and the product 4. becomes f g([p]) = I J P f([i])g([p \I]). It is shown in [8] that the product is associative, the co-product co-associative and co-commutative, and that the two are compatible, making H CF into a cocommutative bialgebra. Recall that a bialgebra A over a field k is connected if it possesses a Z 0 grading such that A 0 = k. In addition to the K 0 + (C F ) grading, H CF possesses a grading by the order of the poset - i.e. we may assign deg(δ P ) = P. This gives it the structure of graded connected bialgebra, and hence Hopf algebra. The Milnor-Moore theorem implies that H CF is the enveloping algebra of the Lie algebra of its primitive elements, which we denote by n F - i.e. H CF U(n F ). It follows from 4. that f n F is primitive if it is supported on the isomorphism classes of connected posets. Thus, we have that n F = span{δ P P F, P connected } We will use the notation F conn F to denote the sub-collection of F consisting of connected posets. We have thus established the following: Theorem. The Ringel-Hall algebra of the category C F is a co-commutative graded connected Hopf algebra, isomorphic to U(n F ), where n F denotes the graded Lie algebra of its primitive elements. n F = span{δ P P F conn }. Remark 4. H CF is a special case of an incidence Hopf algebra introduced by Schmitt in [0, 9].
9 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 9 5. A Pre-Lie structure on n F We assume now that the collection F consists of colored posets whose underlying Hasse diagrams are rooted trees. Recall that F was assumed to be: closed under the operation of taking convex sub-posets closed under disjoint unions It is immediate that to produce an F satisfying these two requirements, one may start with an arbitrary collection F of colored posets, and close it with respect to each operation - i.e. adjoin to F all convex sub-posets and all disjoint unions of these. If F arises in this way as the closure of F, we will write F = F. Example 3. Suppose that F consists of a single poset, whose Hasse diagram is an n vertex ladder colored by the set S = {,, n}. 3 n n Let us adopt the notation L(a, a,..., a k ) for a k vertex ladder Hasse diagram labeled by a, a,..., a k root-to-leaf (F thus consisting of L(,,, n)). To close F with respect to convex subsets, we must adjoin to it L(r, r+, r+,, r+m), where r r + m n.... n,... n,... n n 3 n n 3 n n Finally, closing with respect to disjoint unions, we can identify elements of F = F with Young diagrams having at most n rows, each of whose columns is labeled by k, k +,, k + m. For instance
10 0 MATT SZCZESNY is identified with the poset L(, 3, 4, 5) + L(,, 3) + L(3) + L(4). We proceed to equip n F with a pre-lie structure. For a, b F conn, we define (5.) δ a δ b = δ a δ b δ a b and extend the product to all of n F by linearity. The subtraction of the term δ a b in 5. has the effect of removing the delta-function supported on the one split extension of b by a, and so the right-hand side of 5. does indeed lie in n F. It follows easily that we may re-write the definition 5. as: (5.) δ a δ b = t F n(a, b, t)δ t where n(a, b, t) is defined as in example. Theorem 3. Let F be a collection of colored posets closed with respect to taking convex sub-posets and disjoint unions. If the Hasse diagrams of posets in F are rooted trees, then equips n F with the structure of a pre-lie algebra. Proof. A two-sided pre-lie ideal in a pre-lie algebra A is a subspace I A such that if x I, then a x I and x a I a A. One checks easily that the quotient A/I inherits a pre-lie structure. Let F be a collection of colored rooted forests colored by S, closed under the operations of disjoint union and convex sub-poset, and F conn F the connected ones (i.e. the rooted trees). F conn is closed under taking convex sub-posets. I claim that J = T S \F conn is a two-sided pre-lie ideal in T S. Let u T S and s J. We have δ u δ s = t T S n(u, s, t)δ t Suppose that n(u, s, t) 0 and t T S \J = F conn. t has an edge e such that P e (t) = u and R e (t) = s, and since both are convex sub-posets of the poset t F conn, u, s F conn, contradicting the fact that s J. It follows that δ u δ s J. The same argument shows that δ s δ u J. The quotient T S /J is canonically identified with n F with the bracket 5.. We give a second proof, very close to the one for F = T S given in []. Proof. We need to verify the identity.. It follows from 5. that for a, b, c F conn,
11 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES (δ a δ b ) δ c = ( n(a, b, t)t) c t F conn = n(a, b, t)n(t, c, s)s s,t F conn and δ a (δ b δ c ) = a ( n(b, c, t)t) s,t F conn t F conn = n(b, c, t)n(a, t, s)s s,t F conn Because F is closed under taking convex sub-posets, P e (t) F conn and R e (t) F conn, t F conn. The sum t F conn n(a, b, t)n(t, c, s) may be identified with the number of pairs of edges π = {e, e } E(s), such that the resulting cut is NOT admissible (i.e. both edges lie along a single path from root to leaf in s), and the three connected components when π is removed, are, top-to-bottom, c, b and a. Similarly, the sum t F conn n(b, c, t)n(a, t, s) may identified with the number of pairs π = {e, e } E(s) such that the corresponding cut of s results in three components a, b, c, with r(s) c, and no element of a greater than an element of b. The coefficient of δ s in δ a (δ b δ c ) (δ a δ b ) δ c therefore counts the number of admissible two-edge cuts of s such that the connected component containing r(s) is isomorphic to c, and the remaining two to a, b respectively. Applying the same analysis to the right-hand-side of. proves the equality. Remark 5. It follows from 5. that n F is defined over Z, and that the structure constants are non-negative. 6. Examples In this section, we consider different examples of families F, and the resulting pre-lie algebras n F. Recall that since n F is graded by N, the Lie algebra n F is pro-nilpotent (nilpotent if n F is finite-dimensional). Example 4. Let S be a finite set, and F = T S, the set of rooted forests colored by S. We then obtain the pre-lie algebra structure on S labeled rooted trees described in example.
12 MATT SZCZESNY Example 5. Suppose S consists of a single element, and let F = F, where F is the collection of all ladders: (since there is only one color, we suppress the labeling). Denote by L n the n- vertex ladder. We have δ Ln δ Lm = δ Lm+n. so the Lie algebra n F is abelian. In the Ringel-Hall algebra H CF δ Ln δ Lm = δ Lm+n + δ Lm L n we have and (L m ) = L m + L m It is well-known (see eg. [6]) that the Hopf algebra H CF is isomorphic to the Hopf algebra of symmetric functions, with L m corresponding to the mth power sum. Example 6. Let S = {,,, n}, and let F = F, where F consists of singleton vertices colored by S. F is thus the collection of all finite sets colored by S, with trivial partial order. Denote by X(m, m,, m n ) the set of m + m + + m n elements, with m i colored i, i n. n F is therefore spanned by the δ X(0,,i,,0). The operation is identically 0, so the Lie algebra n F is abelian. In H CF we have ( n ( ) ) mi + m i δ X(m,,m n) δ X(m,,m n) = δ (m+m,,mn+m n) i Example 7. Let S = {,,, n}, and let F = F, where F consists of all S colored ladder trees 3 m i
13 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 3 Denote by L(a,, a k ) the k-vertex ladder whose ith vertex counting from the leaf is colored a i. We have (6.) δ L(a,,a n) δ L(b,,b m) = δ L(a,,a n,b,,b m) Let Q < X,, X s > denote the free associative algebra on S viewed as a Lie algebra. There is a linear isomorphism ρ : n F Q < X,, X s > ρ(l(a,, a k )) = X a X a X ak It follows from 6. that ρ is a Lie algebra isomorphism. Example 8. Consider the collection F from example 3, where F = L(,,, n). Here n F = span{δ L(k,,k+m) }, k k + m n. We have { δ L(p,,p+r) δ L(k,,k+m) = δl(k,,p+r) if k + m + = p 0 otherwise so that in the Lie algebra n F, { (6.) [δ L(p,,p+r), δ L(k,,k+m) ] = δl(k,,p+r) if k + m + = p 0 otherwise Let E i,j denote the (n + ) (n + ) matrix with a in entry (i, j) and zeros everywhere else. Then the commutation relations 6. imply that the map φ : n F Mat n+ φ(δ L(k,,k+m) ) = E k,k+m+ is an isomorphism of n F onto the Lie algebra of upper-triangular (n+) (n+) matrices. Example 9. Let S = {, }, and let F = F, where F consists of all S colored ladders where the colors alternate., Let us denote by L(i, n), i S, n the alternating ladder with n vertices, whose root is colored i. Then n F = span{l(i, n)}, i S, n. We have { δl(i,n+m) if m 0 mod, i S δ L(i,n) δ L(i,m) = 0 otherwise { δl(j,n+m) if m mod, i j S δ L(i,n) δ L(j,m) = 0 otherwise
14 4 MATT SZCZESNY It follows that (6.3) [δ L(i,k), δ L(j,l) ] = 0 { δl(j,(k+l)+) if i = j [δ L(i,k), δ L(j,l+) ] = if i j δ L(j,(k+l)+) [δ L(i,k+), δ L(j,l+) ] = δ L(j,(k+l+)) δ L(i,(k+l+)) Recall that gl = Mat = n h n +, where n = span{f}, n + = span{e}, h = span{h, h } and f = ( ) h = ( ) h = ( ) e = ( ) Let Lgl = gl Q[t, t ] be the loop algebra of gl, with bracket [X t m, Y t n ] = [X, Y ] t n+m Lgl also has a triangular decomposition Lgl = Lgl + h Lgl, where Lgl + = n + gl tq[t] Lgl = n gl t Q[t ] Let φ : n F Lgl + φ(δ L(,k+) ) = e t k φ(δ L(,k+) ) = f t k+ φ(δ L(,k) ) = h t k φ(δ L(,k) ) = h t k It follows from 6.3 that φ is an isomorphism. It follows that U(Lgl + ) has an integral basis which may be identified with Young diagrams whose columns are colored by alternating strings of s and s. Example 0. A straightforward generalization of the previous example, with S = {,, n} and F consisting of ladders periodically colored by,, n yields n F Lgl + n.
15 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 5 Example. Let S = {, }, and let F = F, where F is the set of all ladders colored by a sequence of s followed by a sequence of s. Denote by L(i, j) the ladder with i s followed by j s. We have δ L(i,j) δ L(m,n) = 0 if ij > 0 and mn > 0 { δl(i+m,0) if n = 0 δ L(i,0) δ L(m,n) = 0 otherwise δ L(0,j) δ L(m,n) = δ L(m,n+j) δ L(i,j) δ L(m,0) = δ L(i+m,j) { δl(0,j+n) if i = 0 δ L(i,j) δ L(0,n) = 0 otherwise so that we obtain the following non-zero commutation relations (i.e. all other commutators are 0): [δ L(i,0), δ L(0,n) ] = δ L(i,n) [δ L(i,0), δ L(m,n) ] = δ L(m+i,n) if n > 0 [δ L(0,j), δ L(m,n) ] = δ L(m,n+j) if m > 0 Example. Let S = {,,, n}, and let F = F, where F consists of all S colored corollas (rooted trees where all leaves are connected directly to the root) 3 Closing F with respect to convex sub-posets means adjoining singleton colored trees. Denote by X(i) the singleton tree colored by i n, and by Y (i, a,, a n ) the corolla whose root is colored i and which has a + a + a n
16 6 MATT SZCZESNY leaves, with a colored, a colored etc. In n F we have δ X(i) δ X(j) = δ Y (j,0,,i,,0) δ X(i) δ Y (j,a,,a n) = δ Y (j,a,,a i +,,a n) δ Y (j,a,,a n) δ X(i) = 0 δ Y (j,a,,a n) δ Y (j,b,,b n) = 0 which leads to the following commutation relations: [δ X(i), δ X(j) ] = δ Y (j,0,,i,,0) δ Y (i,0,,j,,0) [δ X(i), δ Y (j,a,,a n)] = δ Y (j,a,,a i +,,a n) [δ Y (j,a,,a n), δ Y (j,b,,b n)] = 0
17 PRE-LIE ALGEBRAS AND INCIDENCE CATEGORIES OF COLORED ROOTED TREES 7 References [] Cartier, P. A primer of Hopf algebras. Frontiers in number theory, physics, and geometry. II, , Springer, Berlin, 007. [] Chapoton, F.; Livernet, M. Pre-Lie algebras and the rooted trees operad. Internat. Math. Res. Notices 00, no. 8, [3] Gerstenhaber, M. The cohomology structure of an associative ring, Ann. of Math. 78 (963), [4] Kreimer, D. On the Hopf algebra structure of perturbative quantum field theory. Adv. Theor. Math. Phys (998). [5] Kremnizer K. and Szczesny M. Feynman graphs, rooted trees, and Ringel-Hall algebras. Comm. Math. Phys. 89 (009), no [6] Macdonald, I. G. Symmetric functions and Hall polynomials. Second edition. With contributions by A. Zelevinsky. Oxford Mathematical Monographs. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 995. x+475 pp. [7] Rota, G-C. On the Foundations of Combinatorial Theory I: Theory of Mbius Functions, Zeitschrift fr Wahrscheinlichkeitstheorie und Verwandte Gebiete : , (964). [8] Schiffmann, O. Lectures on Hall algebras. Preprint math.rt/0667. [9] Schmitt, W. R. Antipodes and Incidence Coalgebras. Journal of Comb. Theory. A 46 (987), [0] Schmitt, W. R. Incidence Hopf algebras. J. Pure Appl. Algebra 96 (994), no. 3, [] Stanley, R. Enumerative combinatorics Vol.. Cambridge Studies in Advanced Mathematics, 49. Cambridge University Press, Cambridge, 997. [] Szczesny, M. Inicidence categories. J. Pure and Appl. Algebra, in press. [3] Vinberg, E.B. The theory of homogeneous convex cones, Transl. Moscow Math. Soc. (963), Department of Mathematics and Statistics, Boston University, Boston MA, USA address: szczesny@math.bu.edu
INCIDENCE CATEGORIES
INCIDENCE CATEGORIES MATT SZCZESNY ABSTRACT. Given a family F of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category C F called the incidence category
More informationRingel-Hall Algebras II
October 21, 2009 1 The Category The Hopf Algebra 2 3 Properties of the category A The Category The Hopf Algebra This recap is my attempt to distill the precise conditions required in the exposition by
More informationHECKE CORRESPONDENCES AND FEYNMAN GRAPHS MATT SZCZESNY
HECKE CORRESPONDENCES AND FEYNMAN GRAPHS MATT SZCZESNY ABSTRACT. We consider natural representations of the Connes-Kreimer Lie algebras on rooted trees/feynman graphs arising from Hecke correspondences
More informationCombinatorial Dyson-Schwinger equations and systems I Feynma. Feynman graphs, rooted trees and combinatorial Dyson-Schwinger equations
Combinatorial and systems I, rooted trees and combinatorial Potsdam November 2013 Combinatorial and systems I Feynma In QFT, one studies the behaviour of particles in a quantum fields. Several types of
More informationGroupoids and Faà di Bruno Formulae for Green Functions
Groupoids and Faà di Bruno Formulae for Green Functions UPC UAB London Metropolitan U. September 22, 2011 Bialgebras of trees Connes-Kreimer bialgebra of rooted trees: is the free C-algebra H on the set
More informationCombinatorial Hopf algebras in particle physics I
Combinatorial Hopf algebras in particle physics I Erik Panzer Scribed by Iain Crump May 25 1 Combinatorial Hopf Algebras Quantum field theory (QFT) describes the interactions of elementary particles. There
More informationON BIALGEBRAS AND HOPF ALGEBRAS OF ORIENTED GRAPHS
Confluentes Mathematici, Vol. 4, No. 1 (2012) 1240003 (10 pages) c World Scientific Publishing Company DOI: 10.1142/S1793744212400038 ON BIALGEBRAS AND HOPF ALGEBRAS OF ORIENTED GRAPHS DOMINIQUE MANCHON
More informationHopf algebras in renormalisation for Encyclopædia of Mathematics
Hopf algebras in renormalisation for Encyclopædia of Mathematics Dominique MANCHON 1 1 Renormalisation in physics Systems in interaction are most common in physics. When parameters (such as mass, electric
More informationCONTINUITY. 1. Continuity 1.1. Preserving limits and colimits. Suppose that F : J C and R: C D are functors. Consider the limit diagrams.
CONTINUITY Abstract. Continuity, tensor products, complete lattices, the Tarski Fixed Point Theorem, existence of adjoints, Freyd s Adjoint Functor Theorem 1. Continuity 1.1. Preserving limits and colimits.
More informationFormal power series rings, inverse limits, and I-adic completions of rings
Formal power series rings, inverse limits, and I-adic completions of rings Formal semigroup rings and formal power series rings We next want to explore the notion of a (formal) power series ring in finitely
More informationUNIVERSAL DERIVED EQUIVALENCES OF POSETS
UNIVERSAL DERIVED EQUIVALENCES OF POSETS SEFI LADKANI Abstract. By using only combinatorial data on two posets X and Y, we construct a set of so-called formulas. A formula produces simultaneously, for
More informationOperads. Spencer Liang. March 10, 2015
Operads Spencer Liang March 10, 2015 1 Introduction The notion of an operad was created in order to have a well-defined mathematical object which encodes the idea of an abstract family of composable n-ary
More informationSPLIT GROTHENDIECK RINGS OF ROOTED TREES AND SKEW SHAPES VIA MONOID REPRESENTATIONS.
SPLIT GROTHENDIECK RINGS OF ROOTED TREES AND SKEW SHAPES VIA MONOID REPRESENTATIONS. DAVID BEERS AND MATT SZCZESNY ABSTRACT. We study commutative ring structures on the integral span of rooted trees and
More informationA Leibniz Algebra Structure on the Second Tensor Power
Journal of Lie Theory Volume 12 (2002) 583 596 c 2002 Heldermann Verlag A Leibniz Algebra Structure on the Second Tensor Power R. Kurdiani and T. Pirashvili Communicated by K.-H. Neeb Abstract. For any
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More informationDISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS
DISCRETIZED CONFIGURATIONS AND PARTIAL PARTITIONS AARON ABRAMS, DAVID GAY, AND VALERIE HOWER Abstract. We show that the discretized configuration space of k points in the n-simplex is homotopy equivalent
More informationHopf subalgebras of the Hopf algebra of rooted trees coming from Dyson-Schwinger equations and Lie algebras of Fa di Bruno type
Hopf subalgebras of the Hopf algebra of rooted trees coming from Dyson-Schwinger equations and Lie algebras of Fa di Bruno type Loïc Foissy Contents 1 The Hopf algebra of rooted trees and Dyson-Schwinger
More informationA REMARK ON SIMPLICITY OF VERTEX ALGEBRAS AND LIE CONFORMAL ALGEBRAS
A REMARK ON SIMPLICITY OF VERTEX ALGEBRAS AND LIE CONFORMAL ALGEBRAS ALESSANDRO D ANDREA Ad Olivia, che mi ha insegnato a salutare il Sole ABSTRACT. I give a short proof of the following algebraic statement:
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationCombinatorics of Feynman diagrams and algebraic lattice structure in QFT
Combinatorics of Feynman diagrams and algebraic lattice structure in QFT Michael Borinsky 1 Humboldt-University Berlin Departments of Physics and Mathematics - Alexander von Humboldt Group of Dirk Kreimer
More informationREPRESENTATION THEORY. WEEKS 10 11
REPRESENTATION THEORY. WEEKS 10 11 1. Representations of quivers I follow here Crawley-Boevey lectures trying to give more details concerning extensions and exact sequences. A quiver is an oriented graph.
More informationMAT 5330 Algebraic Geometry: Quiver Varieties
MAT 5330 Algebraic Geometry: Quiver Varieties Joel Lemay 1 Abstract Lie algebras have become of central importance in modern mathematics and some of the most important types of Lie algebras are Kac-Moody
More informationThe real root modules for some quivers.
SS 2006 Selected Topics CMR The real root modules for some quivers Claus Michael Ringel Let Q be a finite quiver with veretx set I and let Λ = kq be its path algebra The quivers we are interested in will
More informationELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS
ELEMENTARY SUBALGEBRAS OF RESTRICTED LIE ALGEBRAS J. WARNER SUMMARY OF A PAPER BY J. CARLSON, E. FRIEDLANDER, AND J. PEVTSOVA, AND FURTHER OBSERVATIONS 1. The Nullcone and Restricted Nullcone We will need
More informationA GLIMPSE OF ALGEBRAIC K-THEORY: Eric M. Friedlander
A GLIMPSE OF ALGEBRAIC K-THEORY: Eric M. Friedlander During the first three days of September, 1997, I had the privilege of giving a series of five lectures at the beginning of the School on Algebraic
More informationThe Diamond Category of a Locally Discrete Ordered Set.
The Diamond Category of a Locally Discrete Ordered Set Claus Michael Ringel Let k be a field Let I be a ordered set (what we call an ordered set is sometimes also said to be a totally ordered set or a
More informationMATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA 23
MATH 101B: ALGEBRA II PART A: HOMOLOGICAL ALGEBRA 23 6.4. Homotopy uniqueness of projective resolutions. Here I proved that the projective resolution of any R-module (or any object of an abelian category
More informationMATH 326: RINGS AND MODULES STEFAN GILLE
MATH 326: RINGS AND MODULES STEFAN GILLE 1 2 STEFAN GILLE 1. Rings We recall first the definition of a group. 1.1. Definition. Let G be a non empty set. The set G is called a group if there is a map called
More informationREPRESENTATIONS OF QUIVERS OVER F 1 MATT SZCZESNY
REPRESENTATIONS OF QUIVERS OVER F 1 MATT SZCZESNY ABSTRACT. We define and study the category Rep(Q, F 1 ) of representations of a quiver in Vect(F 1 ) - the category of vector spaces over F 1. Rep(Q, F
More informationTCC Homological Algebra: Assignment #3 (Solutions)
TCC Homological Algebra: Assignment #3 (Solutions) David Loeffler, d.a.loeffler@warwick.ac.uk 30th November 2016 This is the third of 4 problem sheets. Solutions should be submitted to me (via any appropriate
More informationTHE HOPF ALGEBRA OF INTEGER BINARY RELATIONS VINCENT PILAUD AND VIVIANE PONS
THE HOPF ALGEBRA OF INTEGER BINARY RELATIONS VINCENT PILAUD AND VIVIANE PONS Abstract We construct a Hopf algebra on integer binary relations that contains under the same roof several well-known Hopf algebras
More informationAnother algorithm for nonnegative matrices
Linear Algebra and its Applications 365 (2003) 3 12 www.elsevier.com/locate/laa Another algorithm for nonnegative matrices Manfred J. Bauch University of Bayreuth, Institute of Mathematics, D-95440 Bayreuth,
More informationExercises on chapter 1
Exercises on chapter 1 1. Let G be a group and H and K be subgroups. Let HK = {hk h H, k K}. (i) Prove that HK is a subgroup of G if and only if HK = KH. (ii) If either H or K is a normal subgroup of G
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationINTRODUCTION TO LIE ALGEBRAS. LECTURE 1.
INTRODUCTION TO LIE ALGEBRAS. LECTURE 1. 1. Algebras. Derivations. Definition of Lie algebra 1.1. Algebras. Let k be a field. An algebra over k (or k-algebra) is a vector space A endowed with a bilinear
More informationON THE HALL ALGEBRA OF COHERENT SHEAVES ON P 1 OVER F 1.
ON THE HALL ALGEBRA OF COHERENT SHEAVES ON P 1 OVER F 1. MATT SZCZESNY Abstract. We define and study the category Coh n (P 1 ) of normal coherent sheaves on the monoid scheme P 1 (equivalently, the M 0
More information[n] q! = [n] q [n 1] q... [2] q. [n] q = 1 + q + q q n 1
REPRESENTATIONS OF QUIVERS OVER F 1 AND HALL ALGEBRAS MATT SZCZESNY ABSTRACT. We define and study the category Rep(Q, F 1 ) of representations of a quiver in Vect(F 1 ) - the category of vector spaces
More informationOPERADS OF FINITE POSETS
OPERADS OF FINITE POSETS Abstract. We describe four natural operad structures on the vector space generated by isomorphism classes of finite posets. The three last ones are set-theoretical and can be seen
More informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationThe Hopf algebra structure of renormalizable quantum field theory
The Hopf algebra structure of renormalizable quantum field theory Dirk Kreimer Institut des Hautes Etudes Scientifiques 35 rte. de Chartres 91440 Bures-sur-Yvette France E-mail: kreimer@ihes.fr February
More informationA Hopf Algebra Structure on Hall Algebras
A Hopf Algebra Structure on Hall Algebras Christopher D. Walker Department of Mathematics, University of California Riverside, CA 92521 USA October 16, 2010 Abstract One problematic feature of Hall algebras
More informationRepresentations of quivers
Representations of quivers Gwyn Bellamy October 13, 215 1 Quivers Let k be a field. Recall that a k-algebra is a k-vector space A with a bilinear map A A A making A into a unital, associative ring. Notice
More information58 CHAPTER 2. COMPUTATIONAL METHODS
58 CHAPTER 2. COMPUTATIONAL METHODS 23 Hom and Lim We will now develop more properties of the tensor product: its relationship to homomorphisms and to direct limits. The tensor product arose in our study
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More information1. Quivers and their representations: Basic definitions and examples.
1 Quivers and their representations: Basic definitions and examples 11 Quivers A quiver Q (sometimes also called a directed graph) consists of vertices and oriented edges (arrows): loops and multiple arrows
More informationAFFINE ACTIONS ON NILPOTENT LIE GROUPS
AFFINE ACTIONS ON NILPOTENT LIE GROUPS DIETRICH BURDE, KAREL DEKIMPE, AND SANDRA DESCHAMPS Abstract. To any connected and simply connected nilpotent Lie group N, one can associate its group of affine transformations
More informationON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD. A. M. Vershik, S. V. Kerov
ON AN INFINITE-DIMENSIONAL GROUP OVER A FINITE FIELD A. M. Vershik, S. V. Kerov Introduction. The asymptotic representation theory studies the behavior of representations of large classical groups and
More informationLie Superalgebras and Lie Supergroups, II
Seminar Sophus Lie 2 1992 3 9 Lie Superalgebras and Lie Supergroups, II Helmut Boseck 6. The Hopf Dual. Let H = H 0 H 1 denote an affine Hopf superalgebra, i.e. a Z 2 -graded commutative, finitely generated
More informationNOTES ON RESTRICTED INVERSE LIMITS OF CATEGORIES
NOTES ON RESTRICTED INVERSE LIMITS OF CATEGORIES INNA ENTOVA AIZENBUD Abstract. We describe the framework for the notion of a restricted inverse limit of categories, with the main motivating example being
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 9 1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R A B. Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationMOTIVES ASSOCIATED TO SUMS OF GRAPHS
MOTIVES ASSOCIATED TO SUMS OF GRAPHS SPENCER BLOCH 1. Introduction In quantum field theory, the path integral is interpreted perturbatively as a sum indexed by graphs. The coefficient (Feynman amplitude)
More informationL(C G (x) 0 ) c g (x). Proof. Recall C G (x) = {g G xgx 1 = g} and c g (x) = {X g Ad xx = X}. In general, it is obvious that
ALGEBRAIC GROUPS 61 5. Root systems and semisimple Lie algebras 5.1. Characteristic 0 theory. Assume in this subsection that chark = 0. Let me recall a couple of definitions made earlier: G is called reductive
More informationZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p
ZEROS OF SPARSE POLYNOMIALS OVER LOCAL FIELDS OF CHARACTERISTIC p BJORN POONEN 1. Statement of results Let K be a field of characteristic p > 0 equipped with a valuation v : K G taking values in an ordered
More informationBinomial Exercises A = 1 1 and 1
Lecture I. Toric ideals. Exhibit a point configuration A whose affine semigroup NA does not consist of the intersection of the lattice ZA spanned by the columns of A with the real cone generated by A.
More informationA multiplicative deformation of the Möbius function for the poset of partitions of a multiset
Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered
More informationMATH 101: ALGEBRA I WORKSHEET, DAY #1. We review the prerequisites for the course in set theory and beginning a first pass on group. 1.
MATH 101: ALGEBRA I WORKSHEET, DAY #1 We review the prerequisites for the course in set theory and beginning a first pass on group theory. Fill in the blanks as we go along. 1. Sets A set is a collection
More informationA polynomial realization of the Hopf algebra of uniform block permutations.
FPSAC 202, Nagoya, Japan DMTCS proc AR, 202, 93 204 A polynomial realization of the Hopf algebra of uniform block permutations Rémi Maurice Institut Gaspard Monge, Université Paris-Est Marne-la-Vallée,
More informationHigher dimensional homological algebra
Higher dimensional homological algebra Peter Jørgensen Contents 1 Preface 3 2 Notation and Terminology 5 3 d-cluster tilting subcategories 6 4 Higher Auslander Reiten translations 10 5 d-abelian categories
More informationREPRESENTATION THEORY WEEK 9
REPRESENTATION THEORY WEEK 9 1. Jordan-Hölder theorem and indecomposable modules Let M be a module satisfying ascending and descending chain conditions (ACC and DCC). In other words every increasing sequence
More informationProblems in Linear Algebra and Representation Theory
Problems in Linear Algebra and Representation Theory (Most of these were provided by Victor Ginzburg) The problems appearing below have varying level of difficulty. They are not listed in any specific
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationOn the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem
On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem Bertram Kostant, MIT Conference on Representations of Reductive Groups Salt Lake City, Utah July 10, 2013
More informationNoncommutative compact manifolds constructed from quivers
Noncommutative compact manifolds constructed from quivers Lieven Le Bruyn Universitaire Instelling Antwerpen B-2610 Antwerp (Belgium) lebruyn@wins.uia.ac.be Abstract The moduli spaces of θ-semistable representations
More informationNoetherian property of infinite EI categories
Noetherian property of infinite EI categories Wee Liang Gan and Liping Li Abstract. It is known that finitely generated FI-modules over a field of characteristic 0 are Noetherian. We generalize this result
More informationAN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE
AN EXACT SEQUENCE FOR THE BROADHURST-KREIMER CONJECTURE FRANCIS BROWN Don Zagier asked me whether the Broadhurst-Kreimer conjecture could be reformulated as a short exact sequence of spaces of polynomials
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationRepresentations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III
Representations of algebraic groups and their Lie algebras Jens Carsten Jantzen Lecture III Lie algebras. Let K be again an algebraically closed field. For the moment let G be an arbitrary algebraic group
More informationON THE GEOMETRY OF ORBIT CLOSURES FOR REPRESENTATION-INFINITE ALGEBRAS
ON THE GEOMETRY OF ORBIT CLOSURES FOR REPRESENTATION-INFINITE ALGEBRAS CALIN CHINDRIS ABSTRACT. For the Kronecker algebra, Zwara found in [13] an example of a module whose orbit closure is neither unibranch
More informationMATH 8253 ALGEBRAIC GEOMETRY WEEK 12
MATH 8253 ALGEBRAIC GEOMETRY WEEK 2 CİHAN BAHRAN 3.2.. Let Y be a Noetherian scheme. Show that any Y -scheme X of finite type is Noetherian. Moreover, if Y is of finite dimension, then so is X. Write f
More informationSTABLE MODULE THEORY WITH KERNELS
Math. J. Okayama Univ. 43(21), 31 41 STABLE MODULE THEORY WITH KERNELS Kiriko KATO 1. Introduction Auslander and Bridger introduced the notion of projective stabilization mod R of a category of finite
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationThe Hopf monoid of generalized permutahedra. SIAM Discrete Mathematics Meeting Austin, TX, June 2010
The Hopf monoid of generalized permutahedra Marcelo Aguiar Texas A+M University Federico Ardila San Francisco State University SIAM Discrete Mathematics Meeting Austin, TX, June 2010 The plan. 1. Species.
More informationOn an algebra related to orbit-counting. Peter J. Cameron. Queen Mary and Westeld College. London E1 4NS U.K. Abstract
On an algebra related to orbit-counting Peter J. Cameron School of Mathematical Sciences Queen Mary and Westeld College London E1 4NS U.K. Abstract With any permutation group G on an innite set is associated
More informationMaximum union-free subfamilies
Maximum union-free subfamilies Jacob Fox Choongbum Lee Benny Sudakov Abstract An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationarxiv: v1 [math.co] 20 Dec 2016
F-POLYNOMIAL FORMULA FROM CONTINUED FRACTIONS MICHELLE RABIDEAU arxiv:1612.06845v1 [math.co] 20 Dec 2016 Abstract. For cluster algebras from surfaces, there is a known formula for cluster variables and
More informationCOLLEEN DELANEY AND MATILDE MARCOLLI
DYSON SCHWINGER EQUATIONS IN THE THEORY OF COMPUTATION COLLEEN DELANEY AND MATILDE MARCOLLI Abstract. Following Manin s approach to renormalization in the theory of computation, we investigate Dyson Schwinger
More informationExercises on chapter 0
Exercises on chapter 0 1. A partially ordered set (poset) is a set X together with a relation such that (a) x x for all x X; (b) x y and y x implies that x = y for all x, y X; (c) x y and y z implies that
More informationNotas de Aula Grupos Profinitos. Martino Garonzi. Universidade de Brasília. Primeiro semestre 2018
Notas de Aula Grupos Profinitos Martino Garonzi Universidade de Brasília Primeiro semestre 2018 1 Le risposte uccidono le domande. 2 Contents 1 Topology 4 2 Profinite spaces 6 3 Topological groups 10 4
More informationThe Jordan Canonical Form
The Jordan Canonical Form The Jordan canonical form describes the structure of an arbitrary linear transformation on a finite-dimensional vector space over an algebraically closed field. Here we develop
More informationSymbol Index Group GermAnal Ring AbMonoid
Symbol Index 409 Symbol Index Symbols of standard and uncontroversial usage are generally not included here. As in the word index, boldface page-numbers indicate pages where definitions are given. If a
More informationMobius Inversion on Partially Ordered Sets
Mobius Inversion on Partially Ordered Sets 1 Introduction The theory of Möbius inversion gives us a unified way to look at many different results in combinatorics that involve inverting the relation between
More informationSELF-DUAL HOPF QUIVERS
Communications in Algebra, 33: 4505 4514, 2005 Copyright Taylor & Francis, Inc. ISSN: 0092-7872 print/1532-4125 online DOI: 10.1080/00927870500274846 SELF-DUAL HOPF QUIVERS Hua-Lin Huang Department of
More informationFUNCTORS AND ADJUNCTIONS. 1. Functors
FUNCTORS AND ADJUNCTIONS Abstract. Graphs, quivers, natural transformations, adjunctions, Galois connections, Galois theory. 1.1. Graph maps. 1. Functors 1.1.1. Quivers. Quivers generalize directed graphs,
More information4.1. Paths. For definitions see section 2.1 (In particular: path; head, tail, length of a path; concatenation;
4 The path algebra of a quiver 41 Paths For definitions see section 21 (In particular: path; head, tail, length of a path; concatenation; oriented cycle) Lemma Let Q be a quiver If there is a path of length
More informationDecompositions of Modules and Comodules
Decompositions of Modules and Comodules Robert Wisbauer University of Düsseldorf, Germany Abstract It is well-known that any semiperfect A ring has a decomposition as a direct sum (product) of indecomposable
More informationA NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9
A NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9 ERIC C. ROWELL Abstract. We consider the problem of decomposing tensor powers of the fundamental level 1 highest weight representation V of the affine Kac-Moody
More informationUnital associahedra. and homotopy unital homotopy associative algebras. Andrew TONKS London Metropolitan University
Unital associahedra and homotopy unital homotopy associative algebras Andrew TONKS London Metropolitan University with Fernando MURO Universidad de Sevilla Outline Classical algebraic definition arises
More informationREVERSALS ON SFT S. 1. Introduction and preliminaries
Trends in Mathematics Information Center for Mathematical Sciences Volume 7, Number 2, December, 2004, Pages 119 125 REVERSALS ON SFT S JUNGSEOB LEE Abstract. Reversals of topological dynamical systems
More informationBEN KNUDSEN. Conf k (f) Conf k (Y )
CONFIGURATION SPACES IN ALGEBRAIC TOPOLOGY: LECTURE 2 BEN KNUDSEN We begin our study of configuration spaces by observing a few of their basic properties. First, we note that, if f : X Y is an injective
More informationA quasisymmetric function generalization of the chromatic symmetric function
A quasisymmetric function generalization of the chromatic symmetric function Brandon Humpert University of Kansas Lawrence, KS bhumpert@math.ku.edu Submitted: May 5, 2010; Accepted: Feb 3, 2011; Published:
More informationThus we get. ρj. Nρj i = δ D(i),j.
1.51. The distinguished invertible object. Let C be a finite tensor category with classes of simple objects labeled by a set I. Since duals to projective objects are projective, we can define a map D :
More informationCATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS. Contents. 1. The ring K(R) and the group Pic(R)
CATEGORICAL GROTHENDIECK RINGS AND PICARD GROUPS J. P. MAY Contents 1. The ring K(R) and the group Pic(R) 1 2. Symmetric monoidal categories, K(C), and Pic(C) 2 3. The unit endomorphism ring R(C ) 5 4.
More informationREPRESENTATIONS OF FINITE GROUPS OF LIE TYPE: EXERCISES. Notation. 1. GL n
REPRESENTATIONS OF FINITE GROUPS OF LIE TYPE: EXERCISES ZHIWEI YUN Fix a prime number p and a power q of p. k = F q ; k d = F q d. ν n means ν is a partition of n. Notation Conjugacy classes 1. GL n 1.1.
More informationKac-Moody Algebras. Ana Ros Camacho June 28, 2010
Kac-Moody Algebras Ana Ros Camacho June 28, 2010 Abstract Talk for the seminar on Cohomology of Lie algebras, under the supervision of J-Prof. Christoph Wockel Contents 1 Motivation 1 2 Prerequisites 1
More informationWe simply compute: for v = x i e i, bilinearity of B implies that Q B (v) = B(v, v) is given by xi x j B(e i, e j ) =
Math 395. Quadratic spaces over R 1. Algebraic preliminaries Let V be a vector space over a field F. Recall that a quadratic form on V is a map Q : V F such that Q(cv) = c 2 Q(v) for all v V and c F, and
More informationOn Representability of a Finite Local Ring
Journal of Algebra 228, 417 427 (2000) doi:10.1006/jabr.1999.8242, available online at http://www.idealibrary.com on On Representability of a Finite Local Ring A. Z. Anan in Departamento de Matemática
More informationDimension of the mesh algebra of a finite Auslander-Reiten quiver. Ragnar-Olaf Buchweitz and Shiping Liu
Dimension of the mesh algebra of a finite Auslander-Reiten quiver Ragnar-Olaf Buchweitz and Shiping Liu Abstract. We show that the dimension of the mesh algebra of a finite Auslander-Reiten quiver over
More informationOn the Lie envelopping algebra of a pre-lie algebra
On the Lie envelopping algebra of a pre-lie algebra Jean-Michel Oudom, Daniel Guin To cite this version: Jean-Michel Oudom, Daniel Guin. On the Lie envelopping algebra of a pre-lie algebra. Journal of
More information