# Group-theoretic Algorithms for Matrix Multiplication

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 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 introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families of wreath product groups that achieve matrix multiplication exponent less than 3, the asymptotically fastest of which achieves exponent We present two conjectures regarding specific improvements, one combinatorial and the other algebraic. Either one would imply that the exponent of matrix multiplication is Introduction The tas of multiplying matrices is one of the most fundamental problems in algorithmic linear algebra. Matrix multiplication itself is a important operation, and its importance is magnified by the number of similar problems that are reducible to it. Following Strassen s discovery [9] of an algorithm for n n matrix multiplication in O(n 2.81 ) operations, a sequence of improvements has achieved ever better bounds on the exponent of matrix multiplication, which is the smallest real number ω for which n n matrix multiplication can be performed in O(n ω+ε ) operations for each ε > 0. The asymptotically fastest algorithm nown is due to Coppersmith and Winograd [3], and it proves that ω < Since 1990, there have been no better upper bounds proved on ω, although it is widely believed that ω = 2. Recently, Cohn and Umans [2] proposed a new grouptheoretic approach to devising matrix multiplication algorithms. In this framewor, one selects a finite group G satisfying a certain property that allows n n matrix multi- Microsoft Research, One Microsoft Way, Redmond, WA , Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA 02139, and Department of Computer Science, Cornell University, Ithaca, NY 14853, Microsoft Research, One Microsoft Way, Redmond, WA , Department of Computer Science, California Institute of Technology, Pasadena, CA 91125, supported in part by NSF grant CCF and an Alfred P. Sloan Research Fellowship. plication to be reduced to multiplication of elements of the group algebra C[G]. This latter multiplication is performed via a Fourier transform, which reduces it to several smaller matrix multiplications, whose sizes are the character degrees of G. This naturally gives rise to a recursive algorithm whose running time depends on the character degrees. Thus the problem of devising matrix multiplication algorithms in this framewor is imported into the domain of group theory and representation theory. One of the main contributions of [2] was to demonstrate that several diverse families of non-abelian groups support the reduction of n n matrix multiplication to group algebra multiplication. These include, in particular, families of groups of size n 2+o(1). The existence of such families is a necessary condition for the group-theoretic approach to prove ω = 2, although it is not sufficient. The main question raised in [2] is whether the proposed approach could prove nontrivial bounds on ω, i.e., prove ω < 3. This was shown to be equivalent to a question in representation theory, Question 4.1 in [2]: is there a group G with subsets S 1, S 2, S 3 that satisfy the triple product property (see Definition 1.3 below), and for which S 1 S 2 S 3 > d 3 i, where {d i} is the set of character degrees of G? In this paper we resolve this question in the affirmative, which immediately gives a simple matrix multiplication algorithm in the group-theoretic framewor that has running time O(n ). The group we construct for this purpose is a wreath product, and in subsequent sections we describe similar constructions that produce algorithms with running times O(n 2.48 ) and O(n 2.41 ). The main challenge in each case is to describe the three subsets of the group that satisfy the triple product property. We give two ways of organizing these descriptions, both of which give rise to the O(n 2.48 ) algorithm relatively simply. We also advance two natural conjectures related to these formulations, each of which would imply that ω = 2. The first is a combinatorial conjecture (Conjecture 3.4), and the second is an algebraic conjecture (Conjecture 4.7). The three subsets underlying the O(n 2.41 ) algorithm are described in terms of a combinatorial object we call a Uniquely Solvable Puzzle (or USP), which is a weaening of the combinatorial object in our first conjecture. An op- 1

2 timal USP construction can be extracted from Coppersmith and Winograd s paper [3]. In fact, the reader familiar with Strassen s 1987 paper [10] and Coppersmith and Winograd s paper [3] (or the presentation of this material in, for example, [1]) will recognize that our exponent bounds of 2.48 and 2.41 match bounds derived in those wors. It turns out that with some effort the algorithms in [10] and [3], including Coppersmith and Winograd s O(n ) algorithm, all have analogues in our group-theoretic framewor. The translation does not appear to be systematic: the algorithms are based on similar principles, but in fact they are not identical (the actual operations performed on matrix entries do not directly correspond), and we now of no group-theoretic interpretations of any earlier algorithms. We defer a complete account of this connection to the full version of this paper. We believe that, compared to existing algorithms, our group-theoretic algorithms are simpler to state and simpler to analyze. They are situated in a clearer conceptual and mathematical framewor, in which, for example, the two conjectures mentioned above are natural and easy to identify. Finally, they avoid various complications of earlier algorithms. For example, they substitute the discrete Fourier transform, together with some elementary facts in representation theory, for the seemingly ad hoc trilinear form identities in introduced in [10], and they completely avoid the need to deal with degenerations and border ran of tensors Outline In the rest of this section, we establish notation and review bacground from [2] on the group-theoretic approach to fast matrix multiplication. Section 2 describes the simplest group we have found that can prove a nontrivial bound on the exponent of matrix multiplication. In Sections 3 and 4, we carry out a more elaborate construction in two different ways, each of which has the potential of reaching ω = 2 although ω < 2.48 is the best we can achieve so far by these methods. The most fundamental conceptual contribution in this paper is the simultaneous triple product property, which we introduce in Section 5. It extends the triple product property from [2], and it encompasses and illuminates all of our other constructions, as we explain in Section 6. Finally, in Section 7 we show that any bound provable via the simultaneous triple product property can in fact be proved using only the approach of [2] Preliminaries and notation As usual ω denotes the exponent of matrix multiplication over C. The set {1, 2,..., } is denoted []. We write A \ B = {a A : a B} and if A and B are subsets of an abelian group we set A B = {a b : a A, b B}. The cyclic group of order is denoted Cyc (with additive notation for the group law), and the symmetric group on a set S is denoted Sym(S) (or Sym n instead of Sym([n])). If G is a group and R is a ring, then R[G] will denote the group algebra of G with coefficients in R. When we discuss a group action, it will always be a left action unless otherwise specified. If G and H are groups with a left action of G on H (where the action of g on h is written g 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 ). We almost always identify H with the subset H {1} and G with {1} G, so that (h, g) simply becomes the product hg. For a right action of G on H, with the action of g on h written h g, the semidirect product G H is G H with the multiplication law (g 1, h 1 )(g 2, h 2 ) = (g 1 g 2, h g2 1 h 2). As in the previous case we identify G and H with the corresponding subsets of G H. Other than for Lemma 1.2, which is not required for the main results of this paper, we will use only the following basic facts from representation theory. The group algebra C[G] of a finite group G decomposes as the direct product C[G] = C d1 d1 C d d of matrix algebras of orders d 1,..., d. These orders are the character degrees of G, or the dimensions of the irreducible representations. It follows from computing the dimensions of both sides that G = i d2 i. It is also easy to prove that if G has an abelian subgroup A, then all the character degrees of G are less than or equal to the index [G : A] (Proposition 2.6 in [5]). See [6] and [5] for further bacground on representation theory. The following elementary lemma will prove useful several times: Lemma 1.1. Let s 1, s 2,..., s n be nonnegative real numbers, and suppose that for every vector µ = (µ 1,..., µ n ) of nonnegative integers for which n µ i = N we have Then n s i C. ( ) N n s µi i C N. µ Proof. For each probability distribution p = (p 1,..., p n ), we can let N tend to infinity and choose µ so that 2

3 lim N µ/n = p. As N, the inequality in the hypothesis of the lemma yields p i log p i + p i log s i log C i i after taing the N-th root and the logarithm. Setting S = i s i and p i = s i /S proves log S log C, as desired. Occasionally we will need to bound the character degrees of wreath products, but the proof can be sipped by readers not comfortable with representation theory: Lemma 1.2. Let {d } be the character degrees of finite group H and let {c j } be the character degrees of Sym n H n (where Sym n acts by permuting the coordinates). Then j c ω j (n!) ω 1 ( d ω ) n. Proof. When H is abelian, we can use the elementary facts that the character degrees of Sym n H n are at most n! (which is the index of H n in Sym n H n ) and that j c2 j = Sym n H n to obtain c ω j (n!) ω 2 c 2 j = (n!) ω 1 H n. j j For general H, we need further information regarding the character degrees of Sym n H n. From Theorem 25.6 in [5] we get the following description: The symmetric group Sym n acts on the irreducible representations of H n by permuting the n factors. Let V be any irreducible representation of H n, and let G V Sym n be the subgroup that fixes V (in the action on such representations). Then V extends to a representation of G V H n. Taing the tensor product with an irreducible representation W of G V (with H n acting trivially on W ) and inducing to Sym n H n yields an irreducible representation Ind Sym n Hn G V H n (W C V ) of Sym n H n. All irreducible representations of Sym n H n arise in this way. Two such representations are isomorphic iff the choices of W are isomorphic and the choices of V are equivalent under the action of Sym n on irreducible representations of H n. In other words, if we loo at all choices of V and W, each representation is counted n!/ G V times (because that is the size of V s orbit under Sym n ). The dimension of this representation is (n!/ G V ) dim(w ) dim(v ). Thus, because dim(w ) G V and W dim(w )2 = G V, c ω j = j V G V n! (n!) ω 1 V W ( n! dim(w ) dim(v ) G V dim(v ) ω = (n!) ω 1 ( ) ω d ω ) n, as desired Bacground In this subsection we summarize the necessary definitions and results from [2]. If S is a subset of a group, let Q(S) denote the right quotient set of S, i.e., Q(S) = {s 1 s 1 2 : s 1, s 2 S}. Definition 1.3 ([2]). A group G realizes n 1, n 2, n 3 if there are subsets S 1, S 2, S 3 G such that 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. We call this condition on S 1, S 2, S 3 the triple product property. Lemma 1.4 ([2]). If G realizes n 1, n 2, n 3, then it does so for every permutation of n 1, n 2, n 3. Lemma 1.5 ([2]). If S 1, S 2, S 3 G and S 1, S 2, S 3 G satisfy the triple product property, then so do the subsets S 1 S 1, S 2 S 2, S 3 S 3 G G. Theorem 1.6 ([2]). Let R be any algebra over C (not necessarily commutative). If G realizes n, m, p, then the number of ring operations required to multiply n m with m p matrices over R is at most the number of operations required to multiply two elements of R[G]. One particularly useful construction from [2] involves permutations of the points in a triangular array. Let n = {(a, b, c) Z 3 : a + b + c = n 1 and a, b, c 0}. Geometrically, these triples are barycentric coordinates for a triangular array of points with n points along each side, but it is more convenient to manipulate them algebraically. For x n, we write x = (x 1, x 2, x 3 ). Let H 1, H 2, and H 3 be the subgroups of Sym( n ) that preserve the first, second, and third coordinates, respectively. Specifically, H i = {π Sym( n ) : (π(x)) i = x i for all x n }. Theorem 1.7 ([2]). The subgroups H 1, H 2, H 3 defined above satisfy the triple product property. Theorem 1.8 ([2]). Suppose G realizes n, m, p and the character degrees of G are {d i }. Then (nmp) ω/3 i d ω i. Combining Theorem 1.8 with the fact that i d2 i = G yields the following corollary, which is generally how the theorem is applied: Corollary 1.9 ([2]). Suppose G realizes n, m, p and has largest character degree d. Then (nmp) ω/3 d ω 2 G. 3

4 2. Beating the sum of the cubes Suppose G realizes n, m, p and has character degrees {d i }. Theorem 1.8 yields a nontrivial bound on ω (by ruling out the possibility of ω = 3) if and only if nmp > i Question 4.1 in [2] ass whether such a group exists. In this section we construct one, which shows that our methods do indeed prove nontrivial bounds on ω. The rest of the paper is logically independent of this example, but it serves as motivation for later constructions. We do not now of any construction that maes use of small groups. We have used the computer program GAP [4] to verify by brute force search that no group of order less than 128 proves a nontrivial bound on ω using three subgroups (as opposed to subsets). Thus a construction must involve either fairly sizable groups or subsets other than subgroups, and in fact all of our constructions involve both. The example in this section realizes matrix multiplication through subsets other than subgroups. However, the subsets are close to subgroups in the sense that they can be obtained from subgroups by deleting a small number of elements. Let H = Cyc 3 n, and let G = H2 Cyc 2, where Cyc 2 acts on H 2 by switching the two factors of H. Let z denote the generator of Cyc 2. We write elements of G in the form (a, b)z i, with a, b H and i {0, 1}. Note that z(a, b)z = (b, a). Let H 1, H 2, H 3 be the three factors of Cyc n in the product H = Cyc 3 n, viewed as subgroups of H. For notational convenience, let H 4 = H 1. Define subsets S 1, S 2, S 3 G by d 3 i. S i = {(a, b)z j : a H i \ {0}, b H i+1, j {0, 1}}. We will prove in Lemma 2.1 that these subsets satisfy the triple product property. To analyze this construction we need very little representation-theoretic information. The character degrees of G are all at most 2, because H 2 is an abelian subgroup of index 2. Then since the sum of the squares of the character degrees is G, the sum of their cubes is at most 2 G, which equals 4n 6. On the other hand, S i = 2n(n 1), so S 1 S 2 S 3 = 8n 3 (n 1) 3. For n 5, this product is larger than 4n 6. By Corollary 1.9, (2n(n 1)) ω 2 ω 2 2n 6. The best bound on ω is achieved by setting n = 17, in which case we obtain ω < It is a straightforward calculation in representation theory to determine how many of the character degrees are 2 (and how many are 1). That can be used to improve this analysis, but the bound on ω changes by less than 10 4, so we do not present the details here. All that remains is to prove the triple product property: Lemma 2.1. S 1, S 2, and S 3 satisfy the triple product property. Proof. Consider the triple product q 1 q 2 q 3 with q i Q(S i ), and suppose it equals the identity. Each quotient q i is either of the form (a i, b i )( a i, b i ) or of the form (a i, b i )z( a i, b i ), with a i, a i H i and b i, b i H i+1. There must be an even number of factors of z among the three elements q 1, q 2, q 3. First, suppose there are none. We can write q 1 q 2 q 3 as (a 1, b 1 )( a 1, b 1)(a 2, b 2 )( a 2, b 2)(a 3, b 3 )( a 3, b 3), where a i, a i H i and b i, b i H i+1. The product is thus equal to (a 1 a 1 + a 2 a 2 + a 3 a 3, b 1 b 1 + b 2 b 2 + b 3 b 3), which is the identity iff q 1 = q 2 = q 3 = 1, since the triple product property holds (trivially) for H 1, H 2, H 3 in H. Second, suppose two of q 1, q 2, q 3 contain a z. The product q 1 q 2 q 3 can be simplified as above to yield a sum in each coordinate, except now a i and a i contribute to different coordinates when q i contains a z, as do b i and b i. There are thus two i s such that a i and a i contribute to different coordinates. For one of those two i s, b i 1 and b i 1 contribute to the same coordinate (where we interpret the subscripts modulo 3). The sum in the other coordinate contains one of a i and a i but neither of b i 1 and b i 1, and thus only one summand from H i (because for each j, a j, a j H j and b j, b j H j+1). Since a i and a i are nonzero by the definition of S i, the product q 1 q 2 q 3 cannot be the identity. 3. Uniquely solvable puzzles In this section we define a combinatorial object called a strong USP, which gives rise to a systematic construction of sets satisfying the triple product property in a wreath product. Using strong USPs we achieve ω < 2.48, and we conjecture that there exist strong USPs that prove ω = USPs and strong USPs A uniquely solvable puzzle (USP) of width is a subset U {1, 2, 3} satisfying the following property: For all permutations π 1, π 2, π 3 Sym(U), either π 1 = π 2 = π 3 or else there exist u U and i [] such that at least two of (π 1 (u)) i = 1, (π 2 (u)) i = 2, and (π 3 (u)) i = 3 hold. 4

5 The motivation for the name uniquely solvable puzzle is that a USP can be thought of as a jigsaw puzzle. The puzzle pieces are the sets {i : u i = 1}, {i : u i = 2}, and {i : u i = 3} with u U, and the puzzle can be solved by permuting these types of pieces according to π 1, π 2, and π 3, respectively, and reassembling them without overlap into triples consisting of one piece of each of the three types. The definition requires that the puzzle must have a unique solution. A strong USP is a USP in which the defining property is strengthened as follows: For all permutations π 1, π 2, π 3 Sym(U), either π 1 = π 2 = π 3 or else there exist u U and i [] such that exactly two of (π 1 (u)) i = 1, (π 2 (u)) i = 2, and (π 3 (u)) i = 3 hold. One convenient way to depict USPs is by labelling a grid in which the rows correspond to elements of the USP and the columns to coordinates. The ordering of the rows is irrelevant. For example, the following labelling defines a strong USP of size 8 and width 6: This construction naturally generalizes as follows: Proposition 3.1. For each 1, there exists a strong USP of size 2 and width 2. Proof. Viewing {1, 3} {2, 3} as a subset of {1, 2, 3} 2, we define U to be {u {1, 3} {2, 3} : for i [], u i = 1 iff u i+ = 2}. Suppose π 1, π 2, π 3 Sym(U). If π 1 π 3, then there exists u U such that (π 1 (u)) i = 1 and (π 3 (u)) i = 3 for some i []. Similarly, if π 2 π 3, then there exists u U such that (π 2 (u)) i = 2 and (π 3 (u)) i = 3 for some i [2] \ []. In either case, exactly two of (π 1 (u)) i = 1, (π 2 (u)) i = 2, and (π 3 (u)) i = 3 hold because in each coordinate only two of the three symbols 1, 2, and 3 can occur. It follows that U is a strong USP, as desired. We define the strong USP capacity to be the largest constant C such that there exist strong USPs of size (C o(1)) and width for infinitely many values of. (We use the term capacity because this quantity is the Sperner capacity of a certain directed hypergraph, as we explain in Section 6.) The USP capacity is defined analogously. There is a simple upper bound for the USP capacity, which is of course an upper bound for the strong USP capacity as well: Lemma 3.2. The USP capacity is at most 3/2 2/3. Proof. Let U be a USP of width. For each triple n 1, n 2, n 3 of nonnegative integers summing to, define the subset U n1,n 2,n 3 of U to consist of all elements of U containing n 1 entries that are 1, n 2 that are 2, and n 3 that are 3. There are ( ) +2 2 choices of n1, n 2, n 3, so ( ) + 2 U max U n1,n 2 n 1,n 2,n 2,n 3. 3 If two elements of U have the symbol 1 in exactly the same locations, then letting π 1 interchange them would violate the definition of a USP, and of course the same holds for 2 or 3. Thus, ( ) ( 3 U n1,n 2,n 3 min i n i + o(1) 22/3 ), where the latter inequality holds because min i ( n i ) is maximized when n 1 = n 2 = n 3 = /3. It follows that U ( 3/2 2/3 + o(1) ), as desired. USPs turn out to be implicit in the analysis in Coppersmith and Winograd s paper [3], although they are not discussed as such. Section 6 of [3] can be interpreted as giving a probabilistic construction showing that Lemma 3.2 is sharp: Theorem 3.3 (Coppersmith and Winograd [3]). The USP capacity equals 3/2 2/3. We conjecture that the same is true for strong USPs: Conjecture 3.4. The strong USP capacity equals 3/2 2/3. This conjecture would imply that ω = 2, as we explain in the next subsection Using strong USPs Given a strong USP U of width, let H be the abelian group of all functions from U [] to the cyclic group Cyc m (H is a group under pointwise addition). The symmetric group Sym(U) acts on H via π(h)(u, i) = h(π 1 (u), i) for π Sym(U), h H, u U, and i []. Let G be the semidirect product H Sym(U), and define subsets S 1, S 2, and S 3 of G by letting S i consist of all products hπ with π Sym(U) and h H satisfying for all u U and j []. h(u, j) 0 iff u j = i 5

6 Proposition 3.5. If U is a strong USP, then S 1, S 2, and S 3 satisfy the triple product property. Proof. Consider a triple product h 1 π 1 π 1 1 h 1 1 h 2 π 2 π 1 2 h 1 2 h 3 π 3 π 1 3 h 1 3 = 1 (3.1) with h i π i, h i π i S i. For (3.1) to hold we must have π 1 π 1 1 π 2 π 1 2 π 3 π 1 3 = 1. (3.2) Set π = π 1 π 1 1 and ρ = π 1 π 1 1 π 2 π 1 2. Then the remaining condition for (3.1) to hold is that in the abelian group H (with its Sym(U) action), Note that h 1 h 3 + π(h 2 h 1) + ρ(h 3 h 2) = 0. (3.3) (h 1 h 3)(u, j) 0 iff u j {1, 3}, π(h 2 h 1)(u, j) 0 iff (π 1 (u)) j {2, 1}, and ρ(h 3 h 2)(u, j) 0 iff (ρ 1 (u)) j {3, 2}. By the definition of a strong USP, either π = ρ = 1 or else there exist u and j such that exactly one of these three conditions holds, in which case (3.3) cannot hold. Thus, π = ρ = 1, which together with (3.2) implies π i = π i for all i. Then we have h 1 + h 2 + h 3 = h 1 + h 2 + h 3, which implies h i = h i for each i (because for different choices of i they have disjoint supports). Thus, the triple product property holds. Analyzing this construction using Corollary 1.9 and the bound [G : H] = U! on the largest character degree of G yields the following bound: Corollary 3.6. If U is a strong USP of width, and m 3 is an integer, then ω 3 log m log(m 1) 3 log U! U log(m 1). In particular, if the strong USP capacity is C, then ω 3(log m log C). log(m 1) Proposition 3.1 yields ω < 2.67 with m = 9. In the next subsection we prove that the strong USP capacity is at least 2 2/3 and hence ω < 2.48, which is the best bound we now how to prove using strong USPs. If Conjecture 3.4 holds, then Corollary 3.6 yields ω = 2 upon taing m = The triangle construction The strong USP constructed in Proposition 3.1 has the property that only two symbols (of the three possibilities 1, 2, and 3) occur in each coordinate. Every USP with this property is a strong USP, and we can analyze exactly how large such a USP can be as follows. Suppose U {1, 2, 3} is a subset with only two symbols occurring in each coordinate. Let H 1 be the subgroup of Sym(U) that preserves the coordinates in which only 1 and 2 occur, H 2 the subgroup preserving the coordinates in which only 2 and 3 occur, and H 3 the subgroup preserving the coordinates in which only 1 and 3 occur. Lemma 3.7. The set U is a USP iff H 1, H 2, and H 3 satisfy the triple product property within Sym(U). Proof. Suppose π 1, π 2, π 3 Sym(U). The permutation π 1 π2 1 is not in H 1 iff there exists v U and a coordinate i such that v i = 2 and ((π 1 π2 1 )(v)) i = 1. If we set u = π2 1 (v), then this is equivalent to (π 2(u)) i = 2 and (π 1 (u)) i = 1. Similarly, π 2 π3 1 H 2 iff there exist u and i such that (π 2 (u)) i = 2 and (π 3 (u)) i = 3, and π 3 π1 1 H 3 iff there exist u and i such that (π 1 (u)) i = 1 and (π 3 (u)) i = 3. Thus, U is a USP iff for all π 1, π 2, π 3, if π 1 π2 1 H 1, π 2 π3 1 H 2, and π 3 π1 1 H 3, then π 1 = π 2 = π 3. That is equivalent to the triple product property for H 1, H 2, and H 3 : recall that because these are subgroups, the triple product property says that for h i H i, h 1 h 2 h 3 = 1 iff h 1 = h 2 = h 3 = 1. Any three elements h 1, h 2, h 3 satisfying h 1 h 2 h 3 = 1 can be written in the form h 1 = π 1 π2 1, h 2 = π 2 π3 1, and h 3 = π 3 π1 1. Proposition 3.8. For each 1, there exists a strong USP of size 2 1 (2 + 1) and width 3. It follows that the strong USP capacity is at least 2 2/3 and ω < Proof. Consider the triangle n = {(a, b, c) Z 3 : a + b + c = n 1 and a, b, c 0}, with n = 2, and let H 1, H 2, and H 3 be the subgroups of Sym( n ) preserving the first, second, and third coordinates, respectively. By Theorem 1.7, these subgroups satisfy the triple product property in Sym( n ). To construct the desired strong USP, choose a subset U {1, 2, 3} 3 as follows. Among the first coordinates, only 1 and 2 will occur, among the second only 2 and 3, and among the third only 1 and 3. In each of these three blocs of coordinates, there are 2 possible patterns that be made using the two available symbols. Number these patterns arbitrarily from 0 to 2 1 (each number will be used for three patterns, one for each pair of symbols). The 6

7 elements of U will correspond to elements of n. In particular, the element of U corresponding to (a, b, c) n will have the a-th pattern in the first coordinates, the b-th in the second, and the c-th in the third. It follows from Lemma 3.7 that U is a strong USP. One can show using Lemma 3.7 that this construction is optimal: Corollary 3.9. If U is a USP of width such that only two symbols occur in each coordinate, then U (2 2/3 + o(1)). The condition of using only two symbols in each coordinate is highly restrictive, but we have been unable to improve on Proposition 3.8. However, we now of no upper bound on the size of a strong USP besides Lemma 3.2, and we see no reason why Conjecture 3.4 should not be true. 4. The simultaneous double product property There are at least two natural avenues for improving the construction from Subsection 3.3. In the combinatorial direction, one might hope to replace the strong USP of Proposition 3.8 with a larger one; this will reach exponent 2 if Conjecture 3.4 holds. In the algebraic direction, one might hope to eep the combinatorial structure of the triangle construction in place while modifying the underlying group. Such a modification can be carried out using the simultaneous double product property defined below, and we conjecture that it reaches ω = 2 as well (Conjecture 4.7). We say that subsets S 1, S 2 of a group H satisfy the double product property if where q i Q(S i ). q 1 q 2 = 1 implies q 1 = q 2 = 1, Definition 4.1. We say that n pairs of subsets A i, B i (for 1 i n) of a group H satisfy the simultaneous double product property if for all i, the pair A i, B i satisfies the double product property, and for all i, j,, a i (a j) 1 b j (b ) 1 = 1 implies i =, where a i A i, a j A j, b j B j, and b B. A convenient reformulation is that if one loos at the sets A 1 i B j = {a 1 b : a A i, b B j }, those with i = j are disjoint from those with i j. For a trivial example, set H = Cyc n Cyc n, and set A i = {(x, i) : x Cyc n } and B i = {(0, i)}. Then the pairs A i, B i for i Cyc n satisfy the simultaneous double product property. Lemma 4.2. If n pairs of subsets A i, B i H satisfy the simultaneous double product property, and n pairs of subsets A i, B i H satisfy the simultaneous double product property, then so do the nn pairs of subsets A i A j, B i B j H H. Pairs A i, B i satisfying the simultaneous double product property in group H can be transformed into subsets satisfying the triple product property via a construction similar to the one in Section 3. Recall that n = {(a, b, c) Z 3 : a + b + c = n 1 and a, b, c 0}. Given n pairs of subsets A i, B i in H for 0 i n 1, we define triples of subsets in H 3 indexed by v = (v 1, v 2, v 3 ) n as follows: Â v = A v1 {1} B v3 B v = B v1 A v2 {1} Ĉ v = {1} B v2 A v3 Theorem 4.3. If n pairs of subsets A i, B i H (with 0 i n 1) satisfy the simultaneous double product property, then the following subsets S 1, S 2, S 3 of G = (H 3 ) n Sym( n ) satisfy the triple product property: S 1 = {âπ : π Sym( n ), â v Âv for all v} S 2 = { bπ : π Sym( n ), b v B v for all v} S 3 = {ĉπ : π Sym( n ), ĉ v Ĉv for all v} The proof uses Theorem 1.7 and is similar to the proof of Proposition 3.5; it can be found in the full version of this paper. Theorem 4.4. If H is a finite group with character degrees {d }, and n pairs of subsets A i, B i H satisfy the simultaneous double product property, then ( ) 3/2 n ( A i B i ) ω/2 d ω. Using this theorem, the example after Definition 4.1 recovers the trivial bound ω 3 as. Proof of Theorem 4.4. Let A i, B i be the N-fold direct product of the pairs A i, B i via Lemma 4.2, and let µ be an arbitrary n-vector of nonnegative integers for which n µ i = N. Among the pairs A i, B i are M = ( ) N µ pairs for which A i B i = n ( A i B i ) µ i ; 7

8 call this quantity L. Set P = M, so P = M(M + 1)/2. The three subsets in Theorem 4.3 each have size P!L P. By Theorem 1.8 and Lemma 1.2 we obtain (P!L P ) ω (P!) ω 1 ( d ω ) 3NP. Taing 2P -th roots and letting N yields ( ) ( ) N n ω/2 ( ) 3N/2 ( A i B i ) µi d ω. µ Finally, we apply Lemma 1.1 with s i = ( A i B i ) ω/2 and C = ( dω )3/2 to obtain the stated inequality. It is convenient to use two parameters α and β to describe pairs satisfying the simultaneous double product property: if there are n pairs, choose α and β so that A i B i n α for all i and H = n β. If H is abelian Theorem 4.4 implies ω (3β 2)/α. The best construction we now is the following: Proposition 4.5. For each m 2, there is a construction in Cyc 2l m satisfying the simultaneous double product property with α = log 2 (m 1) + o(1) and β = log 2 m + o(1) as l. Taing m = 6 yields exactly the same bound as in Subsection 3.3 (ω < 2.48). Proof. Let n = ( ) 2l l. Then n = 2 2l(1 o(1)) so β = log 2 m + o(1). For each subset S of the 2l coordinates of Cyc 2l m with S = l, let A S be the set of elements that are nonzero in those coordinates and zero in the others. Let S denote the complement of S, and set B S = A S. For each S, we have A S B S = (m 1) 2l, so α = log 2 (m 1)+o(1). We will show that the pairs A S, B S satisfy the simultaneous double product property. Each pair A S, B S clearly satisfies the double product property, because the elements of A S and B S are supported on disjoint sets of coordinates. Each element of B S A S is nonzero in every coordinate, but if Q R then there is a coordinate in R Q (note that this is why we require Q = R ). Each element of B Q A R vanishes in that coordinate, so as desired. (B Q A R ) (B S A S ) = The only limitations we now of on the possible values of α and β are the following: Proposition 4.6. If n pairs of subsets A i, B i H satisfy the simultaneous double product property, with A i B i n α for all i and H = n β, then α β and α + 2 2β. Proof. The inequality α β follows immediately from the double product property, since that means that the quotient map (a, b) a 1 b from A i B i to H is injective. For the other inequality, first note that A 1,..., A n are disjoint (if x A i A j with i j, and y B i, then x 1 y (A 1 i B i ) (A 1 j B i ), which is impossible). Similarly, B 1,..., B n are also disjoint. It follows that the map n n Sym n Sym n A i B i (H n ) 2 defined by (π, ρ, a, b) (πa, ρb) is injective. Here, the group Sym n acts by permuting the n coordinates. Comparing the sizes of these sets yields (n!) 2 (n α ) n (n β ) 2n, which implies 2β α + 2 as n. Note that by taing direct powers via Lemma 4.2, one can tae n arbitrarily large without changing α and β. The most important case is when H is an abelian group. There the bound on ω is ω (3β 2)/α, and Proposition 4.6 shows that the only way to achieve ω = 2 is α = β = 2. We conjecture that that is possible: Conjecture 4.7. For arbitrarily large n, there exists an abelian group H with n pairs of subsets A i, B i satisfying the simultaneous double product property such that H = n 2+o(1) and A i B i n 2 o(1). 5. The simultaneous triple product property Each of our constructions of a group proving a nontrivial bound on ω has the same general form, namely a semidirect product of a permutation group with an abelian group. The crucial part of such a construction is the way in which the abelian part is apportioned among the three subsets satisfying the triple product property. This apportionment can be viewed as reducing several independent matrix multiplication problems to a single group algebra multiplication, using triples of subsets satisfying the simultaneous triple product property: Definition 5.1. We say that n triples of subsets A i, B i, C i (for 1 i n) of a group H satisfy the simultaneous triple product property if for each i, the three subsets A i, B i, C i satisfy the triple product property, and for all i, j,, a i (a j) 1 b j (b ) 1 c (c i) 1 = 1 implies i = j = for a i A i, a j A j, b j B j, b B, c C and c i C i. 8

9 We say that such a group simultaneously realizes A 1, B 1, C 1,..., A n, B n, C n. In most applications the group H will be abelian, in which case it is more conventional to use additive notation. In this notation the implication above becomes a i a j + b j b + c c i = 0 implies i = j =. As an example, let H = Cyc 3 n, and call the three factors H 1, H 2, and H 3. Define and A 1 = H 1 \ {0}, B 1 = H 2 \ {0}, C 1 = H 3 \ {0} A 2 = H 2 \ {0}, B 2 = H 3 \ {0}, C 2 = H 1 \ {0}. This construction is based on the one in Section 2, except that this one is slightly more symmetrical. Proposition 5.2. The two triples A 1, B 1, C 1 and A 2, B 2, C 2 satisfy the simultaneous triple product property. Proof. Each triple clearly satisfies the triple product property in isolation, so we need only deal with the second condition in the definition. For i {1, 2} define U i = A i C i, V i = B i A i, and W i = C i B i. What we must prove is that if u i + v j + w = 0 with u i U i, v j V j, and w W, then i = j =. We have and U 1 = W 2 = {(x, 0, z) Cyc 3 n : x 0, z 0}, V 1 = U 2 = {(x, y, 0) Cyc 3 n : x 0, y 0}, W 1 = V 2 = {(0, y, z) Cyc 3 n : y 0, z 0}. If i, j, and are not all equal, then two of them must be equal but different from the third. In each such case, U i, V j, and W comprise exactly two of the three subsets of Cyc 3 n defined in the equations above, with one of those two sets occurring twice. The sum of an element from each cannot vanish, since in the repeated set one coordinate is zero, and the other set is always nonzero in that coordinate. The reason for the strange condition in the definition of the simultaneous triple product property is that it is exactly what is needed to reduce several independent matrix multiplications to one group algebra multiplication. Theorem 5.3. Let R be any algebra over C. If H simultaneously realizes n 1, m 1, p 1,..., n, m, p, then the number of ring operations required to perform independent matrix multiplications of sizes n 1 m 1 by m 1 p 1,..., n m by m p is at most the number of operations required to multiply two elements of R[H]. The proof is similar to that of Theorem 1.6: Proof. Suppose H simultaneously realizes n 1, m 1, p 1,..., n, m, p via triples N i, M i, P i with 1 i. Let A i be an n i m i matrix and B i an m i p i matrix. We will index the rows and columns of A i with the sets N i and M i, respectively, those of B i with M i and P i, and those of A i B i with N i and P i. Consider the product of the following two elements of R[H]: (A i ) s,t s 1 t s N i,t M i and We have t M i,u P i (B i ) t,ut 1 u. (s 1 t)(t 1 u) = s 1 u with s N i, t M i, t M j, u P j, s N, and u P iff i = j = and s = s, t = t, and u = u, so the coefficient of s 1 u in the product is (A i ) s,t (B i ) t,u = (A i B i ) s,u. t T Thus, one can simply read off the matrix products from the group algebra product by looing at the coefficients of s 1 u with s N i, u P i, and the theorem follows. Other results about the triple product property also generalize straightforwardly to the simultaneous triple product property, such as the following lemma: Lemma 5.4. If n triples of subsets A i, B i, C i H satisfy the simultaneous triple product property, and n triples of subsets A j, B j, C j H satisfy the simultaneous triple product property, then so do the nn triples of subsets A i A j, B i B j, C i C j H H. By Schönhage s asymptotic sum inequality ((15.11) in [1]), one can deduce a bound on ω from the simultaneous triple product property: Theorem 5.5. If a group H simultaneously realizes a 1, b 1, c 1,..., a n, b n, c n and has character degrees {d }, then n i b i c i ) (a ω/3 d ω. Frequently H will be abelian, in which case dω = H. That occurs in the example from Proposition 5.2, which proves that ω < 2.93 using Theorem 5.5. In Section 7 we provide a proof of Theorem 5.5 completely within our group-theoretic framewor, and show 9

10 furthermore that any bound on ω that can be achieved using the simultaneous triple product property can also be achieved using the ordinary triple product property. Thus, there is no added generality from the simultaneous triple product property, but it is an important organizing principle. 6. Using the simultaneous triple product property Every construction we have found of a group proving a nontrivial bound on ω has at its core a simultaneous triple product property construction in an abelian group. Each construction also involves a wreath product, but as explained in Section 7 that is a general tool for dealing with the simultaneous triple product property. Given Theorem 5.5, which can be proved either via the wreath product construction of Section 7 or using the asymptotic sum inequality, one can dispense with non-abelian groups entirely. In this section we explain how to interpret each of our constructions in this setting Local strong USPs A local strong USP of width is a subset U {1, 2, 3} such that for each ordered triple (u, v, w) U 3, with u, v, and w not all equal, there exists i [] such that (u i, v i, w i ) is an element of {(1, 2, 1), (1, 2, 2), (1, 1, 3), (1, 3, 3), (2, 2, 3), (3, 2, 3)}. Lemma 6.1. Every local strong USP is a strong USP. Proof. Let U be a local strong USP, and suppose π 1, π 2, π 3 Sym(U). If π 1, π 2, and π 3 are not all equal, then there exists u U such that π 1 (u), π 2 (u), and π 3 (u) are not all equal. There exists i [] such that ((π 1 (u)) i, (π 2 (u)) i, (π 3 (u)) i ) is in {(1, 2, 1), (1, 2, 2), (1, 1, 3), (1, 3, 3), (2, 2, 3), (3, 2, 3)}, and hence exactly two of (π 1 (u)) i = 1, (π 2 (u)) i = 2, and (π 3 (u)) i = 3 hold, as desired. The reason for the word local is that local strong USPs satisfy a condition for every triple of rows, rather than a weaer global condition on permutations. The advantage of local strong USPs is that they lead naturally to a construction satisfying the simultaneous triple product property: Theorem 6.2. Let U be a local strong USP of width, and for each u U define subsets A u, B u, C u Cyc l by A u = {x Cyc l : x j 0 iff u j = 1}, B u = {x Cyc l : x j 0 iff u j = 2}, and C u = {x Cyc l : x j 0 iff u j = 3}. Then the triples A u, B u, C u satisfy the simultaneous triple product property. Note that this construction isolates the ey idea behind Proposition 3.5. Proof. Suppose u, v, w U are not all equal and a u a v + b v b w + c w c u = 0 with a u A u, a v A v, b v B v, b w B w, c w C w and c u C u. By the definition of a local strong USP, there exists i [] such that (u i, v i, w i ) is in {(1, 2, 1), (1, 2, 2), (1, 1, 3), (1, 3, 3), (2, 2, 3), (3, 2, 3)}. In each of these cases exactly one of a u, a v, b v, b w, c w, c u is nonzero, namely a v, b v, a u, c u, b w, and c w, respectively. Thus, in each case the equation a u +b v +c w = a v +b w +c u is impossible, so u = v = w, as desired. All that remains is to show that for each u, the sets A u, B u, C u satisfy the triple product property, which is trivial (they are supported on disjoint sets of coordinates). At first glance the definition of a local strong USP appears far stronger than that of a strong USP. For example, the strong USPs constructed in Subsection 3.3 are not local strong USPs. However, it turns out that any bound on ω that can be proved using strong USPs can be proved using local strong USPs: Proposition 6.3. The strong USP capacity is achieved by local strong USPs. In particular, given any strong USP U of width, there exists a local strong USP of size U! and width U. Proof. Let U be a strong USP of width, and fix an arbitrary ordering u 1, u 2,..., u U of the elements of U. For each π Sym(U), let U π {1, 2, 3} U be the concatenation of π(u 1 ), π(u 2 ),..., π(u U ). Then the set of all vectors U π is a local strong USP: given any three elements U π1, U π2, and U π3 with π 1, π 2, π 3 not all equal, by the definition of a strong USP there exist u U and i [] such that exactly two of (π 1 (u)) i = 1, (π 2 (u)) i = 2, and (π 3 (u)) i = 3 hold. Then in the coordinate indexed by u and i, the vectors U π1, U π2, and U π3 have entries among (1, 2, 1), (1, 2, 2), (1, 1, 3), (1, 3, 3), (2, 2, 3), (3, 2, 3), as desired. Proposition 6.3 explains the choice of the word capacity : optimizing the size of a local strong USP amounts to determining the Sperner capacity of a certain directed hypergraph (see [8] for bacground on Sperner capacity). The full version of this paper will explain this perspective more completely. 10

11 6.2. Triangle-free sets The construction in Theorem 4.3 is also easily interpreted in terms of the simultaneous triple product property. Recall the construction of triples Âv, B v, Ĉv indexed by v n, defined before Theorem 4.3. These triples almost satisfy the simultaneous triple product property, in the following sense: if a u (a v) 1 b v (b w) 1 c w (c u) 1 = 1 then it follows from the simultaneous double product property that u 1 = w 1, v 2 = u 2, and w 3 = v 3. Call a subset S of n triangle-free if for all u, v, w S satisfying u 1 = w 1, v 2 = u 2, and w 3 = v 3, it follows that u = v = w. Thus, the triples Âv, B v, Ĉv with v in a triangle-free subset of n satisfy the triple product property. The critical question is whether there is a triangle-free subset of n of size n 1 o(1). We give a simple construction achieving this using Salem-Spencer sets (see [7]). Let T be a subset of [ n/2 ] of size n 1 o(1) that contains no three-term arithmetic progression. The following lemma is easily proved: Lemma 6.4. The subset {(a, b, c) n : b a T } is triangle-free and has size n 1 o(1) Local USPs and generalizations USPs also have a local version, just as strong USPs do. A local USP is defined analogously to a local strong USP, except that the triple (1, 2, 3) is allowed in addition to (1, 2, 1), (1, 2, 2), (1, 1, 3), (1, 3, 3), (2, 2, 3), and (3, 2, 3). Local USPs are USPs, and they achieve the USP capacity; the proofs are analogous to those for Lemma 6.1 and Proposition 6.3. In what follows we place this construction in a far broader context: Definition 6.5. Let H be a finite abelian group. An H- chart C = (Γ, A, B, C) consists of a finite set of symbols Γ, together with three mappings A, B, C : Γ 2 H such that for each x Γ, the sets A(x), B(x), C(x) satisfy the triple product property. Let H(C) Γ 3 denote the set of ordered triples (x, y, z) such that 0 A(x) A(y) + B(y) B(z) + C(z) C(x). A local C-USP of width is a subset U Γ such that for each ordered triple (u, v, w) U 3, with u, v, w not all equal, there exists i [] such that (u i, v i, w i ) H(C). For example, a local USP is a C-USP for the Cyc l -chart C = ({1, 2, 3}, A, B, C) with A, B, C defined as follows (below, Ĥ = Cyc l \ {0, 1}): A(1) = {0} B(1) = Ĥ C(1) = {0} A(2) = {1} B(2) = {0} C(2) = Ĥ A(3) = Ĥ B(3) = {0} C(3) = {0} Theorem 6.6. Let H be a finite abelian group, C an H- chart, and U a local C-USP of width. For each u U define subsets A u, B u, C u H by A u = A(u i ), B u = B(u i ), C u = C(u i ). Then these triples of subsets satisfy the simultaneous triple product property. Together with the example above, this theorem gives an analogue of Theorem 6.2 for local USPs. Using Theorem 3.3, this example achieves ω < Using a more complicated chart with 24 symbols, the bound ω < from [3] may be derived from Theorem 6.6. For details, see the full version of this paper. 7. The wreath product construction It remains to prove Theorem 5.5 using purely grouptheoretic means. Besides giving a self-contained proof, this will also show that the ordinary triple product property from Definition 1.3 is as strong as the simultaneous triple product property, in the sense that any bound that can be derived from Theorem 5.5 can be proved using Theorem 1.8 as well. To prove Theorem 5.5, we mae use of a wreath product construction. Let H be a group, and define G = Sym n H n, where the symmetric group Sym n acts on H n from the right by permuting the coordinates according to (h π ) i = h π(i). We write elements of G as hπ with h H n and π Sym n. Theorem 7.1. If n triples of subsets A i, B i, C i H satisfy the simultaneous triple product property, then the following subsets H 1, H 2, H 3 of G = Sym n H n satisfy the triple product property: H 1 = {hπ : π Sym n, h i A i for each i} H 2 = {hπ : π Sym n, h i B i for each i} H 3 = {hπ : π Sym n, h i C i for each i} Proof. The proof is analogous to that of Proposition 3.5. Consider a triple product h 1 π 1 π 1 1 h 1 1 h 2 π 2 π 1 2 h 1 2 h 3 π 3 π 1 3 h 1 3 = 1 (7.1) with h i π i, h i π i H i. (Note that these subscripts index h 1, h 2, h 3, rather than describing coordinates of a single h H. Once understood that should not cause confusion.) For (7.1) to hold we must have π 1 π 1 1 π 2 π 1 2 π 3 π 1 3 = 1. (7.2) Set π = π 1 π 1 1 and ρ = π 1 π 1 1 π 2 π 1 2. Then the remaining condition for (7.1) to hold is that in the group H n with its right Sym n action, h 1 3 h 1 ( h 1 1 h 2 ) π ( h 1 2 h 3 ) ρ = 1 11

12 In other words, for each coordinate i, ( ) ( ) ( ) ( ) ( ) ( ) h 1 3 h1 i i h 1 1 h2 π(i) π(i) h 1 2 h3 ρ(i) ρ(i) = 1. By the simultaneous triple product property, we find that π(i) = ρ(i) = i. Thus, π = ρ = 1, which together with (7.2) implies π i = π i for all i. Finally, we have h 1 h 1 1 h 2 h 1 2 h 3 h 1 3 = 1, which implies h 1 = h 1, h 2 = h 2, and h 3 = h 3 because each triple A i, B i, C i satisfies the triple product property. As a first step towards proving Theorem 5.5, we prove a weaer bound, with the geometric mean replacing the arithmetic mean: Lemma 7.2. If H is a finite group with character degrees {d } and n triples of subsets A i, B i, C i H satisfying the simultaneous triple product property, then ( ) 1/n n ( A i B i C i ) ω/3 i d ω. Proof. The sizes of the three subsets of G in Theorem 7.1 are n! i A i, n! i B i, and n! i C i, respectively. Applying Theorem 1.8 we get the inequality ( (n!) 3 i ) ω/3 A i B i C i c ω j. By Lemma 1.2 the right-hand-side is at most (n!) ω 1 ( dω )n, and then dividing both sides by (n!) ω yields ( ) ω/3 ( ) n A i B i C i (n!) 1 d ω. i This inequality is slightly weaer than the desired inequality, but that is easy to fix by taing direct powers of H via Lemma 5.4. Replacing H with H t (and n with n t ) yields ( A i B i C i i ) tn t 1 ω/3 j (n t!) 1 ( d ω ) tn t Taing tn t -th roots and letting t gives the claimed inequality. Proof of Theorem 5.5. Let A i, B i, C i be the N-fold direct product of the triples A i, B i, C i (via Lemma 5.4), and let µ be an arbitrary n-vector of nonnegative integers for which. n µ i = N. Among the triples A i, B i, C i are ( N µ) triples for which A i B i C i = n ( A i B i C i ) µ i. Applying Lemma 7.2 to these triples gives ( ) n ( ) N N ( A i B i C i ) µ iω/3 d ω. µ Applying Lemma 1.1 with s i = ( A i B i C i ) ω/3 and C = yields the desired bound. dω Acnowledgements We are grateful to Michael Aschbacher, Noam Elies, William Kantor, László Lovász, Amin Shorollahi, Gábor Simonyi, and David Vogan for helpful discussions. References [1] P. Bürgisser, M. Clausen, and M. A. Shorollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, [2] H. Cohn and C. Umans. A Group-theoretic Approach to Fast Matrix Multiplication. Proceedings of the 44th Annual Symposium on Foundations of Computer Science, October 2003, Cambridge, MA, IEEE Computer Society, pp , arxiv:math.gr/ [3] D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Computation, 9: , [4] The GAP Group. GAP Groups, Algorithms, and Programming, Version 4.3, ( [5] B. Huppert. Character Theory of Finite Groups. Number 25 in de Gruyter Expositions in Mathematics. Walter de Gruyter, Berlin, [6] G. James and M. Liebec. Representations and Characters of Groups. Cambridge University Press, Cambridge, second edition, [7] R. Salem and D. C. Spencer. On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA, 28: , [8] G. Simonyi. Perfect graphs and graph entropy. An updated survey. Perfect graphs, , Wiley-Intersci. Ser. Discrete Math. Optim., Wiley, Chichester, [9] V. Strassen. Gaussian elimination is not optimal. Numerische Mathemati, 13: , [10] V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376: ,

### Algebraic Complexity Theory and Matrix Multiplication

Algebraic Complexity Theory and Matrix Multiplication [Handout for the Tutorial] François Le Gall Department of Computer Science Graduate School of Information Science and Technology The University of

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Continued Fractions and the Euclidean Algorithm

Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction

### SUBGROUPS OF CYCLIC GROUPS. 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by

SUBGROUPS OF CYCLIC GROUPS KEITH CONRAD 1. Introduction In a group G, we denote the (cyclic) group of powers of some g G by g = {g k : k Z}. If G = g, then G itself is cyclic, with g as a generator. Examples

### 4. Factor polynomials over complex numbers, describe geometrically, and apply to real-world situations. 5. Determine and apply relationships among syn

I The Real and Complex Number Systems 1. Identify subsets of complex numbers, and compare their structural characteristics. 2. Compare and contrast the properties of real numbers with the properties of

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V. EROVENKO AND B. SURY ABSTRACT. We compute commutativity degrees of wreath products A B of finite abelian groups A and B. When B

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### The Mathematics of Origami

The Mathematics of Origami Sheri Yin June 3, 2009 1 Contents 1 Introduction 3 2 Some Basics in Abstract Algebra 4 2.1 Groups................................. 4 2.2 Ring..................................

### 2.5 Gaussian Elimination

page 150 150 CHAPTER 2 Matrices and Systems of Linear Equations 37 10 the linear algebra package of Maple, the three elementary 20 23 1 row operations are 12 1 swaprow(a,i,j): permute rows i and j 3 3

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### Elements of Abstract Group Theory

Chapter 2 Elements of Abstract Group Theory Mathematics is a game played according to certain simple rules with meaningless marks on paper. David Hilbert The importance of symmetry in physics, and for

### FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### Solution of Linear Systems

Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start

### COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS

Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### ORDERS 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

### Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### Linear Systems. Singular and Nonsingular Matrices. Find x 1, x 2, x 3 such that the following three equations hold:

Linear Systems Example: Find x, x, x such that the following three equations hold: x + x + x = 4x + x + x = x + x + x = 6 We can write this using matrix-vector notation as 4 {{ A x x x {{ x = 6 {{ b General

### DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism

### MATH 2030: SYSTEMS OF LINEAR EQUATIONS. ax + by + cz = d. )z = e. while these equations are not linear: xy z = 2, x x = 0,

MATH 23: SYSTEMS OF LINEAR EQUATIONS Systems of Linear Equations In the plane R 2 the general form of the equation of a line is ax + by = c and that the general equation of a plane in R 3 will be we call

### EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES

EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a

### DETERMINANTS. b 2. x 2

DETERMINANTS 1 Systems of two equations in two unknowns A system of two equations in two unknowns has the form a 11 x 1 + a 12 x 2 = b 1 a 21 x 1 + a 22 x 2 = b 2 This can be written more concisely in

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### max cx s.t. Ax c where the matrix A, cost vector c and right hand side b are given and x is a vector of variables. For this example we have x

Linear Programming Linear programming refers to problems stated as maximization or minimization of a linear function subject to constraints that are linear equalities and inequalities. Although the study

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### GROUP ALGEBRAS. ANDREI YAFAEV

GROUP ALGEBRAS. ANDREI YAFAEV We will associate a certain algebra to a finite group and prove that it is semisimple. Then we will apply Wedderburn s theory to its study. Definition 0.1. Let G be a finite

### Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.

This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra

### An Introduction to Galois Fields and Reed-Solomon Coding

An Introduction to Galois Fields and Reed-Solomon Coding James Westall James Martin School of Computing Clemson University Clemson, SC 29634-1906 October 4, 2010 1 Fields A field is a set of elements on

### Prime Numbers and Irreducible Polynomials

Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.

### Two classes of ternary codes and their weight distributions

Two classes of ternary codes and their weight distributions Cunsheng Ding, Torleiv Kløve, and Francesco Sica Abstract In this paper we describe two classes of ternary codes, determine their minimum weight

### Notes on Factoring. MA 206 Kurt Bryan

The General Approach Notes on Factoring MA 26 Kurt Bryan Suppose I hand you n, a 2 digit integer and tell you that n is composite, with smallest prime factor around 5 digits. Finding a nontrivial factor

### Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem) In order to understand the details of the Fingerprinting Theorem on fingerprints of different texts from Chapter 19 of the

### 1 Gaussian Elimination

Contents 1 Gaussian Elimination 1.1 Elementary Row Operations 1.2 Some matrices whose associated system of equations are easy to solve 1.3 Gaussian Elimination 1.4 Gauss-Jordan reduction and the Reduced

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### Solving Systems of Linear Equations

LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how

### MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu

Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing

### 13 Solutions for Section 6

13 Solutions for Section 6 Exercise 6.2 Draw up the group table for S 3. List, giving each as a product of disjoint cycles, all the permutations in S 4. Determine the order of each element of S 4. Solution

### 1 VECTOR SPACES AND SUBSPACES

1 VECTOR SPACES AND SUBSPACES What is a vector? Many are familiar with the concept of a vector as: Something which has magnitude and direction. an ordered pair or triple. a description for quantities such

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### Row Ideals and Fibers of Morphisms

Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion

### MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES

MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2016 47 4. Diophantine Equations A Diophantine Equation is simply an equation in one or more variables for which integer (or sometimes rational) solutions

### Chapter 1 - Matrices & Determinants

Chapter 1 - Matrices & Determinants Arthur Cayley (August 16, 1821 - January 26, 1895) was a British Mathematician and Founder of the Modern British School of Pure Mathematics. As a child, Cayley enjoyed

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### 1 Limiting distribution for a Markov chain

Copyright c 2009 by Karl Sigman Limiting distribution for a Markov chain In these Lecture Notes, we shall study the limiting behavior of Markov chains as time n In particular, under suitable easy-to-check

### Approximating the entropy of a 2-dimensional shift of finite type

Approximating the entropy of a -dimensional shift of finite type Tirasan Khandhawit c 4 July 006 Abstract. In this paper, we extend the method used to compute entropy of -dimensional subshift and the technique

### Short Programs for functions on Curves

Short Programs for functions on Curves Victor S. Miller Exploratory Computer Science IBM, Thomas J. Watson Research Center Yorktown Heights, NY 10598 May 6, 1986 Abstract The problem of deducing a function

### Polynomials and the Fast Fourier Transform (FFT) Battle Plan

Polynomials and the Fast Fourier Transform (FFT) Algorithm Design and Analysis (Wee 7) 1 Polynomials Battle Plan Algorithms to add, multiply and evaluate polynomials Coefficient and point-value representation

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### 11 Ideals. 11.1 Revisiting Z

11 Ideals The presentation here is somewhat different than the text. In particular, the sections do not match up. We have seen issues with the failure of unique factorization already, e.g., Z[ 5] = O Q(

### 1 Polyhedra and Linear Programming

CS 598CSC: Combinatorial Optimization Lecture date: January 21, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im 1 Polyhedra and Linear Programming In this lecture, we will cover some basic material

### Linear Codes. Chapter 3. 3.1 Basics

Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length

### Mathematical Induction

Chapter 2 Mathematical Induction 2.1 First Examples Suppose we want to find a simple formula for the sum of the first n odd numbers: 1 + 3 + 5 +... + (2n 1) = n (2k 1). How might we proceed? The most natural

### IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible

### Systems of Linear Equations

Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Integer Factorization using the Quadratic Sieve

Integer Factorization using the Quadratic Sieve Chad Seibert* Division of Science and Mathematics University of Minnesota, Morris Morris, MN 56567 seib0060@morris.umn.edu March 16, 2011 Abstract We give

### 1. R In this and the next section we are going to study the properties of sequences of real numbers.

+a 1. R In this and the next section we are going to study the properties of sequences of real numbers. Definition 1.1. (Sequence) A sequence is a function with domain N. Example 1.2. A sequence of real

### Inner Product Spaces and Orthogonality

Inner Product Spaces and Orthogonality week 3-4 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,

### ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM

ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give

### Algebra of the 2x2x2 Rubik s Cube

Algebra of the 2x2x2 Rubik s Cube Under the direction of Dr. John S. Caughman William Brad Benjamin. Introduction As children, many of us spent countless hours playing with Rubiks Cube. At the time it

### Chapter 6. Number Theory. 6.1 The Division Algorithm

Chapter 6 Number Theory The material in this chapter offers a small glimpse of why a lot of facts that you ve probably nown and used for a long time are true. It also offers some exposure to generalization,

### CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.

### 7 - Linear Transformations

7 - Linear Transformations Mathematics has as its objects of study sets with various structures. These sets include sets of numbers (such as the integers, rationals, reals, and complexes) whose structure

### Prime Numbers. Chapter Primes and Composites

Chapter 2 Prime Numbers The term factoring or factorization refers to the process of expressing an integer as the product of two or more integers in a nontrivial way, e.g., 42 = 6 7. Prime numbers are

### Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.

Some Polynomial Theorems by John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA 90405 rkennedy@ix.netcom.com This paper contains a collection of 31 theorems, lemmas,

### (x + a) n = x n + a Z n [x]. Proof. If n is prime then the map

22. A quick primality test Prime numbers are one of the most basic objects in mathematics and one of the most basic questions is to decide which numbers are prime (a clearly related problem is to find

### Integer roots of quadratic and cubic polynomials with integer coefficients

Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### ON UNIQUE FACTORIZATION DOMAINS

ON UNIQUE FACTORIZATION DOMAINS JIM COYKENDALL AND WILLIAM W. SMITH Abstract. In this paper we attempt to generalize the notion of unique factorization domain in the spirit of half-factorial domain. It

### 15.062 Data Mining: Algorithms and Applications Matrix Math Review

.6 Data Mining: Algorithms and Applications Matrix Math Review The purpose of this document is to give a brief review of selected linear algebra concepts that will be useful for the course and to develop

### Mathematics Review for MS Finance Students

Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,

### x if x 0, x if x < 0.

Chapter 3 Sequences In this chapter, we discuss sequences. We say what it means for a sequence to converge, and define the limit of a convergent sequence. We begin with some preliminary results about the

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### CHAPTER 5: MODULAR ARITHMETIC

CHAPTER 5: MODULAR ARITHMETIC LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN 1. Introduction In this chapter we will consider congruence modulo m, and explore the associated arithmetic called

### 3. Recurrence Recursive Definitions. To construct a recursively defined function:

3. RECURRENCE 10 3. Recurrence 3.1. Recursive Definitions. To construct a recursively defined function: 1. Initial Condition(s) (or basis): Prescribe initial value(s) of the function.. Recursion: Use a

### MATH Fundamental Mathematics II.

MATH 10032 Fundamental Mathematics II http://www.math.kent.edu/ebooks/10032/fun-math-2.pdf Department of Mathematical Sciences Kent State University December 29, 2008 2 Contents 1 Fundamental Mathematics

### Direct Methods for Solving Linear Systems. Matrix Factorization

Direct Methods for Solving Linear Systems Matrix Factorization Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University c 2011

### ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 4. Gaussian Elimination In this part, our focus will be on the most basic method for solving linear algebraic systems, known as Gaussian Elimination in honor

### 1 Solving LPs: The Simplex Algorithm of George Dantzig

Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.

### RESULTANT AND DISCRIMINANT OF POLYNOMIALS

RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results

### Finite groups of uniform logarithmic diameter

arxiv:math/0506007v1 [math.gr] 1 Jun 005 Finite groups of uniform logarithmic diameter Miklós Abért and László Babai May 0, 005 Abstract We give an example of an infinite family of finite groups G n such

### THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP

THE AVERAGE DEGREE OF AN IRREDUCIBLE CHARACTER OF A FINITE GROUP by I. M. Isaacs Mathematics Department University of Wisconsin 480 Lincoln Dr. Madison, WI 53706 USA E-Mail: isaacs@math.wisc.edu Maria

### SECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS

SECTION 2.5: FINDING ZEROS OF POLYNOMIAL FUNCTIONS Assume f ( x) is a nonconstant polynomial with real coefficients written in standard form. PART A: TECHNIQUES WE HAVE ALREADY SEEN Refer to: Notes 1.31