Some Identities in the Twisted Group Algebra of Symmetric Groups
|
|
- Horace Quinn
- 5 years ago
- Views:
Transcription
1 Some Identities in the Twisted Group Algebra of Symmetric Groups Milena Sošić Department of Mathematics University of Rijeka Radmile Matejčić 2, Rijeka 51000, Croatia August 8, 2013
2 Let S n denote the symmetric group on n letters i.e S n is the set of all permutations of a set M = {1,2,...,n} equiped with a composition as the binary operation on S n (clearly, the permutations are regarded as bijections from M to itself); M. Sošić (University of Rijeka) Some identities August 8, / 21
3 Let S n denote the symmetric group on n letters i.e S n is the set of all permutations of a set M = {1,2,...,n} equiped with a composition as the binary operation on S n (clearly, the permutations are regarded as bijections from M to itself); X = {X ab 1 a,b n} be a set of n 2 commuting variables X ab ; M. Sošić (University of Rijeka) Some identities August 8, / 21
4 Let S n denote the symmetric group on n letters i.e S n is the set of all permutations of a set M = {1,2,...,n} equiped with a composition as the binary operation on S n (clearly, the permutations are regarded as bijections from M to itself); X = {X ab 1 a,b n} be a set of n 2 commuting variables X ab ; R n := C[X ab 1 a,b n] denote the polynomial ring i.e the commutative ring of all polynomials in n 2 variables X ab over the set C with 1 R n as a unit element of R n. C = the set of complex numbers. M. Sošić (University of Rijeka) Some identities August 8, / 21
5 Let S n denote the symmetric group on n letters i.e S n is the set of all permutations of a set M = {1,2,...,n} equiped with a composition as the binary operation on S n (clearly, the permutations are regarded as bijections from M to itself); X = {X ab 1 a,b n} be a set of n 2 commuting variables X ab ; R n := C[X ab 1 a,b n] denote the polynomial ring i.e the commutative ring of all polynomials in n 2 variables X ab over the set C with 1 R n as a unit element of R n. C = the set of complex numbers. S n acts on the set X as follows: g.x ab = X g(a)g(b). M. Sošić (University of Rijeka) Some identities August 8, / 21
6 Let S n denote the symmetric group on n letters i.e S n is the set of all permutations of a set M = {1,2,...,n} equiped with a composition as the binary operation on S n (clearly, the permutations are regarded as bijections from M to itself); X = {X ab 1 a,b n} be a set of n 2 commuting variables X ab ; R n := C[X ab 1 a,b n] denote the polynomial ring i.e the commutative ring of all polynomials in n 2 variables X ab over the set C with 1 R n as a unit element of R n. C = the set of complex numbers. S n acts on the set X as follows: g.x ab = X g(a)g(b). This action of S n on X induces the action of S n on R n given by g.p(...,x ab,...) = p(...,x g(a)g(b),...) for every g S n and any p R n. M. Sošić (University of Rijeka) Some identities August 8, / 21
7 Recall, the usual group algebra C[S n ] = { σ S n c σ σ c σ C of the symmetric group S n is a free vector space (generated with the set S n ), where the multiplication is given by ( σ S n c σ σ ) ( τ S n d τ τ ) = } σ,τ S n (c σ d τ )στ. Here we have used the simplified notation: στ = σ τ for the composition σ τ i.e the product of σ and τ in S n. M. Sošić (University of Rijeka) Some identities August 8, / 21
8 Now we define more general group algebra A(S n ) := R n C[S n ] a twisted group algebra of the symmetric group S n with coefficients in the polynomial ring R n. Here denotes the semidirect product. M. Sošić (University of Rijeka) Some identities August 8, / 21
9 Now we define more general group algebra A(S n ) := R n C[S n ] a twisted group algebra of the symmetric group S n with coefficients in the polynomial ring R n. Here denotes the semidirect product. The elements of the set A(S n ) are the linear combinations g i S n p i g i with p i R n. M. Sošić (University of Rijeka) Some identities August 8, / 21
10 Now we define more general group algebra A(S n ) := R n C[S n ] a twisted group algebra of the symmetric group S n with coefficients in the polynomial ring R n. Here denotes the semidirect product. The elements of the set A(S n ) are the linear combinations g i S n p i g i with p i R n. The multiplication in A(S n ) is given by (p 1 g 1 ) (p 2 g 2 ) := (p 1 (g 1.p 2 ))g 1 g 2 where g 1.p 2 is defined by: g.p(...,x ab,...) = p(...,x g(a)g(b),...) M. Sošić (University of Rijeka) Some identities August 8, / 21
11 Now we define more general group algebra A(S n ) := R n C[S n ] a twisted group algebra of the symmetric group S n with coefficients in the polynomial ring R n. Here denotes the semidirect product. The elements of the set A(S n ) are the linear combinations g i S n p i g i with p i R n. The multiplication in A(S n ) is given by (p 1 g 1 ) (p 2 g 2 ) := (p 1 (g 1.p 2 ))g 1 g 2 where g 1.p 2 is defined by: g.p(...,x ab,...) = p(...,x g(a)g(b),...) The algebra A(S n) is associative but not commutative. M. Sošić (University of Rijeka) Some identities August 8, / 21
12 Let I(g) = {(a,b) 1 a < b n, g(a) > g(b)} denote the set of inversions of g S n. Then to every g S n we associate a monomial in the ring R n defined by X g := =, X ab (a,b) I(g 1 ) a<b,g 1 (a)>g 1 (b) X ab which encodes all inversions of g 1 (and of g too). More generally, for any subset A {1,2,...,n} we will use the notation X A := X ab X ba = X {a,b}, (a,b) A A, a<b (a,b) A A, a<b because X {a,b} := X ab X ba. M. Sošić (University of Rijeka) Some identities August 8, / 21
13 Definition To each g S n we assign a unique element g A(S n ) defined by g := X g g. Theorem For every g 1,g 2 A(S n) we have g 1 g 2 = X(g 1,g 2 )(g 1 g 2 ), where the multiplication factor is given by X(g 1,g 2 ) =. (a,b) I(g 1 1 )\I((g 1g 2 ) 1 ) X {a,b} M. Sošić (University of Rijeka) Some identities August 8, / 21
14 Recall, X(g 1,g 2 ) = (a,b) I(g 1 1 )\I((g1g2) 1 ) X {a,b} Note that if l(g 1 g 2 ) = l(g 1 )+l(g 2 ). So we have X(g 1,g 2 ) = 1 g 1 g 2 = (g 1 g 2 ) where l(g) := CardI(g) is the lenght of g S n. M. Sošić (University of Rijeka) Some identities August 8, / 21
15 Recall, X(g 1,g 2 ) = (a,b) I(g 1 1 )\I((g1g2) 1 ) X {a,b} Note that if l(g 1 g 2 ) = l(g 1 )+l(g 2 ). So we have X(g 1,g 2 ) = 1 g 1 g 2 = (g 1 g 2 ) where l(g) := CardI(g) is the lenght of g S n. The factor X(g 1,g 2) takes care of the reduced number of inversions in the group product of g 1,g 2 S n. M. Sošić (University of Rijeka) Some identities August 8, / 21
16 Recall, g 1 g 2 = X(g 1,g 2 )(g 1 g 2 ) for every g 1,g 2 A(S n ) Example Let g 1 = 132, g 2 = 312 S 3. Then g 1 g 2 = 213, l(g 1 ) = 1, l(g 2 ) = 2, l(g 1 g 2 ) = 1. Note that g 1 1 = 132, g 1 2 = 231, so g 1 g 2 =(X 23 g 1 ) (X 13 X 23 g 2 ) = X 23 X 12 X 32 g 1 g 2 = X {2,3} X 12 g 1 g 2. On the other hand we have: (g 1 g 2 ) = X 12 g 1 g 2, since (g 1 g 2 ) 1 = 213. Thus we get g 1 g 2 = X {2,3}(g 1 g 2 ) and X(g 1,g 2 ) = X {2,3}. M. Sošić (University of Rijeka) Some identities August 8, / 21
17 Recall, g 1 g 2 = X(g 1,g 2 )(g 1 g 2 ) for every g 1,g 2 A(S n ) Example For g 1 = 132, g 2 = 231 we have g 1 g 2 = 321, l(g 1 ) = 1, l(g 2 ) = 2, l(g 1 g 2 ) = 3. Further g 1 1 = 132, g 1 2 = 312 and (g 1 g 2 ) 1 = 321, so we get: g 1 g 2 =(X 23 g 1 ) (X 12 X 13 g 2 ) = X 23 X 13 X 12 g 1 g 2, (g 1 g 2 ) = X 12 X 13 X 23 g 1 g 2. Thus we get g 1 g 2 = (g 1g 2 ) and X(g 1,g 2 ) = 1. M. Sošić (University of Rijeka) Some identities August 8, / 21
18 We denote by t a,b, 1 a b n the following cyclic permutation in S n : k 1 k a 1 or b+1 k n t a,b (k) := b k = a k 1 a+1 k b which maps b to b 1 to b 2 to a to b and fixes all 1 k a 1 and b+1 k n i.e ( ) 1... a 1 a a+1... b 1 b b+1... n t a,b = 1... a 1 b a... b 2 b 1 b+1... n M. Sošić (University of Rijeka) Some identities August 8, / 21
19 We denote by t a,b, 1 a b n the following cyclic permutation in S n : k 1 k a 1 or b+1 k n t a,b (k) := b k = a k 1 a+1 k b which maps b to b 1 to b 2 to a to b and fixes all 1 k a 1 and b+1 k n i.e ( ) 1... a 1 a a+1... b 1 b b+1... n t a,b = 1... a 1 b a... b 2 b 1 b+1... n t b,a := t 1 a,b i.e k t b,a (k) = k +1 a 1 k a 1 or b+1 k n a k b 1 k = b M. Sošić (University of Rijeka) Some identities August 8, / 21
20 Then the sets of inversions are given by I(t a,b ) = {(a,j) a+1 j b}, I(t b,a ) = {(i,b) a i b 1}. so the corresponding elements in A(S n ) have the form: t a,b = t a,b t b,a = X ib a i b 1 a+1 j b X aj t b,a. Observe: t a,a = id, where I(t a,a ) =. Denote: t a = t a,a+1 (= t a+1,a ), 1 a n 1 (the transposition of adjacent letters a and a+1). Then: t a = X aa+1t a, with I(t a) = {(a,a+1)}. M. Sošić (University of Rijeka) Some identities August 8, / 21
21 Recall, g 1 g 2 = X(g 1,g 2 )(g 1 g 2 ) for every g 1,g 2 A(S n ) Corollary For each 1 a n 1 we have (t a) 2 = X {a,a+1} id. Here we have used that t at a = id and X {a,a+1} = X aa+1 X a+1a. Corollary For each g S n, 1 a < b n we have g t b,a = a<j n, g(a)>g(j) X {g(j),g(a)} (gt b,a ). In the case g S j S n j, 1 j k n we have g t k,j = (gt k,j ). M. Sošić (University of Rijeka) Some identities August 8, / 21
22 Recall, g 1 g 2 = X(g 1,g 2 )(g 1 g 2 ) for every g 1,g 2 A(S n ) Corollary (Braid relations) We have (i) t a t a+1 t a = t a+1 t a t a+1 for each 1 a n 2, (ii) t a t b = t b t a for each 1 a,b n 1 with a b 2. Corollary (Commutation rules) We have (i) t m,k t p,k = (t k )2 t p,k+1 t m 1,k if 1 k m p n. (ii) Let w n (= nn 1 21) be the longest permutation in S n. Then for every g S n we have (gw n ) wn = wn (w n g) = g. X {a,b} a<b,g 1 (a)<g 1 (b) M. Sošić (University of Rijeka) Some identities August 8, / 21
23 Decompositions (from the left) of certain canonical elements in A(S n ) Observe first: for g S n g 1 S 1 S n 1 and 1 k 1 n such that g = g 1 t k1,1 Then g(k 1 ) =g 1 (t k1,1(k 1 )) = g 1 (1) = 1 implies k 1 = g 1 (1). M. Sošić (University of Rijeka) Some identities August 8, / 21
24 Decompositions (from the left) of certain canonical elements in A(S n ) Observe first: for g S n g 1 S 1 S n 1 and 1 k 1 n such that g = g 1 t k1,1 Then g(k 1 ) =g 1 (t k1,1(k 1 )) = g 1 (1) = 1 implies k 1 = g 1 (1). Subsequently, the permutation g 1 S 1 S n 1 can be represented uniquely as g 1 = g 2 t k2,2 with g 2 S 1 S 1 S n 2 and 2 k 2 n. Then g 1 (k 2 ) =g 2 (t k2,2(k 2 )) = g 2 (2) = 2 implies k 2 = g 1 1 (2). M. Sošić (University of Rijeka) Some identities August 8, / 21
25 Decompositions (from the left) of certain canonical elements in A(S n ) Observe first: for g S n g 1 S 1 S n 1 and 1 k 1 n such that g = g 1 t k1,1 Then g(k 1 ) =g 1 (t k1,1(k 1 )) = g 1 (1) = 1 implies k 1 = g 1 (1). Subsequently, the permutation g 1 S 1 S n 1 can be represented uniquely as g 1 = g 2 t k2,2 with g 2 S 1 S 1 S n 2 and 2 k 2 n. Then g 1 (k 2 ) =g 2 (t k2,2(k 2 )) = g 2 (2) = 2 implies k 2 = g 1 1 (2). By repeating the above procedure we get the following decomposition: g = t kn,n t kn 1,n 1 t kj,j t k2,2 t k1,1 = t kj,j. 1 j n M. Sošić (University of Rijeka) Some identities August 8, / 21
26 Recall, g = t kn,n t kn 1,n 1 t kj,j t k2,2 t k1,1. Example Let S 3 = {123,132,312,321,231,213} then in A(S 3 ) we have: 123 = t 3,3 t 2,2 t 1,1, 132 = t 3,3 t 3,2 t 1,1, 312 = t 3,3 t 3,2 t 2,1, 321 = t 3,3 t 3,2 t 3,1, 231 = t 3,3 t 2,2 t 3,1, 213 = t 3,3 t 2,2 t 2,1. M. Sošić (University of Rijeka) Some identities August 8, / 21
27 Recall, g = t kn,n t kn 1,n 1 t kj,j t k2,2 t k1,1. Example Let S 3 = {123,132,312,321,231,213} then in A(S 3 ) we have: 123 = t 3,3 t 2,2 t 1,1, 132 = t 3,3 t 3,2 t 1,1, 312 = t 3,3 t 3,2 t 2,1, 321 = t 3,3 t 3,2 t 3,1, 231 = t 3,3 t 2,2 t 3,1, 213 = t 3,3 t 2,2 t 2,1. Now, assume that α 3 = g S 3 g. Then we get the following product form: α3 = ( t ) 3,3 } =(id) ( t 3,2 +t 2,2) (t 3,1 +t 2,1 +t ) 1,1 {{}}{{}}{{} β1 β2 β3 of simpler elements β i, 1 i 3 of the algebra A(S 3). M. Sošić (University of Rijeka) Some identities August 8, / 21
28 The general situation in A(S n ): Definition For every 1 k n we define β n k+1 := t n,k +t n 1,k + +t k+1,k +t k,k = k m n t m,k. Theorem Let Then αn = g. g S n αn = β1 β2 βn = 1 k n 1 β n k+1. M. Sošić (University of Rijeka) Some identities August 8, / 21
29 In what follows we are going to introduce some new elements in the algebra A(S n ) by which we will reduce β n k+1, 1 k n. The motivation is to show that the element α n A(S n ) can be expressed in turn as products of yet simpler elements of the algebra A(S n ). Definition For every 1 k n 1 we define γ n k+1 := ( id t n,k) ( id t n 1,k ) ( id t k+1,k ), δn k+1 := ( id (t k) 2 t n,k+1) ( id (t k ) 2 t n 1,k+1) ( id (t k ) 2 t ) k+1,k+1 Recall, (t k) 2 = X {k,k+1} id (= X kk+1 X k+1k id) and t k+1,k+1 = id. Theorem For every 1 k n we have the following factorization β n k+1 = δ n k+1 (γ n k+1) 1. M. Sošić (University of Rijeka) Some identities August 8, / 21
30 Recall, α n = β 1 β 2 β n with β 1 = id βn k+1 = (γ ) δ n k+1 n k+1 1 ) ( γn k+1 (id t = n,k ) δn k+1 (id (t = k )2 t n,k+1 id t n 1,k ) ( id t k+1,k ( id (t k )2 t n 1,k+1 ) ) ( ) id (t k )2 t k+1,k+1 Example (The factorization of α 2 A(S 2 )) We have i.e α 2 = β 2 α2 = ( id (t 1) 2) (id t ) 1 2,1 M. Sošić (University of Rijeka) Some identities August 8, / 21
31 Recall, α n = β 1 β 2 β n with β 1 = id βn k+1 = (γ ) δ n k+1 n k+1 1 ) ( γn k+1 (id t = n,k ) δn k+1 (id (t = k )2 t n,k+1 id t n 1,k ) ( id t k+1,k ( id (t k )2 t n 1,k+1 ) ) ( ) id (t k )2 t k+1,k+1 Example (The factorization of α 3 A(S 3 )) We have where β2 = ( id (t 2) 2) (id t ) 1 3,2 α 3 = β 2 β 3 β3 = ( id (t 1) 2 t 3,2) ( id (t 1 ) 2) (id t 2,1 ) 1 (id t ) 1 3,1 M. Sošić (University of Rijeka) Some identities August 8, / 21
32 Recall, α n = β 1 β 2 β n with β 1 = id βn k+1 = (γ ) δ n k+1 n k+1 1 ) ( γn k+1 (id t = n,k ) δn k+1 (id (t = k )2 t n,k+1 id t n 1,k ) ( id t k+1,k ( id (t k )2 t n 1,k+1 ) ) ( ) id (t k )2 t k+1,k+1 Example (The factorization of α 4 A(S 4 )) We have where β 2 = ( id (t 3) 2) (id t 4,3 α 4 = β 2 β 3 β 4 ) 1 β 3 = ( id (t 2) 2 t 4,3) ( id (t 2 ) 2) (id t 3,2) 1 ( id t 4,2 ) 1, β4 = ( id (t 1) 2 t 4,2) ( id (t 1 ) 2 t 3,2) ( id (t 1 ) 2) (id t ) 1 2,1 (id t 1 ) 3,1) ( id t 1. 4,1 M. Sošić (University of Rijeka) Some identities August 8, / 21
33 Conclusion In order to replace the matrix factorizations (from the right) given in 1 by twisted algebra computation, we nead to consider similar factorizations (but from the left). Here we used factorizations from the left, because they are more suitable for computing constants in the algebra of noncommuting polynomials (this will be elaborated in a fortcoming paper). 1 S. Meljanac, D. Svrtan, Determinants and inversion of Gram matrices in Fock representation of q kl -canonical commutation relations and applications to hyperplane arrangements and quantum groups. Proof of an extension of Zagier s conjecture, arxiv:math-ph/ vl, 26 Apr S. Meljanac, D. Svrtan, Study of Gram matrices in Fock representation of multiparametric canonical commutation relations, extended Zagier s conjecture, hyperplane arrangements and quantum groups, Math. Commun., 1 (1996), M. Sošić (University of Rijeka) Some identities August 8, / 21
SOME FACTORIZATIONS IN THE TWISTED GROUP ALGEBRA OF SYMMETRIC GROUPS. University of Rijeka, Croatia
GLASNIK MATEMATIČKI Vol. 5171)2016), 1 15 SOME FACTORIZATIONS IN THE TWISTED GROUP ALGEBRA OF SYMMETRIC GROUPS Milena Sošić University of Rijeka, Croatia Abstract. In this paper we will give a similar
More information120A LECTURE OUTLINES
120A LECTURE OUTLINES RUI WANG CONTENTS 1. Lecture 1. Introduction 1 2 1.1. An algebraic object to study 2 1.2. Group 2 1.3. Isomorphic binary operations 2 2. Lecture 2. Introduction 2 3 2.1. The multiplication
More informationMathematical Structures Combinations and Permutations
Definitions: Suppose S is a (finite) set and n, k 0 are integers The set C(S, k) of k - combinations consists of all subsets of S that have exactly k elements The set P (S, k) of k - permutations consists
More informationAuslander s Theorem for permutation actions on noncommutative algebras
Auslander s Theorem for permutation actions on noncommutative algebras (arxiv:1705.00068) Jason Gaddis Miami University Joint with Ellen Kirkman, W. Frank Moore, Robert Won Invariant Theory Throughout,
More informationFinitely presented algebras defined by homogeneous semigroup relations
Finitely presented algebras defined by homogeneous semigroup relations Aachen, March 2010 Plan of the talk 1. motivating problems 2. algebras defined by homogeneous semigroup presentations 3. special classes
More informationAuslander s Theorem for permutation actions on noncommutative algebras
Auslander s Theorem for permutation actions on noncommutative algebras (arxiv:1705.00068) Jason Gaddis Miami University Introduction This project is joint work with my collaborators at Wake Forest University.
More informationMATH 433 Applied Algebra Lecture 22: Review for Exam 2.
MATH 433 Applied Algebra Lecture 22: Review for Exam 2. Topics for Exam 2 Permutations Cycles, transpositions Cycle decomposition of a permutation Order of a permutation Sign of a permutation Symmetric
More informationSome practice problems for midterm 2
Some practice problems for midterm 2 Kiumars Kaveh November 14, 2011 Problem: Let Z = {a G ax = xa, x G} be the center of a group G. Prove that Z is a normal subgroup of G. Solution: First we prove Z is
More informationHigher Bruhat order on Weyl groups of Type B
Mentor: Daniel Thompson Massachusetts Institute of Technology PRIMES-USA, 2013 Outline 1 Purpose 2 Symmetric Group Inversions Bruhat Graph 3 Results/Conjectures Purpose Purpose For Weyl Groups of Type
More informationTHREE LECTURES ON QUASIDETERMINANTS
THREE LECTURES ON QUASIDETERMINANTS Robert Lee Wilson Department of Mathematics Rutgers University The determinant of a matrix with entries in a commutative ring is a main organizing tool in commutative
More informationarxiv:math/ v1 [math.qa] 29 Dec 2003
THE ENERGY OPERATOR FOR INFINITE STATISTICS SONIA STANCIU arxiv:math/0312488v1 [math.qa] 29 Dec 2003 Abstract. We construct the energy operator for particles obeying infinite statistics defined by a q-deformation
More informationTeddy Einstein Math 4320
Teddy Einstein Math 4320 HW4 Solutions Problem 1: 2.92 An automorphism of a group G is an isomorphism G G. i. Prove that Aut G is a group under composition. Proof. Let f, g Aut G. Then f g is a bijective
More informationAlgebra Qualifying Exam Solutions January 18, 2008 Nick Gurski 0 A B C 0
1. Show that if B, C are flat and Algebra Qualifying Exam Solutions January 18, 2008 Nick Gurski 0 A B C 0 is exact, then A is flat as well. Show that the same holds for projectivity, but not for injectivity.
More informationSection 19 Integral domains
Section 19 Integral domains Instructor: Yifan Yang Spring 2007 Observation and motivation There are rings in which ab = 0 implies a = 0 or b = 0 For examples, Z, Q, R, C, and Z[x] are all such rings There
More informationPart IV. Rings and Fields
IV.18 Rings and Fields 1 Part IV. Rings and Fields Section IV.18. Rings and Fields Note. Roughly put, modern algebra deals with three types of structures: groups, rings, and fields. In this section we
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationDefinitions, Theorems and Exercises. Abstract Algebra Math 332. Ethan D. Bloch
Definitions, Theorems and Exercises Abstract Algebra Math 332 Ethan D. Bloch December 26, 2013 ii Contents 1 Binary Operations 3 1.1 Binary Operations............................... 4 1.2 Isomorphic Binary
More informationFROM PARKING FUNCTIONS TO GELFAND PAIRS
FROM PARKING FUNCTIONS TO GELFAND PAIRS KÜRŞAT AKER, MAHİR BİLEN CAN Abstract. A pair (G, K) of a group and its subgroup is called a Gelfand pair if the induced trivial representation of K on G is multiplicity
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More informationAbstract Algebra, Second Edition, by John A. Beachy and William D. Blair. Corrections and clarifications
1 Abstract Algebra, Second Edition, by John A. Beachy and William D. Blair Corrections and clarifications Note: Some corrections were made after the first printing of the text. page 9, line 8 For of the
More informationApprentice Program: Linear Algebra
Apprentice Program: Linear Algebra Instructor: Miklós Abért Notes taken by Matt Holden and Kate Ponto June 26,2006 1 Matrices An n k matrix A over a ring R is a collection of nk elements of R, arranged
More informationCombinatorial Commutative Algebra, Graph Colorability, and Algorithms
I G,k = g 1,...,g n Combinatorial Commutative Algebra, Graph Colorability, and Algorithms Chris Hillar (University of California, Berkeley) Joint with Troels Windfeldt! (University of Copenhagen)! Outline
More informationDeterminants - Uniqueness and Properties
Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations
More informationVector Spaces - Definition
Vector Spaces - Definition Definition Let V be a set of vectors equipped with two operations: vector addition and scalar multiplication. Then V is called a vector space if for all vectors u,v V, the following
More informationQuotient Numerical Semigroups (work in progress)
Quotient Numerical Semigroups (work in progress) Vítor Hugo Fernandes FCT-UNL/CAUL (joint work with Manuel Delgado) February 5, 2010 Iberian meeting on numerical semigroups Granada 2010 2010.02.03-05 (Universidad
More informationA MARKOV CHAIN ON THE SYMMETRIC GROUP WHICH IS SCHUBERT POSITIVE?
A MARKOV CHAIN ON THE SYMMETRIC GROUP WHICH IS SCHUBERT POSITIVE? THOMAS LAM AND LAUREN WILLIAMS Abstract. We study a multivariate Markov chain on the symmetric group with remarkable enumerative properties.
More informationIntroduction to orthogonal polynomials. Michael Anshelevich
Introduction to orthogonal polynomials Michael Anshelevich November 6, 2003 µ = probability measure on R with finite moments m n (µ) = R xn dµ(x)
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationStirling Numbers of the 1st Kind
Daniel Reiss, Colebrook Jackson, Brad Dallas Western Washington University November 28, 2012 Introduction The set of all permutations of a set N is denoted S(N), while the set of all permutations of {1,
More informationInvariant Theory of AS-Regular Algebras: A Survey
Invariant Theory of AS-Regular Algebras: A Survey Ellen Kirkman Maurice Auslander Distinguished Lectures and International Conference April 20, 2013 Collaborators Jacque Alev Kenneth Chan James Kuzmanovich
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationAlgebra Ph.D. Entrance Exam Fall 2009 September 3, 2009
Algebra Ph.D. Entrance Exam Fall 2009 September 3, 2009 Directions: Solve 10 of the following problems. Mark which of the problems are to be graded. Without clear indication which problems are to be graded
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationChapter 3. Rings. The basic commutative rings in mathematics are the integers Z, the. Examples
Chapter 3 Rings Rings are additive abelian groups with a second operation called multiplication. The connection between the two operations is provided by the distributive law. Assuming the results of Chapter
More informationNotes on Galois Theory
Notes on Galois Theory Math 431 04/28/2009 Radford We outline the foundations of Galois theory. Most proofs are well beyond the scope of the our course and are therefore omitted. The symbols and in the
More informationNoncommutative invariant theory and Auslander s Theorem
Noncommutative invariant theory and Auslander s Theorem Miami University Algebra Seminar Robert Won Wake Forest University Joint with Jason Gaddis, Ellen Kirkman, and Frank Moore arxiv:1707.02822 November
More informationNote that a unit is unique: 1 = 11 = 1. Examples: Nonnegative integers under addition; all integers under multiplication.
Algebra fact sheet An algebraic structure (such as group, ring, field, etc.) is a set with some operations and distinguished elements (such as 0, 1) satisfying some axioms. This is a fact sheet with definitions
More informationGraph invariants in the spin model
Graph invariants in the spin model Alexander Schrijver 1 Abstract. Given a symmetric n n matrix A, we define, for any graph G, f A (G) := a φ(u),φ(v). φ:v G {1,...,n} uv EG We characterize for which graph
More informationMATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11
MATH 101A: ALGEBRA I, PART D: GALOIS THEORY 11 3. Examples I did some examples and explained the theory at the same time. 3.1. roots of unity. Let L = Q(ζ) where ζ = e 2πi/5 is a primitive 5th root of
More informationReview 1 Math 321: Linear Algebra Spring 2010
Department of Mathematics and Statistics University of New Mexico Review 1 Math 321: Linear Algebra Spring 2010 This is a review for Midterm 1 that will be on Thursday March 11th, 2010. The main topics
More informationRepresentations and Linear Actions
Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category
More informationKevin James. MTHSC 412 Section 3.1 Definition and Examples of Rings
MTHSC 412 Section 3.1 Definition and Examples of Rings A ring R is a nonempty set R together with two binary operations (usually written as addition and multiplication) that satisfy the following axioms.
More informationA short proof of Klyachko s theorem about rational algebraic tori
A short proof of Klyachko s theorem about rational algebraic tori Mathieu Florence Abstract In this paper, we give another proof of a theorem by Klyachko ([?]), which asserts that Zariski s conjecture
More informationAlgebraic reformulation of Connes embedding problem and the free group algebra.
Algebraic reformulation of Connes embedding problem and the free group algebra. Kate Juschenko, Stanislav Popovych Abstract We give a modification of I. Klep and M. Schweighofer algebraic reformulation
More informationDETERMINANTS. , x 2 = a 11b 2 a 21 b 1
DETERMINANTS 1 Solving linear equations The simplest type of equations are linear The equation (1) ax = b is a linear equation, in the sense that the function f(x) = ax is linear 1 and it is equated to
More informationMatrix compositions. Emanuele Munarini. Dipartimento di Matematica Politecnico di Milano
Matrix compositions Emanuele Munarini Dipartimento di Matematica Politecnico di Milano emanuelemunarini@polimiit Joint work with Maddalena Poneti and Simone Rinaldi FPSAC 26 San Diego Motivation: L-convex
More informationMath 3140 Fall 2012 Assignment #4
Math 3140 Fall 2012 Assignment #4 Due Fri., Sept. 28. Remember to cite your sources, including the people you talk to. In this problem set, we use the notation gcd {a, b} for the greatest common divisor
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
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 informationA Note on Cyclic Gradients
A Note on Cyclic Gradients Dan Voiculescu arxiv:math/0005045v1 [math.ra] 4 May 2000 To the memory of Gian-Carlo Rota The cyclic derivative was introduced by G.-C. Rota, B. Sagan and P. R. Stein in [3]
More informationAlgebra. Travis Dirle. December 4, 2016
Abstract Algebra 2 Algebra Travis Dirle December 4, 2016 2 Contents 1 Groups 1 1.1 Semigroups, Monoids and Groups................ 1 1.2 Homomorphisms and Subgroups................. 2 1.3 Cyclic Groups...........................
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More informationMATH 167: APPLIED LINEAR ALGEBRA Chapter 2
MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary
More informationMAT 2037 LINEAR ALGEBRA I web:
MAT 237 LINEAR ALGEBRA I 2625 Dokuz Eylül University, Faculty of Science, Department of Mathematics web: Instructor: Engin Mermut http://kisideuedutr/enginmermut/ HOMEWORK 2 MATRIX ALGEBRA Textbook: Linear
More informationMay 6, Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work.
Math 236H May 6, 2008 Be sure to write your name on your bluebook. Use a separate page (or pages) for each problem. Show all of your work. 1. (15 points) Prove that the symmetric group S 4 is generated
More informationSpherical varieties and arc spaces
Spherical varieties and arc spaces Victor Batyrev, ESI, Vienna 19, 20 January 2017 1 Lecture 1 This is a joint work with Anne Moreau. Let us begin with a few notations. We consider G a reductive connected
More informationMatrix-Matrix Multiplication
Chapter Matrix-Matrix Multiplication In this chapter, we discuss matrix-matrix multiplication We start by motivating its definition Next, we discuss why its implementation inherently allows high performance
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 informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting 7 6 8 1 2 3 5 4 {{1,4,5}, {2,3}, {6,8}, {7}} Jon McCammond U.C. Santa Barbara 1 A common structure The main goal of this talk will be to introduce you to a mathematical
More informationHyperplane Arrangements & Diagonal Harmonics
Hyperplane Arrangements & Diagonal Harmonics Drew Armstrong arxiv:1005.1949 Coinvariants Coinvariants Theorems (Newton-Chevalley-etc): Let S n act on S = C[x 1,..., x n ] by permuting variables. Coinvariants
More informationGALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2)
GALOIS GROUPS OF CUBICS AND QUARTICS (NOT IN CHARACTERISTIC 2) KEITH CONRAD We will describe a procedure for figuring out the Galois groups of separable irreducible polynomials in degrees 3 and 4 over
More informationFix(g). Orb(x) i=1. O i G. i=1. O i. i=1 x O i. = n G
Math 761 Fall 2015 Homework 4 Drew Armstrong Problem 1 Burnside s Lemma Let X be a G-set and for all g G define the set Fix(g : {x X : g(x x} X (a If G and X are finite, prove that Fix(g Stab(x g G x X
More informationINSTITUTE OF MATHEMATICS of the Polish Academy of Sciences
INSTITUTE OF MATHEMATICS of the Polish Academy of Sciences ul. Śniadeckich 8, P.O.B. 21, 00-956 Warszawa 10, Poland http://www.impan.pl IM PAN Preprint 722 (2010) Tomasz Maszczyk On Splitting Polynomials
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationLECTURES MATH370-08C
LECTURES MATH370-08C A.A.KIRILLOV 1. Groups 1.1. Abstract groups versus transformation groups. An abstract group is a collection G of elements with a multiplication rule for them, i.e. a map: G G G : (g
More informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationMATH32031: Coding Theory Part 15: Summary
MATH32031: Coding Theory Part 15: Summary 1 The initial problem The main goal of coding theory is to develop techniques which permit the detection of errors in the transmission of information and, if necessary,
More informationQUALIFYING EXAM IN ALGEBRA August 2011
QUALIFYING EXAM IN ALGEBRA August 2011 1. There are 18 problems on the exam. Work and turn in 10 problems, in the following categories. I. Linear Algebra 1 problem II. Group Theory 3 problems III. Ring
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationGroups and Symmetries
Groups and Symmetries Definition: Symmetry A symmetry of a shape is a rigid motion that takes vertices to vertices, edges to edges. Note: A rigid motion preserves angles and distances. Definition: Group
More informationCHAPTER 14. Ideals and Factor Rings
CHAPTER 14 Ideals and Factor Rings Ideals Definition (Ideal). A subring A of a ring R is called a (two-sided) ideal of R if for every r 2 R and every a 2 A, ra 2 A and ar 2 A. Note. (1) A absorbs elements
More information2 Lecture 2: Logical statements and proof by contradiction Lecture 10: More on Permutations, Group Homomorphisms 31
Contents 1 Lecture 1: Introduction 2 2 Lecture 2: Logical statements and proof by contradiction 7 3 Lecture 3: Induction and Well-Ordering Principle 11 4 Lecture 4: Definition of a Group and examples 15
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationWeak Separation, Pure Domains and Cluster Distance
Discrete Mathematics and Theoretical Computer Science DMTCS vol (subm, by the authors, 1 1 Weak Separation, Pure Domains and Cluster Distance Miriam Farber 1 and Pavel Galashin 1 1 Department of Mathematics,
More informationSome Notes on Distance-Transitive and Distance-Regular Graphs
Some Notes on Distance-Transitive and Distance-Regular Graphs Robert Bailey February 2004 These are notes from lectures given in the Queen Mary Combinatorics Study Group on 13th and 20th February 2004,
More informationHigher Algebra Lecture Notes
Higher Algebra Lecture Notes October 2010 Gerald Höhn Department of Mathematics Kansas State University 138 Cardwell Hall Manhattan, KS 66506-2602 USA gerald@math.ksu.edu This are the notes for my lecture
More informationAuslander s Theorem for permutation actions on noncommutative algebras
Auslander s Theorem for permutation actions on noncommutative algebras Robert Won Joint with Jason Gaddis, Ellen Kirkman, and Frank Moore AMS Western Sectional Meeting, Pullman, WA April 23, 2017 1 / 22
More information(5.11) (Second Isomorphism Theorem) If K G and N G, then K/(N K) = NK/N. PF: Verify N HK. Find a homomorphism f : K HK/N with ker(f) = (N K).
Lecture Note of Week 3 6. Normality, Quotients and Homomorphisms (5.7) A subgroup N satisfying any one properties of (5.6) is called a normal subgroup of G. Denote this fact by N G. The homomorphism π
More informationWhat is a semigroup? What is a group? What is the difference between a semigroup and a group?
The second exam will be on Thursday, July 5, 2012. The syllabus will be Sections IV.5 (RSA Encryption), III.1, III.2, III.3, III.4 and III.8, III.9, plus the handout on Burnside coloring arguments. Of
More informationSupplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.
Glossary 1 Supplement. Dr. Bob s Modern Algebra Glossary Based on Fraleigh s A First Course on Abstract Algebra, 7th Edition, Sections 0 through IV.23 Abelian Group. A group G, (or just G for short) is
More informationOn the Permutation Products of Manifolds
Beiträge zur Algebra und Geometrie Contributions to Algebra and Geometry Volume 42 (2001), No. 2, 547-555. On the Permutation Products of Manifolds Samet Kera Institute of Mathematics, P.O.Box 162, 1000
More informationNILPOTENCY INDEX OF NIL-ALGEBRA OF NIL-INDEX 3
J. Appl. Math. & Computing Vol. 20(2006), No. 1-2, pp. 569-573 NILPOTENCY INDEX OF NIL-ALGEBRA OF NIL-INDEX 3 WOO LEE Abstract. Nagata and Higman proved that any nil-algebra of finite nilindex is nilpotent
More informationON TESTING HAMILTONICITY OF GRAPHS. Alexander Barvinok. July 15, 2014
ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 5, 204 Abstract. Let us fix a function f(n) = o(nlnn) and reals 0 α < β. We present a polynomial time algorithm which, given a directed graph
More informationEXAM 3 MAT 423 Modern Algebra I Fall c d a + c (b + d) d c ad + bc ac bd
EXAM 3 MAT 23 Modern Algebra I Fall 201 Name: Section: I All answers must include either supporting work or an explanation of your reasoning. MPORTANT: These elements are considered main part of the answer
More informationThe Sorting Order on a Coxeter Group
FPSAC 2008, Valparaiso-Viña del Mar, Chile DMTCS proc. AJ, 2008, 411 416 The Sorting Order on a Coxeter Group Drew Armstrong School of Mathematics, University of Minnesota, 206 Church St. SE, Minneapolis,
More informationHomology of Newtonian Coalgebras
Homology of Newtonian Coalgebras Richard EHRENBORG and Margaret READDY Abstract Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed
More informationELG 5372 Error Control Coding. Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes
ELG 5372 Error Control Coding Lecture 12: Ideals in Rings and Algebraic Description of Cyclic Codes Quotient Ring Example + Quotient Ring Example Quotient Ring Recall the quotient ring R={,,, }, where
More informationFoundations of Cryptography
Foundations of Cryptography Ville Junnila viljun@utu.fi Department of Mathematics and Statistics University of Turku 2015 Ville Junnila viljun@utu.fi Lecture 7 1 of 18 Cosets Definition 2.12 Let G be a
More informationORDERS OF ELEMENTS IN A GROUP
ORDERS OF ELEMENTS IN A GROUP KEITH CONRAD 1. Introduction Let G be a group and g G. We say g has finite order if g n = e for some positive integer n. For example, 1 and i have finite order in C, since
More informationProjective Quantum Spaces
DAMTP/94-81 Projective Quantum Spaces U. MEYER D.A.M.T.P., University of Cambridge um102@amtp.cam.ac.uk September 1994 arxiv:hep-th/9410039v1 6 Oct 1994 Abstract. Associated to the standard SU (n) R-matrices,
More informationCHAPTER 3: THE INTEGERS Z
CHAPTER 3: THE INTEGERS Z MATH 378, CSUSM. SPRING 2009. AITKEN 1. Introduction The natural numbers are designed for measuring the size of finite sets, but what if you want to compare the sizes of two sets?
More informationCluster structures on open Richardson varieties and their quantizations
Cluster structures on open Richardson varieties and their quantizations Lie Theory and Its Applications in Physics XI, Varna, June 15-21, 2015 Milen Yakimov (Louisiana State Univ.) Joint work with Tom
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationπ X : X Y X and π Y : X Y Y
Math 6130 Notes. Fall 2002. 6. Hausdorffness and Compactness. We would like to be able to say that all quasi-projective varieties are Hausdorff and that projective varieties are the only compact varieties.
More informationMath 429/581 (Advanced) Group Theory. Summary of Definitions, Examples, and Theorems by Stefan Gille
Math 429/581 (Advanced) Group Theory Summary of Definitions, Examples, and Theorems by Stefan Gille 1 2 0. Group Operations 0.1. Definition. Let G be a group and X a set. A (left) operation of G on X is
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS.
ABSTRACT ALGEBRA 1, LECTURE NOTES 4: DEFINITIONS AND EXAMPLES OF MONOIDS AND GROUPS. ANDREW SALCH 1. Monoids. Definition 1.1. A monoid is a set M together with a function µ : M M M satisfying the following
More informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More information