Group-theoretic approach to Fast Matrix Multiplication
|
|
- Colleen Henry
- 5 years ago
- Views:
Transcription
1 Jenya Kirshtein 1 Group-theoretic approach to Fast Matrix Multiplication Jenya Kirshtein Department of Mathematics University of Denver
2 Jenya Kirshtein 2 References 1. H. Cohn, C. Umans. Group-theoretic approach to Fast Matrix Multiplication. Proceedings of the 44th Annual Symposium on Foundations of Computer Science, H. Cohn, R. Kleinberg, B. Szegedy, C. Umans. Group-theoretic Algorithms for Matrix Multiplication. Proceedings of the 46th Annual Symposium on Foundations of Computer Science, James and Liebeck. Representations and Characters of Groups. Cambridge University Press, I. Martin Isaacs. Character Theory of Finite Groups. AMS Bookstore, 2006.
3 Jenya Kirshtein 3 Matrix multiplication Standard matrix multiplication takes 2n 3 arithmetic operations Strassen suggested O(n 2.81 ) recursive algorithm in 1969 Question: What is the smallest number w such that ǫ > 0 matrix multiplication can be performed in at most O(n w+ǫ )? Question: Is w = 2? The best known bound is w < 2.38 due to Coppersmith and Winograd (1990)
4 Jenya Kirshtein 4 Outline Embed matrices A, B into the elements A, B of the group algebra C[G] Multiplication of A and B in the group algebra is carried out in the Fourier domain after performing the Discrete Fourier Transform (DFT) of A and B The product A B is found by performing the inverse DFT Entries of the matrix AB can be read off from the group algebra product A B We ll consider square matrices and finite groups.
5 Jenya Kirshtein 5 Group Algebra Def: Let G be a finite group and F be a field. A group algebra F[G] of G over F is the set of all linear combinations of elements of G with coefficients in F, with the natural addition and scalar multiplication, and multiplication defined by a g g b h h a g b h f g G,a g F h G,b h F = f G gh=f
6 Jenya Kirshtein 6 Discrete Fourier Transform (DFT) Embed polynomials as elements of the group algebra C[G]: Let G =< z > be a cyclic group of order m 2n. Define D(A) = A = n 1 i=0 a i z i and B = n 1 i=0 b i z i Discrete Fourier Transform is an invertible linear transformation D : C[G] C G, such that ( n 1 ) i=0 a i x i 0, n 1 i=0 a i x i 1,..., n 1 i=0 where x k = e 2πi n k is the n th root of unity. Then A B = D 1 ( D(A)D(B) ) a i x i n 1 Fast Fourier Transform algorithm computes DFT in O(nlog(n)) arithmetic operations.,
7 Jenya Kirshtein 7 Matrices as elements of the group algebra Let F be a field and S, T and U be subsets of G. A = (a s,t ) s S,t T and B = (b t,u ) t T,u U are S T and T U matrices, indexed by elements of S, T and T, U, respectively. Then embed A,B as elements A, B F[G]: A = a s,t s 1 t and B = b t,u t 1 u s S,t T t T,u U
8 Jenya Kirshtein 8 Triple product property Let S G. Let Q(S) denote the right quotient set of S, i.e. Q(S) = { s 1 s 1 2 : s 1 s 2 S } Def: A group G realizes n 1, n 3, n 3 if subsets S 1, S 2, S 3 G s.t. S i = n i and for q i Q(S i ), if q 1 q 2 q 3 = 1 then q 1 = q 2 = q 3 = 1 (equivalently, if q 1 q 2 = q 3 then q 1 = q 2 = q 3 = 1) This condition on S 1, S 2, S 3 is the triple product property.
9 Jenya Kirshtein 9 Theorem [1] Let F be a field. If G realizes < n, n, n >, then the number of field operations required to multiply two n n matrices over F is at most the number of operations required to multiply two elements of F[G]. Proof. Index A with the sets S, T; B with T, U and AB with S, U. Consider the product in F[G] a st s 1 t b t u 1 t u s S,t T t T,u U By triple product property, ( s 1 t ) ( t 1 u) = s 1 u iff s = s, t = t, u = u, so the coefficient of s 1 u in the product is a st b tu = (AB) su t T
10 Jenya Kirshtein 10 Characters and character degrees of G Def: Let F be R or C. The set of all invertible n n matrices with entries in F, under matrix multiplication, forms a group called the general linear group GL(n, F). Def: The trace of an n n matrix A = (a ij ) is tra = n i=1 a ii. Def: A representation of G over F is a homomorphism ρ : G GL(n, F) for some integer n (n is the degree of ρ). Def: Suppose ρ is a representation of G. With each n n matrix ρ(g) (g G) we associate the complex number tr(ρ(g)), which we call χ(g). The function χ : G C is called the character of the representation ρ of G. Def: If χ is a character of G, then χ(1) is called a degree of χ.
11 Jenya Kirshtein 11 Theorem [2] Suppose G realizes n, n, n and the character degrees of G are {d i }. Then n w i d w i Theorem [3] Let G be a group with the character degrees {d i }. Then G = i d2 i Corollary [2] Suppose G realizes n, n, n and has largest character degree d. Then n w d w 2 G Question [1] Does there exist a finite group G that realizes n, n, n and has character degrees {d i } such that n 3 > i d 3 i, i.e. G gives a nontrivial bound on w.
12 Jenya Kirshtein 12 Example Def: If G is a group and X is a set, then a (left) group action of G on X is a binary function G X X denoted (g, x) g x, which satisfies the following two axioms: 1. (gh) x = g (h x) g, h G, x X; 2. 1 x = x x X (1 is the identity element of G). Def: If G and H are groups with a left action of G on H, then the semidirect product H G is the set H G with the multiplication law (h 1, g 1 ) (h 2, g 2 ) = (h 1 (g 1 h 2 ), g 1 g 2 ).
13 Jenya Kirshtein 13 Example Denote Cyc n the cyclic group of order n. Let H = Cyc 3 n and G = H 2 Cyc 2 Cyc 2 = {1, z} acts on H 2 by switching the two factors, then G = { (a, b)z i : a, b H, i {0, 1} } Let H 1, H 2, H 3 H be the three factors of Cyc n in H, H 4 = H 1. Define subsets S 1, S 2, S 3 G by S i = { (a, b)z j : a H i \ {0}, b H i+1, j {0, 1} } S 1, S 2, S 3 satisfy the triple product property.
14 Jenya Kirshtein 14 Example H = Cyc 3 n and G = H 2 Cyc 2 S i = { (a, b)z j : a H i \ {0},b H i+1, j {0, 1} } Theorem [4] Let G be nonabelian group and m be an integer. If there exists abelian H G of index m, then character degrees of G are 1 and m. Theorem If H G and [G : H] = 2, then H G. Since H 2 is an abelian subgroup of G of index [G : H] = G H = 2, character degrees of G are at most 2. Then since i d2 i = G, i d3 i max {d i} i d2 i 2 G = 4n6 Also, S i = 2n(n 1) and S 1 S 2 S 3 = 8n 3 (n 1) 3, so we have S 1 S 2 S 3 > i d3 i for n 5.
15 Jenya Kirshtein 15 Example By Corollary, S 1 w d w 2 G or 2n(n 1) w 2 w 2 2n 6, which leads to w 6lnn ln2 ln(n(n 1)). The best bound on w (w ) is achieved by setting n = 17.
16 Jenya Kirshtein 16 Other results Uniquely Solvable Puzzles prove w < 2.48 Local Uniquely Solvable Puzzles prove w < 2.41 and w < Conjecture that a Strong Uniquely Solvable Puzzle capacity equals 3/2 2 3 would imply that w = 2 Conjecture about the existence for any n of an abelian group G with n pairs of subsets A i, B i satisfying the simultaneous double product property such that G = n 2+o(1) and A i B i n 2 o(1) would imply that w = 2
17 Jenya Kirshtein 17 Thank you!
Approaches to bounding the exponent of matrix multiplication
Approaches to bounding the exponent of matrix multiplication Chris Umans Caltech Based on joint work with Noga Alon, Henry Cohn, Bobby Kleinberg, Amir Shpilka, Balazs Szegedy Simons Institute Sept. 7,
More informationA PROOF OF BURNSIDE S p a q b THEOREM
A PROOF OF BURNSIDE S p a q b THEOREM OBOB Abstract. We prove that if p and q are prime, then any group of order p a q b is solvable. Throughout this note, denote by A the set of algebraic numbers. We
More informationGroup-theoretic Algorithms for Matrix Multiplication
Group-theoretic Algorithms for Matrix Multiplication Henry Cohn Robert Kleinberg Balázs Szegedy Christopher Umans Abstract We further develop the group-theoretic approach to fast matrix multiplication
More informationFast Matrix Multiplication by Group Algebras
Fast Matrix Multiplication by Group Algebras A Master s Thesis submitted to the Faculty of the WORCESTER POLYTECHNIC INSTITUTE in partial fulfillment of the requirements for the Degree of Master of Science
More information(Group-theoretic) Fast Matrix Multiplication
(Group-theoretic) Fast Matrix Multiplication Ivo Hedtke Data Structures and Efficient Algorithms Group (Prof Dr M Müller-Hannemann) Martin-Luther-University Halle-Wittenberg Institute of Computer Science
More informationI. Approaches to bounding the exponent of matrix multiplication
I. Approaches to bounding the exponent of matrix multiplication Chris Umans Caltech Based on joint work with Noga Alon, Henry Cohn, Bobby Kleinberg, Amir Shpilka, Balazs Szegedy Modern Applications of
More informationREPRESENTATIONS AND CHARACTERS OF FINITE GROUPS
SUMMER PROJECT REPRESENTATIONS AND CHARACTERS OF FINITE GROUPS September 29, 2017 Miriam Norris School of Mathematics Contents 0.1 Introduction........................................ 2 0.2 Representations
More informationis an isomorphism, and V = U W. Proof. Let u 1,..., u m be a basis of U, and add linearly independent
Lecture 4. G-Modules PCMI Summer 2015 Undergraduate Lectures on Flag Varieties Lecture 4. The categories of G-modules, mostly for finite groups, and a recipe for finding every irreducible G-module of a
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 informationRepresentation Theory
Part II Year 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2018 Paper 1, Section II 19I 93 (a) Define the derived subgroup, G, of a finite group G. Show that if χ is a linear character
More informationMath 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9
Math 3121, A Summary of Sections 0,1,2,4,5,6,7,8,9 Section 0. Sets and Relations Subset of a set, B A, B A (Definition 0.1). Cartesian product of sets A B ( Defintion 0.4). Relation (Defintion 0.7). Function,
More informationA Little Beyond: Linear Algebra
A Little Beyond: Linear Algebra Akshay Tiwary March 6, 2016 Any suggestions, questions and remarks are welcome! 1 A little extra Linear Algebra 1. Show that any set of non-zero polynomials in [x], no two
More informationMatrix Multiplication
Matrix Multiplication Matrix Multiplication Matrix multiplication. Given two n-by-n matrices A and B, compute C = AB. n c ij = a ik b kj k=1 c 11 c 12 c 1n c 21 c 22 c 2n c n1 c n2 c nn = a 11 a 12 a 1n
More information1. Group Theory Permutations.
1.1. Permutations. 1. Group Theory Problem 1.1. Let G be a subgroup of S n of index 2. Show that G = A n. Problem 1.2. Find two elements of S 7 that have the same order but are not conjugate. Let π S 7
More informationGROUPS OF ORDER p 3 KEITH CONRAD
GROUPS OF ORDER p 3 KEITH CONRAD For any prime p, we want to describe the groups of order p 3 up to isomorphism. From the cyclic decomposition of finite abelian groups, there are three abelian groups of
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 informationSection 3 Isomorphic Binary Structures
Section 3 Isomorphic Binary Structures Instructor: Yifan Yang Fall 2006 Outline Isomorphic binary structure An illustrative example Definition Examples Structural properties Definition and examples Identity
More informationINTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS
INTRODUCTION TO REPRESENTATION THEORY AND CHARACTERS HANMING ZHANG Abstract. In this paper, we will first build up a background for representation theory. We will then discuss some interesting topics in
More information1 Finite abelian groups
Last revised: May 16, 2014 A.Miller M542 www.math.wisc.edu/ miller/ Each Problem is due one week from the date it is assigned. Do not hand them in early. Please put them on the desk in front of the room
More informationQuantum Computing Lecture Notes, Extra Chapter. Hidden Subgroup Problem
Quantum Computing Lecture Notes, Extra Chapter Hidden Subgroup Problem Ronald de Wolf 1 Hidden Subgroup Problem 1.1 Group theory reminder A group G consists of a set of elements (which is usually denoted
More informationAlgebraic Structures Exam File Fall 2013 Exam #1
Algebraic Structures Exam File Fall 2013 Exam #1 1.) Find all four solutions to the equation x 4 + 16 = 0. Give your answers as complex numbers in standard form, a + bi. 2.) Do the following. a.) Write
More informationREPRESENTATION THEORY NOTES FOR MATH 4108 SPRING 2012
REPRESENTATION THEORY NOTES FOR MATH 4108 SPRING 2012 JOSEPHINE YU This note will cover introductory material on representation theory, mostly of finite groups. The main references are the books of Serre
More informationSimple groups and the classification of finite groups
Simple groups and the classification of finite groups 1 Finite groups of small order How can we describe all finite groups? Before we address this question, let s write down a list of all the finite groups
More informationThe two-modular Fourier transform of binary functions
of binary functions Yi Hong (Monash University, Melbourne, Australia) (Monash University, Melbourne, Australia) Jean-Claude Belfiore (Telecom ParisTech) The Discrete Fourier Transform N samples of a discrete-time
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 informationALGEBRAIC GROUPS J. WARNER
ALGEBRAIC GROUPS J. WARNER Let k be an algebraically closed field. varieties unless otherwise stated. 1. Definitions and Examples For simplicity we will work strictly with affine Definition 1.1. An algebraic
More informationCHARACTERS OF FINITE GROUPS.
CHARACTERS OF FINITE GROUPS. ANDREI YAFAEV As usual we consider a finite group G and the ground field F = C. Let U be a C[G]-module and let g G. Then g is represented by a matrix [g] in a certain basis.
More informationCombinatorics of p-ary Bent Functions
Combinatorics of p-ary Bent Functions MIDN 1/C Steven Walsh United States Naval Academy 25 April 2014 Objectives Introduction/Motivation Definitions Important Theorems Main Results: Connecting Bent Functions
More informationMath 306 Topics in Algebra, Spring 2013 Homework 7 Solutions
Math 306 Topics in Algebra, Spring 203 Homework 7 Solutions () (5 pts) Let G be a finite group. Show that the function defines an inner product on C[G]. We have Also Lastly, we have C[G] C[G] C c f + c
More informationSince G is a compact Lie group, we can apply Schur orthogonality to see that G χ π (g) 2 dg =
Problem 1 Show that if π is an irreducible representation of a compact lie group G then π is also irreducible. Give an example of a G and π such that π = π, and another for which π π. Is this true for
More informationNotation. 0,1,2,, 1 with addition and multiplication modulo
Notation Q,, The set of all natural numbers 1,2,3, The set of all integers The set of all rational numbers The set of all real numbers The group of permutations of distinct symbols 0,1,2,,1 with addition
More informationALGEBRA QUALIFYING EXAM SPRING 2012
ALGEBRA QUALIFYING EXAM SPRING 2012 Work all of the problems. Justify the statements in your solutions by reference to specific results, as appropriate. Partial credit is awarded for partial solutions.
More informationExercises on chapter 4
Exercises on chapter 4 Always R-algebra means associative, unital R-algebra. (There are other sorts of R-algebra but we won t meet them in this course.) 1. Let A and B be algebras over a field F. (i) Explain
More informationIntroduction to finite fields
Chapter 7 Introduction to finite fields This chapter provides an introduction to several kinds of abstract algebraic structures, particularly groups, fields, and polynomials. Our primary interest is in
More informationRepresentation Theory. Ricky Roy Math 434 University of Puget Sound
Representation Theory Ricky Roy Math 434 University of Puget Sound May 2, 2010 Introduction In our study of group theory, we set out to classify all distinct groups of a given order up to isomorphism.
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 informationAlgebra SEP Solutions
Algebra SEP Solutions 17 July 2017 1. (January 2017 problem 1) For example: (a) G = Z/4Z, N = Z/2Z. More generally, G = Z/p n Z, N = Z/pZ, p any prime number, n 2. Also G = Z, N = nz for any n 2, since
More informationHow to find good starting tensors for matrix multiplication
How to find good starting tensors for matrix multiplication Markus Bläser Saarland University Matrix multiplication z,... z,n..... z n,... z n,n = x,... x,n..... x n,... x n,n y,... y,n..... y n,... y
More informationCHARACTER THEORY OF FINITE GROUPS. Chapter 1: REPRESENTATIONS
CHARACTER THEORY OF FINITE GROUPS Chapter 1: REPRESENTATIONS G is a finite group and K is a field. A K-representation of G is a homomorphism X : G! GL(n, K), where GL(n, K) is the group of invertible n
More informationM3/4/5P12 GROUP REPRESENTATION THEORY
M3/4/5P12 GROUP REPRESENTATION THEORY JAMES NEWTON Course Arrangements Send comments, questions, requests etc. to j.newton@imperial.ac.uk. The course homepage is http://wwwf.imperial.ac.uk/ jjmn07/m3p12.html.
More informationMatrix multiplication: a group-theoretic approach
CSG399: Gems of Theoretical Computer Science. Lec. 21-23. Mar. 27-Apr. 3, 2009. Instructor: Emanuele Viola Scribe: Ravi Sundaram Matrix multiplication: a roup-theoretic approach Given two n n matrices
More informationSOLVABLE FUSION CATEGORIES AND A CATEGORICAL BURNSIDE S THEOREM
SOLVABLE FUSION CATEGORIES AND A CATEGORICAL BURNSIDE S THEOREM PAVEL ETINGOF The goal of this talk is to explain the classical representation-theoretic proof of Burnside s theorem in finite group theory,
More informationNATIONAL BOARD FOR HIGHER MATHEMATICS. M. A. and M.Sc. Scholarship Test. September 22, Time Allowed: 150 Minutes Maximum Marks: 30
NATIONAL BOARD FOR HIGHER MATHEMATICS M A and MSc Scholarship Test September 22, 2018 Time Allowed: 150 Minutes Maximum Marks: 30 Please read, carefully, the instructions that follow INSTRUCTIONS TO CANDIDATES
More informationCongruent Number Problem and Elliptic curves
Congruent Number Problem and Elliptic curves December 12, 2010 Contents 1 Congruent Number problem 2 1.1 1 is not a congruent number.................................. 2 2 Certain Elliptic Curves 4 3 Using
More informationAlgebraic structures I
MTH5100 Assignment 1-10 Algebraic structures I For handing in on various dates January March 2011 1 FUNCTIONS. Say which of the following rules successfully define functions, giving reasons. For each one
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 information(d) Since we can think of isometries of a regular 2n-gon as invertible linear operators on R 2, we get a 2-dimensional representation of G for
Solutions to Homework #7 0. Prove that [S n, S n ] = A n for every n 2 (where A n is the alternating group). Solution: Since [f, g] = f 1 g 1 fg is an even permutation for all f, g S n and since A n is
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationMIMO Capacities : Eigenvalue Computation through Representation Theory
MIMO Capacities : Eigenvalue Computation through Representation Theory Jayanta Kumar Pal, Donald Richards SAMSI Multivariate distributions working group Outline 1 Introduction 2 MIMO working model 3 Eigenvalue
More informationALGEBRAIC AND MULTILINEAR-ALGEBRAIC TECHNIQUES FOR FAST MATRIX MULTIPLICATION GUY MATHIAS GOUAYA. submitted in accordance with the requirements
ALGEBRAIC AND MULILINEAR-ALGEBRAIC ECHNIQUES FOR FAS MARIX MULIPLICAION by GUY MAHIAS GOUAYA submitted in accordance with the requirements for the degree of MASER OF SCIENCES in the subject Applied Mathematics
More informationand this makes M into an R-module by (1.2). 2
1. Modules Definition 1.1. Let R be a commutative ring. A module over R is set M together with a binary operation, denoted +, which makes M into an abelian group, with 0 as the identity element, together
More informationRepresentation Theory
Representation Theory Representations Let G be a group and V a vector space over a field k. A representation of G on V is a group homomorphism ρ : G Aut(V ). The degree (or dimension) of ρ is just dim
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationRepresentations. 1 Basic definitions
Representations 1 Basic definitions If V is a k-vector space, we denote by Aut V the group of k-linear isomorphisms F : V V and by End V the k-vector space of k-linear maps F : V V. Thus, if V = k n, then
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011
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 informationCMPSCI611: Three Divide-and-Conquer Examples Lecture 2
CMPSCI611: Three Divide-and-Conquer Examples Lecture 2 Last lecture we presented and analyzed Mergesort, a simple divide-and-conquer algorithm. We then stated and proved the Master Theorem, which gives
More informationReview of Linear Algebra
Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space
More informationOn a question of B.H. Neumann
On a question of B.H. Neumann Robert Guralnick Department of Mathematics University of Southern California E-mail: guralnic@math.usc.edu Igor Pak Department of Mathematics Massachusetts Institute of Technology
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IA Tuesday, 4 June, 2013 1:30 pm to 4:30 pm PAPER 3 Before you begin read these instructions carefully. The examination paper is divided into two sections. Each question in Section
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 informationMath Introduction to Modern Algebra
Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains
More informationMATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions
MATH 3030, Abstract Algebra Winter 2012 Toby Kenney Sample Midterm Examination Model Solutions Basic Questions 1. Give an example of a prime ideal which is not maximal. In the ring Z Z, the ideal {(0,
More informationCHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES
CHARACTERISTIC POLYNOMIAL PATTERNS IN DIFFERENCE SETS OF MATRICES MICHAEL BJÖRKLUND AND ALEXANDER FISH Abstract. We show that for every subset E of positive density in the set of integer squarematrices
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationCharacters and triangle generation of the simple Mathieu group M 11
SEMESTER PROJECT Characters and triangle generation of the simple Mathieu group M 11 Under the supervision of Prof. Donna Testerman Dr. Claude Marion Student: Mikaël Cavallin September 11, 2010 Contents
More informationKevin James. MTHSC 412 Section 3.4 Cyclic Groups
MTHSC 412 Section 3.4 Cyclic Groups Definition If G is a cyclic group and G =< a > then a is a generator of G. Definition If G is a cyclic group and G =< a > then a is a generator of G. Example 1 Z is
More informationarxiv:math/ v1 [math.gt] 27 Oct 2000
arxiv:math/0010267v1 [math.gt] 27 Oct 2000 ON THE LINEARITY OF CERTAIN MAPPING CLASS GROUPS MUSTAFA KORKMAZ Abstract. S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation
More information18.702: Quiz 1 Solutions
MIT MATHEMATICS 18.702: Quiz 1 Solutions February 28 2018 There are four problems on this quiz worth equal value. You may quote without proof any result stated in class or in the assigned reading, unless
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 informationarxiv: v1 [math.rt] 16 Jun 2015
Representations of group rings and groups Ted Hurley arxiv:5060549v [mathrt] 6 Jun 205 Abstract An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is
More informationThe Sato-Tate conjecture for abelian varieties
The Sato-Tate conjecture for abelian varieties Andrew V. Sutherland Massachusetts Institute of Technology March 5, 2014 Mikio Sato John Tate Joint work with F. Fité, K.S. Kedlaya, and V. Rotger, and also
More informationPresentation 1
18.704 Presentation 1 Jesse Selover March 5, 2015 We re going to try to cover a pretty strange result. It might seem unmotivated if I do a bad job, so I m going to try to do my best. The overarching theme
More informationCLASSICAL GROUPS DAVID VOGAN
CLASSICAL GROUPS DAVID VOGAN 1. Orthogonal groups These notes are about classical groups. That term is used in various ways by various people; I ll try to say a little about that as I go along. Basically
More informationHow to Multiply. 5.5 Integer Multiplication. Complex Multiplication. Integer Arithmetic. Complex multiplication. (a + bi) (c + di) = x + yi.
How to ultiply Slides by Kevin Wayne. Copyright 5 Pearson-Addison Wesley. All rights reserved. integers, matrices, and polynomials Complex ultiplication Complex multiplication. a + bi) c + di) = x + yi.
More informationMASCHKE S THEOREM. 1. Introduction
MASCHKE S THEOREM ABIGAIL SHELDON 1. Introduction Heinrich Maschke was born on October 24, 1853 in Breslau, Germany. He started his studies at the University of Heidelberg in 1872, studying there under
More informationFast Approximate Matrix Multiplication by Solving Linear Systems
Electronic Colloquium on Computational Complexity, Report No. 117 (2014) Fast Approximate Matrix Multiplication by Solving Linear Systems Shiva Manne 1 and Manjish Pal 2 1 Birla Institute of Technology,
More informationSUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT
SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.
More informationD-MATH Algebra I HS 2013 Prof. Brent Doran. Solution 3. Modular arithmetic, quotients, product groups
D-MATH Algebra I HS 2013 Prof. Brent Doran Solution 3 Modular arithmetic, quotients, product groups 1. Show that the functions f = 1/x, g = (x 1)/x generate a group of functions, the law of composition
More informationCSIR - Algebra Problems
CSIR - Algebra Problems N. Annamalai DST - INSPIRE Fellow (SRF) Department of Mathematics Bharathidasan University Tiruchirappalli -620024 E-mail: algebra.annamalai@gmail.com Website: https://annamalaimaths.wordpress.com
More informationIRREDUCIBLE EXTENSIONS OF CHARACTERS
IRREDUCIBLE EXTENSIONS OF CHARACTERS by I. M. Isaacs Department of Mathematics University of Wisconsin 480 Lincoln Drive, Madison, WI 53706 USA E-mail: isaacs@math.wisc.edu Gabriel Navarro Departament
More informationAlgebraic Number Theory and Representation Theory
Algebraic Number Theory and Representation Theory MIT PRIMES Reading Group Jeremy Chen and Tom Zhang (mentor Robin Elliott) December 2017 Jeremy Chen and Tom Zhang (mentor Robin Algebraic Elliott) Number
More informationRings If R is a commutative ring, a zero divisor is a nonzero element x such that xy = 0 for some nonzero element y R.
Rings 10-26-2008 A ring is an abelian group R with binary operation + ( addition ), together with a second binary operation ( multiplication ). Multiplication must be associative, and must distribute over
More informationLiouvillian solutions of third order differential equations
Article Submitted to Journal of Symbolic Computation Liouvillian solutions of third order differential equations Felix Ulmer IRMAR, Université de Rennes, 0 Rennes Cedex, France felix.ulmer@univ-rennes.fr
More informationMath 594. Solutions 5
Math 594. Solutions 5 Book problems 6.1: 7. Prove that subgroups and quotient groups of nilpotent groups are nilpotent (your proof should work for infinite groups). Give an example of a group G which possesses
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationMathematics for Cryptography
Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1
More informationAdditional notes on group representations Hjalmar Rosengren, 30 September 2015
Additional notes on group representations Hjalmar Rosengren, 30 September 2015 Throughout, group means finite group and representation means finitedimensional representation over C. Interpreting the character
More informationABSTRACT ALGEBRA 1, LECTURES NOTES 5: SUBGROUPS, CONJUGACY, NORMALITY, QUOTIENT GROUPS, AND EXTENSIONS.
ABSTRACT ALGEBRA 1, LECTURES NOTES 5: SUBGROUPS, CONJUGACY, NORMALITY, QUOTIENT GROUPS, AND EXTENSIONS. ANDREW SALCH 1. Subgroups, conjugacy, normality. I think you already know what a subgroup is: Definition
More informationGroup Theory (Math 113), Summer 2014
Group Theory (Math 113), Summer 2014 George Melvin University of California, Berkeley (July 8, 2014 corrected version) Abstract These are notes for the first half of the upper division course Abstract
More informationMAT 445/ INTRODUCTION TO REPRESENTATION THEORY
MAT 445/1196 - INTRODUCTION TO REPRESENTATION THEORY CHAPTER 1 Representation Theory of Groups - Algebraic Foundations 1.1 Basic definitions, Schur s Lemma 1.2 Tensor products 1.3 Unitary representations
More informationThree-dimensional imprimitive representations of PSL 2 (Z) and their associated vector-valued modular forms
Three-dimensional imprimitive representations of PSL 2 (Z) and their associated vector-valued modular forms U-M Automorphic forms workshop, March 2015 1 Definition 2 3 Let Γ = PSL 2 (Z) Write ( 0 1 S =
More informationDifference sets and Hadamard matrices
Difference sets and Hadamard matrices Padraig Ó Catháin National University of Ireland, Galway 14 March 2012 Outline 1 (Finite) Projective planes 2 Symmetric Designs 3 Difference sets 4 Doubly transitive
More informationDIHEDRAL GROUPS II KEITH CONRAD
DIHEDRAL GROUPS II KEITH CONRAD We will characterize dihedral groups in terms of generators and relations, and describe the subgroups of D n, including the normal subgroups. We will also introduce an infinite
More informationIntroduction to Group Theory
Chapter 10 Introduction to Group Theory Since symmetries described by groups play such an important role in modern physics, we will take a little time to introduce the basic structure (as seen by a physicist)
More informationChapter 4 Mathematics of Cryptography
Chapter 4 Mathematics of Cryptography Part II: Algebraic Structures Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4.1 Chapter 4 Objectives To review the concept
More informationMartin Wedel Jacobsen and Jesper Michael Møl ler. UAB Topology Seminar, December 17, 2010
of matrices of fusion categories Martin Wedel Jacobsen and Jesper Michael Møl ler University of Copenhagen UAB Topology Seminar, December 17, 2010 of matrices of fusion categories Outline of talk G is
More informationTopics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem
Topics in Representation Theory: Fourier Analysis and the Peter Weyl Theorem 1 Fourier Analysis, a review We ll begin with a short review of simple facts about Fourier analysis, before going on to interpret
More informationHow large can a finite group of matrices be? Blundon Lecture UNB Fredericton 10/13/2007
GoBack How large can a finite group of matrices be? Blundon Lecture UNB Fredericton 10/13/2007 Martin Lorenz Temple University, Philadelphia Overview Groups... and some of their uses Martin Lorenz How
More information