Matrix multiplication: a group-theoretic approach
|
|
- Peregrine Cameron
- 6 years ago
- Views:
Transcription
1 CSG399: Gems of Theoretical Computer Science. Lec Mar. 27-Apr. 3, Instructor: Emanuele Viola Scribe: Ravi Sundaram Matrix multiplication: a roup-theoretic approach Given two n n matrices A and B we want to compute their product c = A B. The trivial alorithm runs in time n 3 (this and the next runnin times are meant up to lower order factors n o(1) ). In 1967 Strassen improved the runnin time to n 2.81 and in 1990 Coppersmith and Winorad improved it further to n 2.38, which continues to be the best to date. Since the output is of size n 2 it is clear that the best possible runnin time one can aspire for is n 2. Remarkably, it is believed that this is attainable. In this lecture we present a roup-theoretic approach to matrix multiplication developed by H. Cohn and C. Umans (2003), later with R. Kleinber and B. Szeedy (2005). This approach ives a conceptually clean way to et fast alorithms, and also provides specific conjectures that if proven yield the optimal n 2 runnin time. In what follows we first present some notation, then we cover polynomial multiplication, and lastly we present matrix multiplication. 1 Notation Let G be a roup. Definition 1. The roup alebra C[G] is the set of formal sums G a where a C. An element of the roup alebra can be thouht of as a vector of G complex numbers (a 1, a 2,..., a G ). The operations of addition and multiplication are as expected: ( ) ( ) a + b := (a + b ), ( a ) ( b ) := c where c = a i b j. 2 Polynomial Multiplication i,j:i j= To explain matrix multiplication, it is best to start with polynomial multiplication. Consider the task of multiplyin two polynomials A(x) = n i=0 xi a i and B(x) = n i=0 xi b i. We think of each polynomial as bein iven as a vector of coefficients, and we are interested in computin the vector of coefficients of the product polynomial C(x) := A(x) B(x) = 2n i=0 xi c i, where c i = i j=0 a j b i j. The naive alorithm for multiplyin two n-deree polynomials takes time n 2. The Fast Fourier Transform achieves time n (recall in this discussion we are inorin lower order 1
2 factors). The Fourier Transform amounts to interpretin polynomials as elements of a roup alebra, i.e. A(x) = n i=0 xi a i can be viewed as an element Ā C[G], where G = Z m for m = O(n) (think of G = { i 0 i m 1}). Observe how multiplication in this roup alebra precisely corresponds to polynomial multiplication (for this to happen one needs to work over a roup of size slihtly larer than n, to avoid wrappin around, this is why we take the roup size to be O(n) rather than n). Now, the trick in Fast Fourier Transform is to transform the roup alebra into another isomorphic alebra C G such that multiplication in the oriinal roup alebra C[G] becomes point-wise multiplication in the new alebra C G (addition continues to be point-wise in the new alebra as well). The speedup of the Fast Fourier Transform comes from the fact that such an isomorphism exists and that it can be computed efficiently. This can be visualized via the followin diaram: A(x) = n i=0 xi a i B(x) = n i=0 xi b i C(x) := ( 2n i ) i=0 xi j=0 a j b i j Ā C[G] B C[G] C C[G] (convolution) C G C G C G (point-wise) time n 3 Matrix Multiplication The basic idea for matrix multiplication is similar to that of Fourier Transform: we embed matrices as elements of a roup alebra, and then via a transform we map these into another alebra such that the oriinal multiplication is transformed into component-wise multiplication (of smaller matrices). There are however a few notable differences with polynomial multiplication, arisin from the recursive nature of matrix multiplication. First, for matrix multiplication, the time required to compute the isomorphism is neliible (unlike polynomial multiplication, where speedin up this isomorphism via Fast Fourier Transform is the main source of the overall time improvement); also, the existence of ood alorithms (as measured in terms of multiplications) for a constant-size input implies an asymptotic improvement for all input lenths. We now state the isomorphism theorem without proof. Theorem 2. For every roup G, C[G] C d 1 d 1 C d 2 d 2... C d k d k. The operations in the resultin alebra are component-wise matrix addition and multiplication. The inteers d i are called the character derees of G, or the dimensions of the irreducible representations of G. Countin dimensions we readily see that k i=1 d2 i = G. Moreover, i, d i G / H where H is any abelian subroup of G. Note that if G is abelian then all its character derees are 1. 2
3 Like polynomial multiplication, the roup-theoretic approach to matrix multiplication can be visualized via the followin diaram A n n B n n C = A B n n Ā C[G] B C[G] C C[G] C d 1 d 1... C d k d k C d 1 d 1... C d k d k C d 1 d 1... C d k d k (point-wise) Where to compute the product in the last line we aain use matrix multiplication. The ain will be that that the matrix dimensions d 1,..., d k will be smaller than n. We now proceed to ive the details of the approach. 3.1 Embeddin We now explain how to embed the n n matrices A, B, C into the roup alebra C[G] (for C we are not performin this embeddin directly, but rather think of it when readin the coefficients of C from a roup alebra element, as we explain later). Given 3 sets S 1, S 2, S 3 G, S i = n, we let Ā := 1 s 2 ) A s1 s 2, B := C := ( 1 S 1 1,s 2 S 2 ( 2 S 1 2,s 3 S 3 ( 1 S 1 1,s 3 S 3 2 s 3 ) B s2 s 3, 1 s 3 ) C s1 s 3. This embeddin works when the cancelations in Ā B correspond to those in A B. This is uaranteed whenever the sets satisfy the followin property. Definition 3. The sets S 1, S 2, S 3 satisfy the triple-product property if s i S i, t i S i 2 s 3 = t 1 1 t 3 s i = t i, i 3. The next claim indeed shows that if the sets satisfy that property, then the coefficients of the matrix product appear as coefficients in the roup alebra. Claim 1. If S 1, S 2, S 3 satisfy the triple-product property then (A B) t1 t 3 t 1 1 t 3 in (Ā B), t 1 S 1, t 3 S 3. is the coefficient of 3
4 Proof. We have Ā B = ( 2 s 3 ) A s1 s 2 B t2 s 3, s 1 S 1, s 2, t 2 S 2, s 3 S 3. Since by the triple-product property 2 s 3 multiplies to t 1 1 t 3 only when s 1 = t 1 and s 2 = t 2 and s 3 = t 3, we see that the coefficient of t 1 1 t 3 is s 2 A t1 s 2 B s2 t 3 = (A B) t1 t Runnin time Lookin at the diaram, we see that we reduce multiplication of n n matrices to k matrix multiplications of dimensions d 1,..., d k. Thus, intuitively, is ω is the exponent of the runnin time of matrix multiplication, provided the embeddin works we should have n ω i dω i. This can be formalized in the followin theorem we do not prove. Theorem 4. If there exists S 1, S 2, S 3 G of size n satisfyin the triple-product property then, for ω the exponent of matrix multiplication, n ω i d ω i where the inteers d i are the character derees of G. 3.3 An example Here is a simple example. Let G = Z n Z n Z n = {(a, b, c) 0 a, b, c n}, (a, b, c) (a, b, c ) := (a + a, b + b, c + c ). Let S 1 := {(a, 0, 0) a < n}, S 2 := {(0, b, 0) b < n}, S 3 := {(0, 0, c) c < n}. It is straihtforward to verify that S 1, S 2, S 3 satisfy the triple-product property, i.e. ( a, 0, 0) (0, b, 0) (0, b, 0) (0, 0, c) = ( a, 0, 0) (0, 0, c ) a = a, b = b, c = c. Since G is abelian it follows that all the character derees d i are 1 and hence, usin Theorem 2, we et the expression n ω d ω i = d 2 i = G = n 3. Thus this does not rule out that ω = 3. This is no better than the naive alorithm with cubic runnin time. In fact, no abelian roup does better. In the next section we ive a non-trivial example via a non-abelian roup. 4
5 4 A roup yieldin ω < 3 Now we ive an example of a roup and embeddin ivin a nontrivial alorithm, i.e., ω < 3. Given any roup H we define a new roup G := {(a, b)z J a, b H, J {0, 1}, z is a new symbol}. It is easy to see that G = 2 H 2. For clarity, note (a, b)z 0 = (a, b)1 = (a, b). The roup operation + G for G is defined by the followin three rules: (a, b) + G (a, b ) = (a + H a, b + H b ), (a, b)z = z(b, a), z z = 1. In other words, we take two copies of H, and we let z act on them by swappin them. Those versed in roup theory will reconize G as a wreath product. As an exercise it is ood to verify that ((a, b)z) 1 = ( b, a)z. Now, let H := H 1 H 2 H 3, where for every i, H i := Z n is the additive roup of inteers modulo n. This is the roup we use for matrix multiplication. Aain for clarity, note 0 G = (0 H, 0 H ) = ((0, 0, 0), (0, 0, 0)). We now define the three sets for the embeddin. For ease of notation, let H 4 := H 1. For 1 i 3, we define S i := {(a, b)z J a H i \ {0}, b H i+1, J {0, 1}}. Removin the element 0 is crucial to obtain a non-trivial exponent < 3. Lemma 5. S 1, S 2, S 3 as defined above satisfy the triple-product property. Proof. We need to prove that s i S i, t i S i Equivalently, we have to prove that 2 s 3 = t 1 1 t 3 s i = t i, i 3 t 1 2 s 3 t 1 3 = 0 s i = t i, i 3 We first see that we can represent s i t 1 i in a normal form. 5
6 Claim 2. s i, t i S i, either or for some a i, a i H i \ {0}, b i, b i H i+1. s i t 1 i = (a i, b i )z(a i, b i) (a i, b i )(a i, b i) Proof. If t i contains no z then it is easy to see that one of the two forms will occur dependin on the presence or absence of z in s i. Alternately, if t i = (a i, b i)z then t 1 i = ( b i, a i)z = z( a i, b i), from which the result follows. Specifically, the absence or presence of z in the final form depends on the presence or absence of z in s i. Given the above normal form we can rewrite our equation t 1 2 s 3 t 1 3 = 0 as (a 1, b 1 )z J 1 (a 1, b 1)(a 2, b 2 )z J 2 (a 2, b 2)(a 3, b 3 )z J 3 (a 3, b 3) = ((0, 0, 0), (0, 0, 0)). Observe that there can only be an an even number of z s, since they annihilate in pairs and there is none on the riht hand side. If there are no z s then by equatin componentwise we et that i 3, a i +a i = b i +b i = 0 and hence s i = t i, i 3. If there are 2 z s then assumin without loss of enerality that J 3 = 0 we et that Note that if (a 1, b 1 )z(a 1, b 1)(a 2, b 2 )z(a 2, b 2)(a 3, b 3 )(a 3, b 3) = (a 1, b 1 )(b 1, a 1)(b 2, a 2 )(a 2, b 2)(a 3, b 3 )(a 3, b 3) = (a 1 + b 1 + b 2 + a 2 + a 3 + a 3, b 1 + a 1 + a 2 + b 2 + b 3 + b 3). (a 1 + b 1 + b 2 + a 2 + a 3 + a 3, b 1 + a 1 + a 2 + b 2 + b 3 + b 3) = ((0, 0, 0), (0, 0, 0)) then it must be the case that a 1 + b 1 + b 2 + a 2 + a 3 + a 3 = (0, 0, 0). However, since a i H i \ 0 and b i H i+1 this can never happen: a 1 is the only term with an entry in the first component, but by definition it is non-zero. (The only other elements that could contribute to makin the first component non-zero are a 1, b 3, and b 3, but all these moved to the second copy of H.) Havin verified the embeddin capability of G, we now observe that the relative size of the sets S i in G yield non-trivial exponents via Theorem 4. Claim 3. The roup G and associated sets S 1, S 2, S 3 with the triple-product property yields a matrix multiplication exponent ω < 3. 6
7 Proof. Elementary countin shows G = 2 H 2 = 2n 6, S i = 2n(n 1), i 3. Since H H is an abelian subroup of G we have by Theorem 2 that all character derees d i G / H = 2. Theorem 4 shows that the exponent ω of matrix multiplication satisfies (2n(n 1)) 3 d ω i. We prove that ω < 3 by showin that ω = 3 yields a contradiction. Suppose ω = 3, then (2n(n 1)) 3 d 3 i 2 d 2 i = 4n 6, which is false for n = 5. Hence ω < 3. The best bound with this approach is ω
Solution sheet 9. λ < g u = 0, λ = g α 0 : u = αλ. C(u, λ) = gλ gλ = 0
Advanced Finite Elements MA5337 - WS17/18 Solution sheet 9 On this final exercise sheet about variational inequalities we deal with nonlinear complementarity functions as a way to rewrite a variational
More informationXIUMEI LI AND MIN SHA
GAUSS FACTORIALS OF POLYNOMIALS OVER FINITE FIELDS arxiv:1704.0497v [math.nt] 18 Apr 017 XIUMEI LI AND MIN SHA Abstract. In this paper we initiate a study on Gauss factorials of polynomials over finite
More informationGroup-theoretic approach to Fast Matrix Multiplication
Jenya Kirshtein 1 Group-theoretic approach to Fast Matrix Multiplication Jenya Kirshtein Department of Mathematics University of Denver Jenya Kirshtein 2 References 1. H. Cohn, C. Umans. Group-theoretic
More informationDigital Electronics Paper-EE-204-F SECTION-A
B.Tech 4 th Semester (AEIE) F Scheme, May 24 Diital Electronics Paper-EE-24-F Note : Attempt five questions. Question is compulsory and one question from each of the four sections.. What is a loic ate?
More informationNick Egbert MA 158 Lesson 6. Recall that we define +,,, / on functions by performing these operations on the outputs.
Nick Ebert MA 158 Lesson 6 Function arithmetic Recall that we define +,,, / on functions by performin these operations on the outputs. So we have (f + )(x) f(x) + (x) (f )(x) f(x) (x) (f)(x) f(x)(x) (
More informationSPLITTING OF SHORT EXACT SEQUENCES FOR MODULES. 1. Introduction Let R be a commutative ring. A sequence of R-modules and R-linear maps.
SPLITTING OF SHORT EXACT SEQUENCES FOR MODULES KEITH CONRAD 1. Introduction Let R be a commutative rin. A sequence o R-modules and R-linear maps N M P is called exact at M i im = ker. For example, to say
More informationLinearized optimal power flow
Linearized optimal power flow. Some introductory comments The advantae of the economic dispatch formulation to obtain minimum cost allocation of demand to the eneration units is that it is computationally
More information1 Locally computable randomized encodings
CSG399: Gems of Theoretical Computer Science Lectures 3-4 Feb 20-24, 2009 Instructor: Emanuele Viola Scribe: Eric Miles Cryptography in constant depth: II & III Locally computable randomized encodings
More informationV DD. M 1 M 2 V i2. V o2 R 1 R 2 C C
UNVERSTY OF CALFORNA Collee of Enineerin Department of Electrical Enineerin and Computer Sciences E. Alon Homework #3 Solutions EECS 40 P. Nuzzo Use the EECS40 90nm CMOS process in all home works and projects
More informationFinite Fields: An introduction through exercises Jonathan Buss Spring 2014
Finite Fields: An introduction through exercises Jonathan Buss Spring 2014 A typical course in abstract algebra starts with groups, and then moves on to rings, vector spaces, fields, etc. This sequence
More informationEXERCISE SHEET 1 WITH SOLUTIONS
EXERCISE SHEET 1 WITH SOLUTIONS (E8) Prove that, given a transitive action of G on Ω, there exists a subgroup H G such that the action of G on Ω is isomorphic to the action of G on H\G. You may need to
More informationFast Convolution; Strassen s Method
Fast Convolution; Strassen s Method 1 Fast Convolution reduction to subquadratic time polynomial evaluation at complex roots of unity interpolation via evaluation at complex roots of unity 2 The Master
More informationBoundary value problems - an introduction
Boundary value problems - an introduction Up till now, we ve been worryin about initial value problems in DEs. Also quite common, and enerally much more difficult, are boundary value problems. One oriin
More informationLP Rounding and Combinatorial Algorithms for Minimizing Active and Busy Time
LP Roundin and Combinatorial Alorithms for Minimizin Active and Busy Time Jessica Chan, Samir Khuller, and Koyel Mukherjee University of Maryland, Collee Park {jschan,samir,koyelm}@cs.umd.edu Abstract.
More informationA crash course in homological algebra
Chapter 2 A crash course in homoloical alebra By the 194 s techniques from alebraic topoloy bean to be applied to pure alebra, ivin rise to a new subject. To bein with, recall that a cateory C consists
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics L HOSPITAL TYPE RULES FOR OSCILLATION, WITH APPLICATIONS IOSIF PINELIS Department of Mathematical Sciences, Michian Technoloical University, Houhton,
More informationLecture 6: Finite Fields
CCS Discrete Math I Professor: Padraic Bartlett Lecture 6: Finite Fields Week 6 UCSB 2014 It ain t what they call you, it s what you answer to. W. C. Fields 1 Fields In the next two weeks, we re going
More informationRings. Chapter 1. Definition 1.2. A commutative ring R is a ring in which multiplication is commutative. That is, ab = ba for all a, b R.
Chapter 1 Rings We have spent the term studying groups. A group is a set with a binary operation that satisfies certain properties. But many algebraic structures such as R, Z, and Z n come with two binary
More informationFrom Loop Groups To 2-Groups
From Loop Groups To 2-Groups John C. Baez Joint work with: Aaron Lauda Alissa Crans Danny Stevenson & Urs Schreiber 1 G f 1 f D 2 More details at: http://math.ucr.edu/home/baez/2roup/ 1 Hiher Gaue Theory
More informationRelaxed Multiplication Using the Middle Product
Relaxed Multiplication Usin the Middle Product Joris van der Hoeven Département de Mathématiques (bât. 425) Université Paris-Sud 91405 Orsay Cedex France joris@texmacs.or ABSTRACT In previous work, we
More informationMath 312/ AMS 351 (Fall 17) Sample Questions for Final
Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply
More information2.2 Differentiation and Integration of Vector-Valued Functions
.. DIFFERENTIATION AND INTEGRATION OF VECTOR-VALUED FUNCTIONS133. Differentiation and Interation of Vector-Valued Functions Simply put, we differentiate and interate vector functions by differentiatin
More informationCHMC: Finite Fields 9/23/17
CHMC: Finite Fields 9/23/17 1 Introduction This worksheet is an introduction to the fascinating subject of finite fields. Finite fields have many important applications in coding theory and cryptography,
More informationLecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013
Lecture 6 & 7 Shuanglin Shao September 16th and 18th, 2013 1 Elementary matrices 2 Equivalence Theorem 3 A method of inverting matrices Def An n n matrice is called an elementary matrix if it can be obtained
More informationRecovery of Piecewise Smooth Images from Few Fourier Samples
Recovery of Piecewise Smooth Imaes from Few Fourier Samples Gre Onie Department of Mathematics University of Iowa Iowa City, Iowa 54 Email: reory-onie@uiowa.edu Mathews Jacob Department of Electric and
More informationApproaches 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 informationTHE GORENSTEIN DEFECT CATEGORY
THE GORENSTEIN DEFECT CATEGORY PETTER ANDREAS BERGH, DAVID A. JORGENSEN & STEFFEN OPPERMANN Dedicated to Ranar-Ola Buchweitz on the occasion o his sixtieth birthday Abstract. We consider the homotopy cateory
More informationANALYZE In all three cases (a) (c), the reading on the scale is. w = mg = (11.0 kg) (9.8 m/s 2 ) = 108 N.
Chapter 5 1. We are only concerned with horizontal forces in this problem (ravity plays no direct role). We take East as the +x direction and North as +y. This calculation is efficiently implemented on
More informationFFT: Fast Polynomial Multiplications
FFT: Fast Polynomial Multiplications Jie Wang University of Massachusetts Lowell Department of Computer Science J. Wang (UMass Lowell) FFT: Fast Polynomial Multiplications 1 / 20 Overview So far we have
More information8.6 Partial Fraction Decomposition
628 Systems of Equations and Matrices 8.6 Partial Fraction Decomposition This section uses systems of linear equations to rewrite rational functions in a form more palatable to Calculus students. In College
More informationMODEL ANSWERS TO HWK #10
MODEL ANSWERS TO HWK #10 1. (i) As x + 4 has degree one, either it divides x 3 6x + 7 or these two polynomials are coprime. But if x + 4 divides x 3 6x + 7 then x = 4 is a root of x 3 6x + 7, which it
More informationCategorical Background (Lecture 2)
Cateorical Backround (Lecture 2) February 2, 2011 In the last lecture, we stated the main theorem o simply-connected surery (at least or maniolds o dimension 4m), which hihlihts the importance o the sinature
More informationDiscrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6
CS 70 Discrete Mathematics and Probability Theory Fall 2018 Alistair Sinclair and Yun Song Note 6 1 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes
More informationHopf cyclic cohomology and transverse characteristic classes
Hopf cyclic cohomoloy and transverse characteristic classes Lecture 2: Hopf cyclic complexes Bahram Ranipour, UNB Based on joint works with Henri Moscovici and with Serkan Sütlü Vanderbilt University May
More informationEnergy-preserving affine connections
Enery-preservin affine connections Andrew D. Lewis 1997/07/28 Abstract A Riemannian affine connection on a Riemannian manifold has the property that is preserves the kinetic enery associated with the metric.
More informationLS.2 Homogeneous Linear Systems with Constant Coefficients
LS2 Homogeneous Linear Systems with Constant Coefficients Using matrices to solve linear systems The naive way to solve a linear system of ODE s with constant coefficients is by eliminating variables,
More informationDisclaimer: This lab write-up is not
Disclaimer: This lab write-up is not to be copied, in whole or in part, unless a proper reference is made as to the source. (It is stronly recommended that you use this document only to enerate ideas,
More informationEigenvalues and Eigenvectors
Contents Eigenvalues and Eigenvectors. Basic Concepts. Applications of Eigenvalues and Eigenvectors 8.3 Repeated Eigenvalues and Symmetric Matrices 3.4 Numerical Determination of Eigenvalues and Eigenvectors
More informationMODULI SPACES OF COHERENT SYSTEMS OF SMALL SLOPE ON ALGEBRAIC CURVES
MODULI SPACES OF COHERENT SYSTEMS OF SMALL SLOPE ON ALGEBRAIC CURVES S. B. BRADLOW, O. GARCÍA-PRADA, V. MERCAT, V. MUÑOZ, AND P. E. NEWSTEAD Abstract. Let C be an alebraic curve of enus 2. A coherent system
More informationA Peter May Picture Book, Part 1
A Peter May Picture Book, Part 1 Steve Balady Auust 17, 2007 This is the beinnin o a larer project, a notebook o sorts intended to clariy, elucidate, and/or illustrate the principal ideas in A Concise
More information10. Smooth Varieties. 82 Andreas Gathmann
82 Andreas Gathmann 10. Smooth Varieties Let a be a point on a variety X. In the last chapter we have introduced the tangent cone C a X as a way to study X locally around a (see Construction 9.20). It
More informationLecture 7: Polynomial rings
Lecture 7: Polynomial rings Rajat Mittal IIT Kanpur You have seen polynomials many a times till now. The purpose of this lecture is to give a formal treatment to constructing polynomials and the rules
More informationLecture 8 - Algebraic Methods for Matching 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 1, 2018 Lecture 8 - Algebraic Methods for Matching 1 In the last lecture we showed that
More information6 Mole Concept. g mol. g mol. g mol ) + 1( g : mol ratios are the units of molar mass. It does not matter which unit is on the
What is a e? 6 Mole Concept The nature of chemistry is to chane one ecule into one or more new ecules in order to create new substances such as paints, fertilizers, food additives, medicines, etc. When
More informationEfficient method for obtaining parameters of stable pulse in grating compensated dispersion-managed communication systems
3 Conference on Information Sciences and Systems, The Johns Hopkins University, March 12 14, 3 Efficient method for obtainin parameters of stable pulse in ratin compensated dispersion-manaed communication
More informationA Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group
A Multiplicative Operation on Matrices with Entries in an Arbitrary Abelian Group Cyrus Hettle (cyrus.h@uky.edu) Robert P. Schneider (robert.schneider@uky.edu) University of Kentucky Abstract We define
More informationLecture #21. c T x Ax b. maximize subject to
COMPSCI 330: Design and Analysis of Algorithms 11/11/2014 Lecture #21 Lecturer: Debmalya Panigrahi Scribe: Samuel Haney 1 Overview In this lecture, we discuss linear programming. We first show that the
More informationMath 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours
Math 120. Groups and Rings Midterm Exam (November 8, 2017) 2 Hours Name: Please read the questions carefully. You will not be given partial credit on the basis of having misunderstood a question, and please
More informationLecture notes for a class on perfectoid spaces
Lecture notes for a class on perfectoid spaces Bharav Bhatt April 23, 2017 Contents Preface 3 1 Conventions on non-archimedean fields 4 2 Perfections and tiltin 6 3 Perfectoid fields 9 3.1 Definition and
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationLecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016
Lecture 1: Entropy, convexity, and matrix scaling CSE 599S: Entropy optimality, Winter 2016 Instructor: James R. Lee Last updated: January 24, 2016 1 Entropy Since this course is about entropy maximization,
More informationGALOIS THEORY : LECTURE 4 LEO GOLDMAKHER
GALOIS THEORY : LECTURE 4 LEO GOLDMAKHER 1. A BRIEF REVIEW OF S n The rest of the lecture relies on familiarity with the symmetric group of n elements, denoted S n (this is the group of all permutations
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 informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 5
CS 70 Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 5 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a
More informationUSING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS
USING GRAPHS AND GAMES TO GENERATE CAP SET BOUNDS JOSH ABBOTT AND TREVOR MCGUIRE Abstract. Let F 3 be the field with 3 elements and consider the k- dimensional affine space, F k 3, over F 3. A line of
More informationLecture 9: Phase Estimation
CS 880: Quantum Information Processing 9/3/010 Lecture 9: Phase Estimation Instructor: Dieter van Melkebeek Scribe: Hesam Dashti Last lecture we reviewed the classical setting of the Fourier Transform
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 informationMath 344 Lecture # Linear Systems
Math 344 Lecture #12 2.7 Linear Systems Through a choice of bases S and T for finite dimensional vector spaces V (with dimension n) and W (with dimension m), a linear equation L(v) = w becomes the linear
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 informationCS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games
CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games Scribe: Zeyu Guo In the first lecture, we saw three equivalent variants of the classical PCP theorems in terms of CSP, proof checking,
More informationA Multigrid-like Technique for Power Grid Analysis
A Multirid-like Technique for Power Grid Analysis Joseph N. Kozhaya, Sani R. Nassif, and Farid N. Najm 1 Abstract Modern sub-micron VLSI desins include hue power rids that are required to distribute lare
More informationConvergence of DFT eigenvalues with cell volume and vacuum level
Converence of DFT eienvalues with cell volume and vacuum level Sohrab Ismail-Beii October 4, 2013 Computin work functions or absolute DFT eienvalues (e.. ionization potentials) requires some care. Obviously,
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 3
CS 70 Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 3 Modular Arithmetic In several settings, such as error-correcting codes and cryptography, we sometimes wish to work over a smaller
More informationG-NEUTROSOPHIC SPACE
UPB Sci Bull, ISS 3-707 G-EUTROSOPHIC SPACE Mumtaz Ali, Florentin Smarandache, Munazza az 3, Muhammad Shabir 4 In this article we ive an etension of roup action theory to neutrosophic theory and develop
More informationChapter 5 Divide and Conquer
CMPT 705: Design and Analysis of Algorithms Spring 008 Chapter 5 Divide and Conquer Lecturer: Binay Bhattacharya Scribe: Chris Nell 5.1 Introduction Given a problem P with input size n, P (n), we define
More informationKneser s theorem for upper Banach density
Journal de Théorie des Nombres de Bordeaux 18 (2006), 323 343 Kneser s theorem for upper Banach density par Prerna BIHANI et Renlin JIN Résumé. Supposons que A soit un ensemble d entiers non néatifs avec
More informationDivide and Conquer. Maximum/minimum. Median finding. CS125 Lecture 4 Fall 2016
CS125 Lecture 4 Fall 2016 Divide and Conquer We have seen one general paradigm for finding algorithms: the greedy approach. We now consider another general paradigm, known as divide and conquer. We have
More informationEnergizing Math with Engineering Applications
Enerizin Math with Enineerin Applications Understandin the Math behind Launchin a Straw-Rocket throuh the use of Simulations. Activity created by Ira Rosenthal (rosenthi@palmbeachstate.edu) as part of
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationSolutions to Homework for M351 Algebra I
Hwk 42: Solutions to Homework for M351 Algebra I In the ring Z[i], find a greatest common divisor of a = 16 + 2i and b = 14 + 31i, using repeated division with remainder in analogy to Problem 25. (Note
More informationAdic spaces. Sophie Morel. March 5, 2019
Adic spaces Sophie Morel March 5, 2019 Conventions : - Every rin is commutative. - N is the set of nonneative inteers. 2 Contents I The valuation spectrum 5 I.1 Valuations......................................
More informationLecture 8: Pesudorandom Generators (II) 1 Pseudorandom Generators for Bounded Computation
Expander Graphs in Computer Science WS 2010/2011 Lecture 8: Pesudorandom Generators (II) Lecturer: He Sun 1 Pseudorandom Generators for Bounded Computation Definition 8.1 Let M be a randomized TM that
More informationFourier Optics and Image Analysis
Laboratory instruction to Fourier Optics and Imae Analysis Sven-Göran Pettersson and Anders Persson updated by Maïté Louisy and Henrik Ekerfelt This laboratory exercise demonstrates some important applications
More informationParametric Equations
Parametric Equations Suppose a cricket jumps off of the round with an initial velocity v 0 at an anle θ. If we take his initial position as the oriin, his horizontal and vertical positions follow the equations:
More informationLecture 2: Vector Spaces, Metric Spaces
CCS Discrete II Professor: Padraic Bartlett Lecture 2: Vector Spaces, Metric Spaces Week 2 UCSB 2015 1 Vector Spaces, Informally The two vector spaces 1 you re probably the most used to working with, from
More informationTHE SIGNAL ESTIMATOR LIMIT SETTING METHOD
' THE SIGNAL ESTIMATOR LIMIT SETTING METHOD Shan Jin, Peter McNamara Department of Physics, University of Wisconsin Madison, Madison, WI 53706 Abstract A new method of backround subtraction is presented
More informationWinter School on Galois Theory Luxembourg, February INTRODUCTION TO PROFINITE GROUPS Luis Ribes Carleton University, Ottawa, Canada
Winter School on alois Theory Luxembourg, 15-24 February 2012 INTRODUCTION TO PROFINITE ROUPS Luis Ribes Carleton University, Ottawa, Canada LECTURE 2 2.1 ENERATORS OF A PROFINITE ROUP 2.2 FREE PRO-C ROUPS
More informationFINITE ABELIAN GROUPS Amin Witno
WON Series in Discrete Mathematics and Modern Algebra Volume 7 FINITE ABELIAN GROUPS Amin Witno Abstract We detail the proof of the fundamental theorem of finite abelian groups, which states that every
More informationCS 4424 Matrix multiplication
CS 4424 Matrix multiplication 1 Reminder: matrix multiplication Matrix-matrix product. Starting from a 1,1 a 1,n A =.. and B = a n,1 a n,n b 1,1 b 1,n.., b n,1 b n,n we get AB by multiplying A by all columns
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 informationIsotropic diffeomorphisms: solutions to a differential system for a deformed random fields study
Isotropic diffeomorphisms: solutions to a differential system for a deformed random fields study Marc Briant, Julie Fournier To cite this version: Marc Briant, Julie Fournier. Isotropic diffeomorphisms:
More informationA connection between number theory and linear algebra
A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.
More informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Physics. Physics 8.01x Fall Term 2001 EXAM 1 SOLUTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Physics Physics 8.01x Fall Term 2001 EXAM 1 SOLUTIONS Problem 1: We define a vertical coordinate system with positive upwards. The only forces actin
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 informationMathematics Extension 1 Time allowed: 2 hours (plus 5 minutes reading time)
Name: Teacher: Class: FORT STREET HIGH SCHOOL 0 HIGHER SCHOOL CERTIFICATE COURSE ASSESSMENT TASK : TRIAL HSC Mathematics Extension Time allowed: hours (plus 5 minutes readin time) Syllabus Assessment Area
More informationLecture 11: Cantor-Zassenhaus Algorithm
CS681 Computational Number Theory Lecture 11: Cantor-Zassenhaus Algorithm Instructor: Piyush P Kurur Scribe: Ramprasad Saptharishi Overview In this class, we shall look at the Cantor-Zassenhaus randomized
More informationCMPSCI 250: Introduction to Computation. Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013
CMPSCI 250: Introduction to Computation Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013 Equivalence Relations Definition of Equivalence Relations Two More Examples: Universal
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solving in Math (Math 43900) Fall 203 Week six (October ) problems recurrences Instructor: David Galvin Definition of a recurrence relation We met recurrences in the induction hand-out. Sometimes
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationLecture 4.1: Homomorphisms and isomorphisms
Lecture 4.: Homomorphisms and isomorphisms Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4, Modern Algebra M. Macauley (Clemson) Lecture
More informationSolutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3
Solutions to odd-numbered exercises Peter J. Cameron, Introduction to Algebra, Chapter 3 3. (a) Yes; (b) No; (c) No; (d) No; (e) Yes; (f) Yes; (g) Yes; (h) No; (i) Yes. Comments: (a) is the additive group
More informationSecant Degeneracy Index of the Standard Strata in The Space of Binary Forms
Arnold Math J. https://doi.or/10.1007/s40598-017-0077-7 RESEARCH CONTRIBUTION Secant Deeneracy Index of the Standard Strata in The Space of Binary Forms Gleb Nenashev 1 Boris Shapiro 1 Michael Shapiro
More informationConical Pendulum Linearization Analyses
European J of Physics Education Volume 7 Issue 3 309-70 Dean et al. Conical Pendulum inearization Analyses Kevin Dean Jyothi Mathew Physics Department he Petroleum Institute Abu Dhabi, PO Box 533 United
More information1. Introduction to commutative rings and fields
1. Introduction to commutative rings and fields Very informally speaking, a commutative ring is a set in which we can add, subtract and multiply elements so that the usual laws hold. A field is a commutative
More informationTorsion Points of Elliptic Curves Over Number Fields
Torsion Points of Elliptic Curves Over Number Fields Christine Croll A thesis presented to the faculty of the University of Massachusetts in partial fulfillment of the requirements for the degree of Bachelor
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 informationPHYS 1114, Lecture 9, February 6 Contents:
PHYS 4, Lecture 9, February 6 Contents: Continued with projectile motion: The kicko problem in football was treated analytically, obtainin formulas for maimum heiht and rane in terms of initial speed and
More informationSubdirectly Irreducible Modes
Subdirectly Irreducible Modes Keith A. Kearnes Abstract We prove that subdirectly irreducible modes come in three very different types. From the description of the three types we derive the results that
More informationFAMILIES OF IRREDUCIBLE REPRESENTATIONS OF S 2 S 3
FAMILIES OF IRREDUCIBLE REPRESENTATIONS OF S S 3 JAY TAYLOR We would like to consider the representation theory of the Weyl group of type B 3, which is isomorphic to the wreath product S S 3 = (S S S )
More information