On Strassen s Conjecture

Size: px
Start display at page:

Download "On Strassen s Conjecture"

Transcription

1 On Strassen s Conjecture Elisa Postinghel (KU Leuven) joint with Jarek Buczyński (IMPAN/MIMUW) Daejeon August 3-7, 2015 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

2 Introduction: matrix multiplication Multiplication of two n n matrices: M n,n,n : C n2 C n2 C n2 M 1, M 2 M 1 M 2 Standard algorithm: O(n 3 ) arithmetic operations (n 3 multiplications & n 3 n 2 additions) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

3 Introduction: matrix multiplication Multiplication of two n n matrices: M n,n,n : C n2 C n2 C n2 M 1, M 2 M 1 M 2 Standard algorithm: O(n 3 ) arithmetic operations (n 3 multiplications & n 3 n 2 additions) [Strassen s algorithm, 69] n = 2: needs at most 7 multiplications (instead of 2 3 = 8) [Winograd, 71] Cannot be better than 7 for 2 2 matrices Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

4 Introduction: matrix multiplication Multiplication of two n n matrices: M n,n,n : C n2 C n2 C n2 M 1, M 2 M 1 M 2 Standard algorithm: O(n 3 ) arithmetic operations (n 3 multiplications & n 3 n 2 additions) [Strassen s algorithm, 69] n = 2: needs at most 7 multiplications (instead of 2 3 = 8) [Winograd, 71] Cannot be better than 7 for 2 2 matrices Generalisation of Strassen s algorithm: needs n log 2 (7) = n 2.81 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

5 Matrix multiplication as a tensor V 1, V 2, V 3 vector spaces of dimensions n 1, n 2, n 3 {n i n j matrices} {linear maps V i V j } {elements in V i V j } Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

6 Matrix multiplication as a tensor V 1, V 2, V 3 vector spaces of dimensions n 1, n 2, n 3 {n i n j matrices} {linear maps V i V j } {elements in V i V j } M n1,n 2,n 3 : (V 1 V 2) (V 2 V 3) (V 1 V 3) (v 1 v 2) (v 2 v 3) v 2 (v 2)v 1 v 3 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

7 Matrix multiplication as a tensor V 1, V 2, V 3 vector spaces of dimensions n 1, n 2, n 3 {n i n j matrices} {linear maps V i V j } {elements in V i V j } i.e. M n1,n 2,n 3 : (V 1 V 2) (V 2 V 3) (V 1 V 3) (v 1 v 2) (v 2 v 3) v 2 (v 2)v 1 v 3 M n1,n 2,n 3 = id V1 id V2 id V3 ((V 1 V 2 ) (V 2 V 3 )) (V 1 V 3 ) = (V 1 V 2 ) (V 2 V 3 ) (V 1 V 3 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

8 Tensor rank Consider the bilinear map T : A B C Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

9 Tensor rank Consider the bilinear map T : A B C The simplest bilinear maps are: take α A, β B and c C: α β c : (a, b) A B α(a)β(b)c C Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

10 Tensor rank Consider the bilinear map T : A B C The simplest bilinear maps are: take α A, β B and c C: α β c : (a, b) A B α(a)β(b)c C Every tensor can be represented as T (a, b) = r α i (a)β i (b)c i i=1 Definition The rank of T, R(T ), is the minimal number over all such presentations. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

11 Tensor rank Consider the bilinear map T : A B C The simplest bilinear maps are: take α A, β B and c C: α β c : (a, b) A B α(a)β(b)c C Every tensor can be represented as T (a, b) = r α i (a)β i (b)c i i=1 Definition The rank of T, R(T ), is the minimal number over all such presentations. In particular, the rank R(M n1,n 2,n 3 ) measures the number of multiplications needed to compute the matrix multiplication. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

12 Strassen s additivity conjecture Consider A = A 1 A 2, B = B 1 B 2, C = C 1 C 2 A 1 = C a 1 etc. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

13 Strassen s additivity conjecture Consider A = A 1 A 2, B = B 1 B 2, C = C 1 C 2 A 1 = C a 1 etc. Take T 1 A 1 B 1 C 1, T 2 A 2 B 2 C 2 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

14 Strassen s additivity conjecture Consider A = A 1 A 2, B = B 1 B 2, C = C 1 C 2 A 1 = C a 1 etc. Take T 1 A 1 B 1 C 1, T 2 A 2 B 2 C 2 Conjecture (Strassen s Additivity Conjecture (SAC), 73) Then R(T 1 + T 2 ) = R(T 1 ) + R(T 2 ). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

15 Strassen s additivity conjecture Consider A = A 1 A 2, B = B 1 B 2, C = C 1 C 2 A 1 = C a 1 etc. Take T 1 A 1 B 1 C 1, T 2 A 2 B 2 C 2 Conjecture (Strassen s Additivity Conjecture (SAC), 73) Then R(T 1 + T 2 ) = R(T 1 ) + R(T 2 ). Theorem (Buczyński-Landsberg, 13) If R(T 1 ) max{a 1, b 1, c 1 }, then SAC holds. Corollary If a 1 b 1 c 1, then SAC holds. If c 1 = 1, then SAC holds. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

16 SAC holds if one of the dimensions involved is 2 Theorem (Ja Ja-Takche 86; Buczyński-P) If 2 {a 1, a 2, b 1, b 2, c 1, c 2 } then SAC holds. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

17 SAC holds if one of the dimensions involved is 2 Theorem (Ja Ja-Takche 86; Buczyński-P) If 2 {a 1, a 2, b 1, b 2, c 1, c 2 } then SAC holds. Original proof by Ja Ja and Takche relies on some non-trivial facts from linear algebra, such as Kronecker s theory of pencils, and on the theory of invariant polynomials. Our proof is simpler and uses geometry. Lemma If b 1 c 1 > a 1 b 1 c 1 b 1 c 1 + 2, then there exists a rank-1 tensor in the image of T 1 : A 1 B 1 C 1. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

18 SAC holds if one of the dimensions involved is 2 Theorem (Ja Ja-Takche 86; Buczyński-P) If 2 {a 1, a 2, b 1, b 2, c 1, c 2 } then SAC holds. Original proof by Ja Ja and Takche relies on some non-trivial facts from linear algebra, such as Kronecker s theory of pencils, and on the theory of invariant polynomials. Our proof is simpler and uses geometry. Lemma If b 1 c 1 > a 1 b 1 c 1 b 1 c 1 + 2, then there exists a rank-1 tensor in the image of T 1 : A 1 B 1 C 1. Proof. dim P(T 1 (A 1 )) = a 1 1, Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

19 SAC holds if one of the dimensions involved is 2 Theorem (Ja Ja-Takche 86; Buczyński-P) If 2 {a 1, a 2, b 1, b 2, c 1, c 2 } then SAC holds. Original proof by Ja Ja and Takche relies on some non-trivial facts from linear algebra, such as Kronecker s theory of pencils, and on the theory of invariant polynomials. Our proof is simpler and uses geometry. Lemma If b 1 c 1 > a 1 b 1 c 1 b 1 c 1 + 2, then there exists a rank-1 tensor in the image of T 1 : A 1 B 1 C 1. Proof. dim P(T 1 (A 1 )) = a 1 1, codim Seg(P(B 1 ) P(C 1 )) = b 1 c 1 b 1 c Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

20 SAC holds if one of the dimensions involved is 2 Theorem (Ja Ja-Takche 86; Buczyński-P) If 2 {a 1, a 2, b 1, b 2, c 1, c 2 } then SAC holds. Original proof by Ja Ja and Takche relies on some non-trivial facts from linear algebra, such as Kronecker s theory of pencils, and on the theory of invariant polynomials. Our proof is simpler and uses geometry. Lemma If b 1 c 1 > a 1 b 1 c 1 b 1 c 1 + 2, then there exists a rank-1 tensor in the image of T 1 : A 1 B 1 C 1. Proof. dim P(T 1 (A 1 )) = a 1 1, codim Seg(P(B 1 ) P(C 1 )) = b 1 c 1 b 1 c Hence the varieties P(T 1 (A 1 )) and Seg(P(B 1) P(C 1 )) have non-empty intersection in P(B 1 C 1 ). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

21 SAC holds if one of the dimensions involved is 2 Proof of Thm [Buczyński-P]: Assume T 1, T 2 concise and assume, w.l.o.g, that c 1 = 2. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

22 SAC holds if one of the dimensions involved is 2 Proof of Thm [Buczyński-P]: Assume T 1, T 2 concise and assume, w.l.o.g, that c 1 = 2. Assume that T = T 1 + T 2 is minimal (lowest rank) such that SAC does not hold, namely such that R(T ) < R(T 1 ) + R(T 2 ). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

23 SAC holds if one of the dimensions involved is 2 Proof of Thm [Buczyński-P]: Assume T 1, T 2 concise and assume, w.l.o.g, that c 1 = 2. Assume that T = T 1 + T 2 is minimal (lowest rank) such that SAC does not hold, namely such that R(T ) < R(T 1 ) + R(T 2 ). 1 By Lemma, there exists a rank-1 tensor in the image of T 1 (A 1 ) B 1 C 1, and thus also in the image T ((A 1 A 2 ) ) B C. 2 Hence there exists a minimal decomposition of T 1 + T 2 in rank-1 tensors such that one summand, q is an element in A 1 B 1 C 1. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

24 SAC holds if one of the dimensions involved is 2 Proof of Thm [Buczyński-P]: Assume T 1, T 2 concise and assume, w.l.o.g, that c 1 = 2. Assume that T = T 1 + T 2 is minimal (lowest rank) such that SAC does not hold, namely such that R(T ) < R(T 1 ) + R(T 2 ). 1 By Lemma, there exists a rank-1 tensor in the image of T 1 (A 1 ) B 1 C 1, and thus also in the image T ((A 1 A 2 ) ) B C. 2 Hence there exists a minimal decomposition of T 1 + T 2 in rank-1 tensors such that one summand, q is an element in A 1 B 1 C 1. 3 We can reduce to T q = (T 1 q) + T 2, with T 1 q A 1 B 1 C 1 and R(T q) < R(T 1 q) + R(T 2 ) and find a smaller counterexample. Contradiction. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

25 Symmetric Strassen conjecture Let F be a degree-d form in C[x 1,..., x n ]. Definition The symmetric rank of F, R s (F ), is the minimal r such that F = d i=1 Ld i, Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

26 Symmetric Strassen conjecture Let F be a degree-d form in C[x 1,..., x n ]. Definition The symmetric rank of F, R s (F ), is the minimal r such that F = d i=1 Ld i, Conjecture (Symmetric SAC) If F i C[x 1,..., x ni ] d, i = 1, 2, then R s (F + G) = R s (F ) + R s (G). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

27 Symmetric Strassen conjecture Let F be a degree-d form in C[x 1,..., x n ]. Definition The symmetric rank of F, R s (F ), is the minimal r such that F = d i=1 Ld i, Conjecture (Symmetric SAC) If F i C[x 1,..., x ni ] d, i = 1, 2, then R s (F + G) = R s (F ) + R s (G). Theorem (Carlini-Catalisano-Chiantini 15) True for binary forms (n 1, n 2 = 2). Theorem (Carlini-Catalisano-Chiantini-Geramita-Woo 15) True for arbitrary sums of binary forms. Proof. Uses Hilbert functions of sets of points and apolarity. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

28 Symmetric Strassen conjecture Let F be a degree-d form in C[x 1,..., x n ]. Definition The symmetric rank of F, R s (F ), is the minimal r such that F = d i=1 Ld i, Conjecture (Symmetric SAC) If F i C[x 1,..., x ni ] d, i = 1, 2, then R s (F + G) = R s (F ) + R s (G). Theorem (Carlini-Catalisano-Chiantini 15) True for binary forms (n 1, n 2 = 2). Theorem (Carlini-Catalisano-Chiantini-Geramita-Woo 15) True for arbitrary sums of binary forms. Proof. Uses Hilbert functions of sets of points and apolarity. Conjecture (Comon s conjecture) R s (F ) = R(F ). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

29 Additivity for border rank of tensors Definition A tensor T A B C has border rank r = R(T ) if it is a limit of tensors of rank r, but not a limit of tensors of rank < r. {T : R(T ) r} σ r (Seg(P(A) P(B) P(C)) P(A B C) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

30 Additivity for border rank of tensors Definition A tensor T A B C has border rank r = R(T ) if it is a limit of tensors of rank r, but not a limit of tensors of rank < r. {T : R(T ) r} σ r (Seg(P(A) P(B) P(C)) P(A B C) Example (Landsberg 06) R(M 2,2,2 ) = R(M 2,2,2 ) = 7 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

31 Additivity for border rank of tensors Definition A tensor T A B C has border rank r = R(T ) if it is a limit of tensors of rank r, but not a limit of tensors of rank < r. {T : R(T ) r} σ r (Seg(P(A) P(B) P(C)) P(A B C) Example (Landsberg 06) R(M 2,2,2 ) = R(M 2,2,2 ) = 7 Question (Border SAC) R(T 1 + T 2 ) = R(T 1 ) + R(T 1 )? Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

32 Additivity for border rank of tensors Definition A tensor T A B C has border rank r = R(T ) if it is a limit of tensors of rank r, but not a limit of tensors of rank < r. {T : R(T ) r} σ r (Seg(P(A) P(B) P(C)) P(A B C) Example (Landsberg 06) R(M 2,2,2 ) = R(M 2,2,2 ) = 7 Question (Border SAC) R(T 1 + T 2 ) = R(T 1 ) + R(T 1 )? Counterexample (Schönhage 81) Border SAC is false if (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (6 + 1, 3 + 2, 2 + 2). Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

33 Additivity for border rank of tensors? Yes Case (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, 3 + 1, 3 + 1) with R(T 1 ) = 5. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

34 Additivity for border rank of tensors? Yes Case (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, 3 + 1, 3 + 1) with R(T 1 ) = 5. 3 T 1 = a i X i (assume concise) i=1 {a 1, a 2, a 3 } basis for A 1 = C 3 X i B 1 C 1 = C 3 C 3 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

35 Additivity for border rank of tensors? Yes Case (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, 3 + 1, 3 + 1) with R(T 1 ) = 5. T 1 = 3 a i X i i=1 (assume concise) {a 1, a 2, a 3 } basis for A 1 = C 3 X i B 1 C 1 = C 3 C 3 Strassen s degree-9 equation for σ 4 (Seg(P 2 P 2 P 2 )) 0 X 3 X 2 det(m(x 1, X 2, X 3 )) = X 3 0 X 1 X 2 X 1 0 = 0 Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

36 Additivity for border rank of tensors? Yes Case (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, 3 + 1, 3 + 1) with R(T 1 ) = 5. T 1 = 3 a i X i i=1 (assume concise) {a 1, a 2, a 3 } basis for A 1 = C 3 X i B 1 C 1 = C 3 C 3 Strassen s degree-9 equation for σ 4 (Seg(P 2 P 2 P 2 )) 0 X 3 X 2 det(m(x 1, X 2, X 3 )) = X 3 0 X 1 X 2 X 1 0 = 0 T 2 = a 4 b c C C C Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

37 Additivity for border rank of tensors? Yes Case (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, 3 + 1, 3 + 1) with R(T 1 ) = 5. T 1 = 3 a i X i i=1 (assume concise) {a 1, a 2, a 3 } basis for A 1 = C 3 X i B 1 C 1 = C 3 C 3 Strassen s degree-9 equation for σ 4 (Seg(P 2 P 2 P 2 )) 0 X 3 X 2 det(m(x 1, X 2, X 3 )) = X 3 0 X 1 X 2 X 1 0 = 0 with Y i = T 2 = a 4 b c C C C T 1 + T 2 = a 1 Y a 4 Y 4 ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

38 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

39 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

40 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := 3 i=1 ) ( Xi 0 a i 0 1 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

41 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := Strassen s equations for σ 5 (Seg(P 2 P 3 P 3 )) 10 rk M(Y 1, Y 2, Y 3) 3 i=1 ) ( Xi 0 a i 0 1 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

42 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := 3 i=1 ) ( Xi 0 a i 0 1 Strassen s equations for σ 5 (Seg(P 2 P 3 P 3 )) ( ) 10 rk M(Y 1, Y 2, Y 3) M(X1, X = rk 2, X 3 ) 0 0 M(1, 1, 1) ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

43 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := 3 i=1 ) ( Xi 0 a i 0 1 Strassen s equations for σ 5 (Seg(P 2 P 3 P 3 )) ( ) 10 rk M(Y 1, Y 2, Y 3) M(X1, X = rk 2, X 3 ) 0 0 M(1, 1, 1) rk M(Y 1, Y 2, Y 3 ) = = 11 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

44 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := 3 i=1 ) ( Xi 0 a i 0 1 Strassen s equations for σ 5 (Seg(P 2 P 3 P 3 )) ( ) 10 rk M(Y 1, Y 2, Y 3) M(X1, X = rk 2, X 3 ) 0 0 M(1, 1, 1) rk M(Y 1, Y 2, Y 3 ) = = 11 R(T 1 + T 2 ) 6 ) Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

45 Additivity for border rank of tensors? Yes Y i = ( Xi ) ( , i {1, 2, 3} and Y 4 = 0 1 Take the projection π : A B C A 1 B C a i a i, i {1, 2, 3} a 4 a 1 + a 2 + a 3. T 1 + T 2 3 i=1 a i Y i := 3 i=1 ) ( Xi 0 a i 0 1 Strassen s equations for σ 5 (Seg(P 2 P 3 P 3 )) ( ) 10 rk M(Y 1, Y 2, Y 3) M(X1, X = rk 2, X 3 ) 0 0 M(1, 1, 1) rk M(Y 1, Y 2, Y 3 ) = = 11 R(T 1 + T 2 ) 6 border SAC holds! Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13 )

46 Additivity for border rank of tensors? Yes Using (variants of) Strassen s equations for σ 4 : border SAC holds if (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1) 3 with R(T 1 ) = 5, R(T 2 ) = 1. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

47 Additivity for border rank of tensors? Yes Using (variants of) Strassen s equations for σ 4 : border SAC holds if (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1) 3 with R(T 1 ) = 5, R(T 2 ) = 1. (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 2) 3 with R(T 1 ) = 5, R(T 2 ) = 2. (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, (2 + 2) 2 ) with R(T 1 ) = 3,R(T 2 ) = 2. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

48 Additivity for border rank of tensors? Yes Using (variants of) Strassen s equations for σ 4 : border SAC holds if (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1) 3 with R(T 1 ) = 5, R(T 2 ) = 1. (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 2) 3 with R(T 1 ) = 5, R(T 2 ) = 2. (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1, (2 + 2) 2 ) with R(T 1 ) = 3,R(T 2 ) = 2. Similarly, using Friedland s equations for σ 3 (Seg(P 2 P 3 P 3 )): border SAC holds for (a 1 + a 2, b 1 + b 2, c 1 + c 2 ) = (3 + 1) 3 with R(T 1 ) = 4, R(T 2 ) = 1. Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

49 Bibliography [1] J. Buczyński, J. M. Landsberg Ranks of tensors and a generalization of secant varieties, Linear Algebra Appl. 438 (2013), no. 2, A69 [2] J. Buczyński, E. Postinghel, Remarks on Strassen s conjecture, In preparation. [3] E. Carlini, M. V. Catalisano, L. Chiantini Progress on the symmetric Strassen conjecture, J. Pure Appl. Algebra 219 (2015), no. 8, [4] J. Ja Ja, J. Takche, On the validity of the direct sum conjecture, SIAM J. Comput. 15 (1986), no. 4, [5] J. M. Landsberg, The border rank of the multiplication of 22 matrices is seven, J. Amer. Math. Soc. 19 (2006), no. 2, [6] A. Schönhage, Partial and total matrix multiplication, SIAM J. Comput. 10 (1981), no. 3, [7] V. Strassen, Gaussian elimination is not optimal, Numer. Math. 13 (1969) [8] V. Strassen, Vermeidung von Divisionen, J. Reine Angew. Math. 264 (1973), THANKS!! Elisa Postinghel (KU Leuven) () On Strassen s Conjecture SIAM AG / 13

On the geometry of matrix multiplication

On the geometry of matrix multiplication On the geometry of matrix multiplication J.M. Landsberg Texas A&M University Spring 2018 AMS Sectional Meeting 1 / 27 A practical problem: efficient linear algebra Standard algorithm for matrix multiplication,

More information

Oeding (Auburn) tensors of rank 5 December 15, / 24

Oeding (Auburn) tensors of rank 5 December 15, / 24 Oeding (Auburn) 2 2 2 2 2 tensors of rank 5 December 15, 2015 1 / 24 Recall Peter Burgisser s overview lecture (Jan Draisma s SIAM News article). Big Goal: Bound the computational complexity of det n,

More information

Higher secant varieties of classical projective varieties

Higher secant varieties of classical projective varieties Higher secant varieties of classical projective varieties Maria Virginia Catalisano DIME Università degli Studi di Genova Research Station on Commutative Algebra Yangpyeong - June 13-17, 2016 Maria Virginia

More information

Homotopy Techniques for Tensor Decomposition and Perfect Identifiability

Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Homotopy Techniques for Tensor Decomposition and Perfect Identifiability Luke Oeding Auburn University with Hauenstein (Notre Dame), Ottaviani (Firenze) and Sommese (Notre Dame) Oeding (Auburn) Homotopy

More information

RANKS OF TENSORS AND AND A GENERALIZATION OF SECANT VARIETIES

RANKS OF TENSORS AND AND A GENERALIZATION OF SECANT VARIETIES RANKS OF TENSORS AND AND A GENERALIZATION OF SECANT VARIETIES JAROS LAW BUCZYŃSKI AND J.M. LANDSBERG Abstract. We investigate differences between X-rank and X-border rank, focusing on the cases of tensors

More information

On the effective cone of P n blown-up at n + 3 points (and other positivity properties)

On the effective cone of P n blown-up at n + 3 points (and other positivity properties) On the effective cone of P n blown-up at n + 3 points (and other positivity properties) Elisa Postinghel KU Leuven joint with M.C. Brambilla (Ancona) and O. Dumitrescu (Hannover) Daejeon August 3-7, 2015

More information

Ranks of Real Symmetric Tensors

Ranks of Real Symmetric Tensors Ranks of Real Symmetric Tensors Greg Blekherman SIAM AG 2013 Algebraic Geometry of Tensor Decompositions Real Symmetric Tensor Decompositions Let f be a form of degree d in R[x 1,..., x n ]. We would like

More information

Direct Sum Decomposability of Polynomials

Direct Sum Decomposability of Polynomials Direct Sum Decomposability of Polynomials Zach Teitler Interactions between Commutative Algebra and Algebraic Geometry II September 28, 2013 Joint work with Weronika Buczyńska, Jarek Buczyński, Johannes

More information

Is Every Secant Variety of a Segre Product Arithmetically Cohen Macaulay? Oeding (Auburn) acm Secants March 6, / 23

Is Every Secant Variety of a Segre Product Arithmetically Cohen Macaulay? Oeding (Auburn) acm Secants March 6, / 23 Is Every Secant Variety of a Segre Product Arithmetically Cohen Macaulay? Luke Oeding Auburn University Oeding (Auburn) acm Secants March 6, 2016 1 / 23 Secant varieties and tensors Let V 1,..., V d, be

More information

How to find good starting tensors for matrix multiplication

How to find good starting tensors for matrix multiplication How to find good starting tensors for matrix multiplication Markus Bläser Saarland University Matrix multiplication z,... z,n..... z n,... z n,n = x,... x,n..... x n,... x n,n y,... y,n..... y n,... y

More information

THE COMPLEXITY OF THE QUATERNION PROD- UCT*

THE COMPLEXITY OF THE QUATERNION PROD- UCT* 1 THE COMPLEXITY OF THE QUATERNION PROD- UCT* Thomas D. Howell Jean-Claude Lafon 1 ** TR 75-245 June 1975 2 Department of Computer Science, Cornell University, Ithaca, N.Y. * This research was supported

More information

Ranks and generalized ranks

Ranks and generalized ranks Ranks and generalized ranks Zach Teitler Boise State University SIAM Conference on Applied Algebraic Geometry Minisymposium on Algebraic Geometry of Tensor Decompositions and its Applications October 7,

More information

A COUNTEREXAMPLE TO STRASSEN S DIRECT SUM CONJECTURE arxiv: v1 [math.co] 22 Dec 2017

A COUNTEREXAMPLE TO STRASSEN S DIRECT SUM CONJECTURE arxiv: v1 [math.co] 22 Dec 2017 A COUNTEREXAMPLE TO STRASSEN S DIRECT SUM CONJECTURE arxiv:1712.08660v1 [math.co] 22 Dec 2017 YAROSLAV SHITOV The multiplicative complexity of systems of bilinear forms (and, in particular, the famous

More information

Maximum Waring Ranks of Monomials and Sums of Coprime Monomials

Maximum Waring Ranks of Monomials and Sums of Coprime Monomials Boise State University ScholarWorks Mathematics Faculty Publications and Presentations Department of Mathematics 6-3-2016 Maximum Waring Ranks of Monomials and Sums of Coprime Monomials Erik Holmes University

More information

Inner Rank and Lower Bounds for Matrix Multiplication

Inner Rank and Lower Bounds for Matrix Multiplication Inner Rank and Lower Bounds for Matrix Multiplication Joel Friedman University of British Columbia www.math.ubc.ca/ jf Jerusalem June 19, 2017 Joel Friedman (UBC) Inner Rank and Lower Bounds June 19, 2017

More information

Math 113 Winter 2013 Prof. Church Midterm Solutions

Math 113 Winter 2013 Prof. Church Midterm Solutions Math 113 Winter 2013 Prof. Church Midterm Solutions Name: Student ID: Signature: Question 1 (20 points). Let V be a finite-dimensional vector space, and let T L(V, W ). Assume that v 1,..., v n is a basis

More information

Giorgio Ottaviani. Università di Firenze. Tutorial on Tensor rank and tensor decomposition

Giorgio Ottaviani. Università di Firenze. Tutorial on Tensor rank and tensor decomposition Tutorial: A brief survey on tensor rank and tensor decomposition, from a geometric perspective. Workshop Computational nonlinear Algebra (June 2-6, 2014) ICERM, Providence Università di Firenze Tensors

More information

Skew-symmetric tensor decomposition

Skew-symmetric tensor decomposition [Arrondo,, Macias Marques, Mourrain] University of Trento, Italy September 28, 2018 Warsaw Symmetric-rank C[x 0,..., x n ] d F = r λ i L d i i=1 S d C n+1 F = r i=1 λ i v d i this corresponds to find the

More information

Tensor decomposition and tensor rank

Tensor decomposition and tensor rank from the point of view of Classical Algebraic Geometry RTG Workshop Tensors and their Geometry in High Dimensions (September 26-29, 2012) UC Berkeley Università di Firenze Content of the three talks Wednesday

More information

J.M. LANDSBERG AND MATEUSZ MICHA LEK

J.M. LANDSBERG AND MATEUSZ MICHA LEK A 2n 2 log 2 (n) 1 LOWER BOUND FOR THE BORDER RANK OF MATRIX MULTIPLICATION J.M. LANDSBERG AND MATEUSZ MICHA LEK Abstract. Let M n C n2 C n2 C n2 denote the matrix multiplication tensor for n n matrices.

More information

Secant Varieties and Equations of Abo-Wan Hypersurfaces

Secant Varieties and Equations of Abo-Wan Hypersurfaces Secant Varieties and Equations of Abo-Wan Hypersurfaces Luke Oeding Auburn University Oeding (Auburn, NIMS) Secants, Equations and Applications August 9, 214 1 / 34 Secant varieties Suppose X is an algebraic

More information

Special Session on Secant Varieties. and Related Topics. Secant Varieties of Grassmann and Segre Varieties. Giorgio Ottaviani

Special Session on Secant Varieties. and Related Topics. Secant Varieties of Grassmann and Segre Varieties. Giorgio Ottaviani Special Session on Secant Varieties and Related Topics Secant Varieties of Grassmann and Segre Varieties Giorgio Ottaviani ottavian@math.unifi.it www.math.unifi.it/users/ottavian Università di Firenze

More information

GEOMETRY OF FEASIBLE SPACES OF TENSORS. A Dissertation YANG QI

GEOMETRY OF FEASIBLE SPACES OF TENSORS. A Dissertation YANG QI GEOMETRY OF FEASIBLE SPACES OF TENSORS A Dissertation by YANG QI Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree of DOCTOR

More information

Tensor decomposition and moment matrices

Tensor decomposition and moment matrices Tensor decomposition and moment matrices J. Brachat (Ph.D.) & B. Mourrain GALAAD, INRIA Méditerranée, Sophia Antipolis Bernard.Mourrain@inria.fr SIAM AAG, Raleigh, NC, Oct. -9, 211 Collaboration with A.

More information

Report on the recent progress on the study of the secant defectivity of Segre-Veronese varieties. Hirotachi Abo

Report on the recent progress on the study of the secant defectivity of Segre-Veronese varieties. Hirotachi Abo Report on the recent progress on the study of the secant defectivity of Segre-Veronese varieties (joint work with M. C. Brambilla) Hirotachi Abo Department of Mathematics University of Idaho abo@uidaho.edu

More information

I. Approaches to bounding the exponent of matrix multiplication

I. 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 information

An algebraic approach to phase retrieval

An algebraic approach to phase retrieval University of Michigan joint with Aldo Conca, Dan Edidin, and Milena Hering. I learned about frame theory from... AIM Workshop: Frame theory intersects geometry http://www.aimath.org/arcc/workshops/frametheorygeom.html

More information

Pacific Journal of Mathematics

Pacific Journal of Mathematics Pacific Journal of Mathematics GROUP ACTIONS ON POLYNOMIAL AND POWER SERIES RINGS Peter Symonds Volume 195 No. 1 September 2000 PACIFIC JOURNAL OF MATHEMATICS Vol. 195, No. 1, 2000 GROUP ACTIONS ON POLYNOMIAL

More information

The Waring rank of the Vandermonde determinant

The Waring rank of the Vandermonde determinant The Waring rank of the Vandermonde determinant Alexander Woo (U. Idaho) joint work with Zach Teitler(Boise State) SIAM Conference on Applied Algebraic Geometry, August 3, 2014 Waring rank Given a polynomial

More information

MATH 304 Linear Algebra Lecture 20: Review for Test 1.

MATH 304 Linear Algebra Lecture 20: Review for Test 1. MATH 304 Linear Algebra Lecture 20: Review for Test 1. Topics for Test 1 Part I: Elementary linear algebra (Leon 1.1 1.4, 2.1 2.2) Systems of linear equations: elementary operations, Gaussian elimination,

More information

Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property

Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property Numerically Testing Generically Reduced Projective Schemes for the Arithmetic Gorenstein Property Noah S. Daleo 1 and Jonathan D. Hauenstein 2 1 Department of Mathematics, North Carolina State University,

More information

Tensors: a geometric view Open lecture November 24, 2014 Simons Institute, Berkeley. Giorgio Ottaviani, Università di Firenze

Tensors: a geometric view Open lecture November 24, 2014 Simons Institute, Berkeley. Giorgio Ottaviani, Università di Firenze Open lecture November 24, 2014 Simons Institute, Berkeley Plan of the talk Introduction to Tensors A few relevant applications Tensors as multidimensional matrices A (complex) a b c tensor is an element

More information

Algorithms for structured matrix-vector product of optimal bilinear complexity

Algorithms for structured matrix-vector product of optimal bilinear complexity Algorithms for structured matrix-vector product of optimal bilinear complexity arxiv:160306658v1 mathna] Mar 016 Ke Ye Computational Applied Mathematics Initiative Department of Statistics University of

More information

Explicit tensors. Markus Bläser. 1. Tensors and rank

Explicit tensors. Markus Bläser. 1. Tensors and rank Explicit tensors Markus Bläser Abstract. This is an expository article the aim of which is to introduce interested students and researchers to the topic of tensor rank, in particular to the construction

More information

arxiv:math/ v1 [math.ag] 3 May 2006

arxiv:math/ v1 [math.ag] 3 May 2006 arxiv:math/0605108v1 [math.ag] 3 May 2006 SPECIAL SYSTEMS THROUGH DOUBLE POINTS ON AN ALGEBRAIC SURFACE ANTONIO LAFACE Abstract. Let S be a smooth algebraic surface satisfying the following property: H

More information

Direct Sum Decomposability of Polynomials

Direct Sum Decomposability of Polynomials Zach Teitler (BSU) Direct Sum Decomposability of Polynomials 1 / 15 Direct Sum Decomposability of Polynomials Zach Teitler SIAM Applied Algebraic Geometry August 1, 2013 Joint work with Weronika Buczyńska,

More information

A proof of the Jordan normal form theorem

A proof of the Jordan normal form theorem A proof of the Jordan normal form theorem Jordan normal form theorem states that any matrix is similar to a blockdiagonal matrix with Jordan blocks on the diagonal. To prove it, we first reformulate it

More information

GEOMETRY AND THE COMPLEXITY OF MATRIX MULTIPLICATION

GEOMETRY AND THE COMPLEXITY OF MATRIX MULTIPLICATION BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 45, Number 2, April 2008, Pages 247 284 S 0273-0979(08)01176-2 Article electronically published on January 7, 2008 GEOMETRY AND THE COMPLEXITY

More information

Determining a Binary Matroid from its Small Circuits

Determining a Binary Matroid from its Small Circuits Determining a Binary Matroid from its Small Circuits James Oxley Department of Mathematics Louisiana State University Louisiana, USA oxley@math.lsu.edu Charles Semple School of Mathematics and Statistics

More information

Secant Varieties of Segre Varieties. M. Catalisano, A.V. Geramita, A. Gimigliano

Secant Varieties of Segre Varieties. M. Catalisano, A.V. Geramita, A. Gimigliano . Secant Varieties of Segre Varieties M. Catalisano, A.V. Geramita, A. Gimigliano 1 I. Introduction Let X P n be a reduced, irreducible, and nondegenerate projective variety. Definition: Let r n, then:

More information

Complexity of Matrix Multiplication and Bilinear Problems

Complexity of Matrix Multiplication and Bilinear Problems Complexity of Matrix Multiplication and Bilinear Problems François Le Gall Graduate School of Informatics Kyoto University ADFOCS17 - Lecture 3 24 August 2017 Overview of the Lectures Fundamental techniques

More information

Math 121 Homework 4: Notes on Selected Problems

Math 121 Homework 4: Notes on Selected Problems Math 121 Homework 4: Notes on Selected Problems 11.2.9. If W is a subspace of the vector space V stable under the linear transformation (i.e., (W ) W ), show that induces linear transformations W on W

More information

Tensors. Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra

Tensors. Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra Tensors Notes by Mateusz Michalek and Bernd Sturmfels for the lecture on June 5, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra This lecture is divided into two parts. The first part,

More information

Algorithms for exact (dense) linear algebra

Algorithms for exact (dense) linear algebra Algorithms for exact (dense) linear algebra Gilles Villard CNRS, Laboratoire LIP ENS Lyon Montagnac-Montpezat, June 3, 2005 Introduction Problem: Study of complexity estimates for basic problems in exact

More information

Pencil-based algorithms for tensor rank decomposition are unstable

Pencil-based algorithms for tensor rank decomposition are unstable Pencil-based algorithms for tensor rank decomposition are unstable September 13, 2018 Nick Vannieuwenhoven (FWO / KU Leuven) Introduction Overview 1 Introduction 2 Sensitivity 3 Pencil-based algorithms

More information

Discovering Fast Matrix Multiplication Algorithms via Tensor Decomposition

Discovering Fast Matrix Multiplication Algorithms via Tensor Decomposition Discovering Fast Matrix Multiplication Algorithms via Tensor Decomposition Grey Ballard SIAM onference on omputational Science & Engineering March, 207 ollaborators This is joint work with... Austin Benson

More information

T -equivariant tensor rank varieties and their K-theory classes

T -equivariant tensor rank varieties and their K-theory classes T -equivariant tensor rank varieties and their K-theory classes 2014 July 18 Advisor: Professor Anders Buch, Department of Mathematics, Rutgers University Overview 1 Equivariant K-theory Overview 2 Determinantal

More information

Fast Approximate Matrix Multiplication by Solving Linear Systems

Fast Approximate Matrix Multiplication by Solving Linear Systems Electronic Colloquium on Computational Complexity, Report No. 117 (2014) Fast Approximate Matrix Multiplication by Solving Linear Systems Shiva Manne 1 and Manjish Pal 2 1 Birla Institute of Technology,

More information

Linear Algebra. Min Yan

Linear Algebra. Min Yan Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................

More information

Forms as sums of powers of lower degree forms

Forms as sums of powers of lower degree forms Bruce Reznick University of Illinois at Urbana-Champaign SIAM Conference on Applied Algebraic Geometry Algebraic Geometry of Tensor Decompositions Fort Collins, Colorado August 2, 2013 Let H d (C n ) denote

More information

TENSORS Workshop. September 10th 14th, Politecnico di Torino, Italy

TENSORS Workshop. September 10th 14th, Politecnico di Torino, Italy TENSORS Workshop September 10th 14th, 2018 Politecnico di Torino, Italy Tensors is a scientific activity of the project DISMA - Dipartimento di Eccellenza 2018-2022 SCHEDULE TITLES AND ABSTRACTS Lecture

More information

The number of singular vector tuples and approximation of symmetric tensors / 13

The number of singular vector tuples and approximation of symmetric tensors / 13 The number of singular vector tuples and approximation of symmetric tensors Shmuel Friedland Univ. Illinois at Chicago Colloquium NYU Courant May 12, 2014 Joint results with Giorgio Ottaviani and Margaret

More information

Powers of Tensors and Fast Matrix Multiplication

Powers of Tensors and Fast Matrix Multiplication Powers of Tensors and Fast Matrix Multiplication François Le Gall Department of Computer Science Graduate School of Information Science and Technology The University of Tokyo Simons Institute, 12 November

More information

Eigenvectors of Tensors and Waring Decomposition

Eigenvectors of Tensors and Waring Decomposition Eigenvectors of Tensors and Waring Decomposition Luke Oeding University of California Berkeley Oeding, Ottaviani (UCB, Firenze) Giorgio Ottaviani Universita degli Studi di Firenze Waring Decomposition

More information

Secant varieties. Marin Petkovic. November 23, 2015

Secant varieties. Marin Petkovic. November 23, 2015 Secant varieties Marin Petkovic November 23, 2015 Abstract The goal of this talk is to introduce secant varieies and show connections of secant varieties of Veronese variety to the Waring problem. 1 Secant

More information

A concise proof of Kruskal s theorem on tensor decomposition

A concise proof of Kruskal s theorem on tensor decomposition A concise proof of Kruskal s theorem on tensor decomposition John A. Rhodes 1 Department of Mathematics and Statistics University of Alaska Fairbanks PO Box 756660 Fairbanks, AK 99775 Abstract A theorem

More information

The Geometry of Matrix Rigidity

The Geometry of Matrix Rigidity The Geometry of Matrix Rigidity Joseph M. Landsberg Jacob Taylor Nisheeth K. Vishnoi November 26, 2003 Abstract Consider the following problem: Given an n n matrix A and an input x, compute Ax. This problem

More information

On the pfaffian representation of general homogeneous polynomials. Toulouse Nov 2009

On the pfaffian representation of general homogeneous polynomials. Toulouse Nov 2009 On the pfaffian representation of general homogeneous polynomials Toulouse Nov 2009 Bibliography E.Carlini, L.Chiantini, A.Geramita. COMPLETE INTERSECTION POINTS ON GENERAL SURFACES IN P^3. arxiv:0811.2233

More information

On the Waring problem for polynomial rings

On the Waring problem for polynomial rings On the Waring problem for polynomial rings Boris Shapiro jointly with Ralf Fröberg, Giorgio Ottaviani Université de Genève, March 21, 2016 Introduction In this lecture we discuss an analog of the classical

More information

arxiv: v1 [cs.cc] 25 Oct 2016

arxiv: v1 [cs.cc] 25 Oct 2016 THE GEOMETRY OF RANK DECOMPOSITIONS OF MATRIX MULTIPLICATION I: 2 2 MATRICES LUCA CHIANTINI, CHRISTIAN IKENMEYER, J.M. LANDSBERG, AND GIORGIO OTTAVIANI arxiv:60.08364v [cs.cc] 25 Oct 206 Abstract. This

More information

TWO REMARKS ABOUT NILPOTENT OPERATORS OF ORDER TWO

TWO REMARKS ABOUT NILPOTENT OPERATORS OF ORDER TWO TWO REMARKS ABOUT NILPOTENT OPERATORS OF ORDER TWO STEPHAN RAMON GARCIA, BOB LUTZ, AND DAN TIMOTIN Abstract. We present two novel results about Hilbert space operators which are nilpotent of order two.

More information

Geometric Complexity Theory and Matrix Multiplication (Tutorial)

Geometric Complexity Theory and Matrix Multiplication (Tutorial) Geometric Complexity Theory and Matrix Multiplication (Tutorial) Peter Bürgisser Technische Universität Berlin Workshop on Geometric Complexity Theory Simons Institute for the Theory of Computing Berkeley,

More information

STABLY FREE MODULES KEITH CONRAD

STABLY FREE MODULES KEITH CONRAD STABLY FREE MODULES KEITH CONRAD 1. Introduction Let R be a commutative ring. When an R-module has a particular module-theoretic property after direct summing it with a finite free module, it is said to

More information

The Hilbert functions which force the Weak Lefschetz Property

The Hilbert functions which force the Weak Lefschetz Property The Hilbert functions which force the Weak Lefschetz Property JUAN MIGLIORE Department of Mathematics, University of Notre Dame, Notre Dame, IN 46556, USA E-mail: Juan.C.Migliore.1@nd.edu FABRIZIO ZANELLO

More information

Bulletin of the. Iranian Mathematical Society

Bulletin of the. Iranian Mathematical Society ISSN: 1017-060X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 41 (2015), No. 4, pp. 815 824. Title: Pseudo-almost valuation rings Author(s): R. Jahani-Nezhad and F.

More information

x y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2

x y B =. v u Note that the determinant of B is xu + yv = 1. Thus B is invertible, with inverse u y v x On the other hand, d BA = va + ub 2 5. Finitely Generated Modules over a PID We want to give a complete classification of finitely generated modules over a PID. ecall that a finitely generated module is a quotient of n, a free module. Let

More information

A short proof of Klyachko s theorem about rational algebraic tori

A short proof of Klyachko s theorem about rational algebraic tori A short proof of Klyachko s theorem about rational algebraic tori Mathieu Florence Abstract In this paper, we give another proof of a theorem by Klyachko ([?]), which asserts that Zariski s conjecture

More information

On Computably Enumerable Sets over Function Fields

On Computably Enumerable Sets over Function Fields On Computably Enumerable Sets over Function Fields Alexandra Shlapentokh East Carolina University Joint Meetings 2017 Atlanta January 2017 Some History Outline 1 Some History A Question and the Answer

More information

THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany

THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany #A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,

More information

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin

STABILITY OF INVARIANT SUBSPACES OF COMMUTING MATRICES We obtain some further results for pairs of commuting matrices. We show that a pair of commutin On the stability of invariant subspaces of commuting matrices Tomaz Kosir and Bor Plestenjak September 18, 001 Abstract We study the stability of (joint) invariant subspaces of a nite set of commuting

More information

Algebras of minimal multiplicative complexity

Algebras of minimal multiplicative complexity Algebras of minimal multiplicative complexity Markus Bläser Department of Computer Science Saarland University Saarbrücken, Germany mblaeser@cs.uni-saarland.de Bekhan Chokaev Department of Computer Science

More information

Math 283 Spring 2013 Presentation Problems 4 Solutions

Math 283 Spring 2013 Presentation Problems 4 Solutions Math 83 Spring 013 Presentation Problems 4 Solutions 1. Prove that for all n, n (1 1k ) k n + 1 n. Note that n means (1 1 ) 3 4 + 1 (). n 1 Now, assume that (1 1k ) n n. Consider k n (1 1k ) (1 1n ) n

More information

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory

ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1. Department of Mathematics. and Lawrence Berkeley Laboratory ON THE COMPLETE PIVOTING CONJECTURE FOR A HADAMARD MATRIX OF ORDER 12 ALAN EDELMAN 1 Department of Mathematics and Lawrence Berkeley Laboratory University of California Berkeley, California 94720 edelman@math.berkeley.edu

More information

The Depth Formula for Modules with Reducible Complexity

The Depth Formula for Modules with Reducible Complexity The Depth Formula for Modules with Reducible Complexity Petter Andreas Bergh David A Jorgensen Technical Report 2010-10 http://wwwutaedu/math/preprint/ THE DEPTH FORMULA FOR MODULES WITH REDUCIBLE COMPLEXITY

More information

Math Introduction to Modern Algebra

Math Introduction to Modern Algebra Math 343 - Introduction to Modern Algebra Notes Field Theory Basics Let R be a ring. M is called a maximal ideal of R if M is a proper ideal of R and there is no proper ideal of R that properly contains

More information

Computer Vision, Convolutions, Complexity and Algebraic Geometry

Computer Vision, Convolutions, Complexity and Algebraic Geometry Computer Vision, Convolutions, Complexity and Algebraic Geometry D. V. Chudnovsky, G.V. Chudnovsky IMAS Polytechnic Institute of NYU 6 MetroTech Center Brooklyn, NY 11201 December 6, 2012 Fast Multiplication:

More information

Essential Descent Spectrum and Commuting Compact Perturbations

Essential Descent Spectrum and Commuting Compact Perturbations E extracta mathematicae Vol. 21, Núm. 3, 261 271 (2006) Essential Descent Spectrum and Commuting Compact Perturbations Olfa Bel Hadj Fredj Université Lille 1, UFR de Mathématiques, UMR-CNRS 8524 59655

More information

SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS

SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS SEVERAL PROOFS OF THE IRREDUCIBILITY OF THE CYCLOTOMIC POLYNOMIALS STEVEN H. WEINTRAUB ABSTRACT. We present a number of classical proofs of the irreducibility of the n-th cyclotomic polynomial Φ n (x).

More information

ARITHMETICALLY COHEN-MACAULAY BUNDLES ON THREE DIMENSIONAL HYPERSURFACES

ARITHMETICALLY COHEN-MACAULAY BUNDLES ON THREE DIMENSIONAL HYPERSURFACES ARITHMETICALLY COHEN-MACAULAY BUNDLES ON THREE DIMENSIONAL HYPERSURFACES N. MOHAN KUMAR, A. P. RAO, AND G. V. RAVINDRA Abstract. We prove that any rank two arithmetically Cohen- Macaulay vector bundle

More information

Math 369 Exam #2 Practice Problem Solutions

Math 369 Exam #2 Practice Problem Solutions Math 369 Exam #2 Practice Problem Solutions 2 5. Is { 2, 3, 8 } a basis for R 3? Answer: No, it is not. To show that it is not a basis, it suffices to show that this is not a linearly independent set.

More information

Gordans Finiteness Theorem (Hilberts proof slightly modernized)

Gordans Finiteness Theorem (Hilberts proof slightly modernized) Gordans Finiteness Theorem Hilberts proof slightly modernized Klaus Pommerening April 1975 Let k be an infinite entire ring, V = k 2, the free k-module of rank 2, G, the group SLV. Then G acts in a canocical

More information

Lecture Summaries for Linear Algebra M51A

Lecture Summaries for Linear Algebra M51A These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture

More information

Tensor Rank is Hard to Approximate

Tensor Rank is Hard to Approximate Electronic Colloquium on Computational Complexity, Report No. 86 (2018) Tensor Rank is Hard to Approximate Joseph Swernofsky - KTH Royal Institute of Technology April 20, 2018 Abstract We prove that approximating

More information

Banach Journal of Mathematical Analysis ISSN: (electronic)

Banach Journal of Mathematical Analysis ISSN: (electronic) Banach J. Math. Anal. 6 (2012), no. 1, 139 146 Banach Journal of Mathematical Analysis ISSN: 1735-8787 (electronic) www.emis.de/journals/bjma/ AN EXTENSION OF KY FAN S DOMINANCE THEOREM RAHIM ALIZADEH

More information

MAKSYM FEDORCHUK. n ) = z1 d 1 zn d 1.

MAKSYM FEDORCHUK. n ) = z1 d 1 zn d 1. DIRECT SUM DECOMPOSABILITY OF SMOOTH POLYNOMIALS AND FACTORIZATION OF ASSOCIATED FORMS MAKSYM FEDORCHUK Abstract. We prove an if-and-only-if criterion for direct sum decomposability of a smooth homogeneous

More information

Commuting nilpotent matrices and pairs of partitions

Commuting nilpotent matrices and pairs of partitions Commuting nilpotent matrices and pairs of partitions Roberta Basili Algebraic Combinatorics Meets Inverse Systems Montréal, January 19-21, 2007 We will explain some results on commuting n n matrices and

More information

TWO LECTURES ON APOLARITY AND THE VARIETY OF SUMS OF POWERS

TWO LECTURES ON APOLARITY AND THE VARIETY OF SUMS OF POWERS TWO LECTURES ON APOLARITY AND THE VARIETY OF SUMS OF POWERS KRISTIAN RANESTAD (OSLO), LUKECIN, 5.-6.SEPT 2013 1. Apolarity, Artinian Gorenstein rings and Arithmetic Gorenstein Varieties 1.1. Motivating

More information

On the closures of orbits of fourth order matrix pencils

On the closures of orbits of fourth order matrix pencils On the closures of orbits of fourth order matrix pencils Dmitri D. Pervouchine Abstract In this work we state a simple criterion for nilpotentness of a square n n matrix pencil with respect to the action

More information

REPRESENTATION THEORY WEEK 5. B : V V k

REPRESENTATION THEORY WEEK 5. B : V V k REPRESENTATION THEORY WEEK 5 1. Invariant forms Recall that a bilinear form on a vector space V is a map satisfying B : V V k B (cv, dw) = cdb (v, w), B (v 1 + v, w) = B (v 1, w)+b (v, w), B (v, w 1 +

More information

Eigenvectors. Prop-Defn

Eigenvectors. Prop-Defn Eigenvectors Aim lecture: The simplest T -invariant subspaces are 1-dim & these give rise to the theory of eigenvectors. To compute these we introduce the similarity invariant, the characteristic polynomial.

More information

On the Hilbert Functions of Disjoint Unions of a Linear Space and Many Lines in P n

On the Hilbert Functions of Disjoint Unions of a Linear Space and Many Lines in P n International Mathematical Forum, 5, 2010, no. 16, 787-798 On the Hilbert Functions of Disjoint Unions of a Linear Space and Many Lines in P n E. Ballico 1 Dept. of Mathematics University of Trento 38123

More information

A POLAR, THE CLASS AND PLANE JACOBIAN CONJECTURE

A POLAR, THE CLASS AND PLANE JACOBIAN CONJECTURE Bull. Korean Math. Soc. 47 (2010), No. 1, pp. 211 219 DOI 10.4134/BKMS.2010.47.1.211 A POLAR, THE CLASS AND PLANE JACOBIAN CONJECTURE Dosang Joe Abstract. Let P be a Jacobian polynomial such as deg P =

More information

arxiv: v1 [math.co] 3 Nov 2014

arxiv: v1 [math.co] 3 Nov 2014 SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed

More information

19. Basis and Dimension

19. Basis and Dimension 9. Basis and Dimension In the last Section we established the notion of a linearly independent set of vectors in a vector space V and of a set of vectors that span V. We saw that any set of vectors that

More information

Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q)

Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) Codewords of small weight in the (dual) code of points and k-spaces of P G(n, q) M. Lavrauw L. Storme G. Van de Voorde October 4, 2007 Abstract In this paper, we study the p-ary linear code C k (n, q),

More information

MATH 167: APPLIED LINEAR ALGEBRA Chapter 2

MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 MATH 167: APPLIED LINEAR ALGEBRA Chapter 2 Jesús De Loera, UC Davis February 1, 2012 General Linear Systems of Equations (2.2). Given a system of m equations and n unknowns. Now m n is OK! Apply elementary

More information

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications

A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications A non-commutative algorithm for multiplying (7 7) matrices using 250 multiplications Alexandre Sedoglavic To cite this version: Alexandre Sedoglavic. A non-commutative algorithm for multiplying (7 7) matrices

More information

arxiv: v1 [math.rt] 14 Nov 2007

arxiv: v1 [math.rt] 14 Nov 2007 arxiv:0711.2128v1 [math.rt] 14 Nov 2007 SUPPORT VARIETIES OF NON-RESTRICTED MODULES OVER LIE ALGEBRAS OF REDUCTIVE GROUPS: CORRIGENDA AND ADDENDA ALEXANDER PREMET J. C. Jantzen informed me that the proof

More information

ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley

ALGEBRA: From Linear to Non-Linear. Bernd Sturmfels University of California at Berkeley ALGEBRA: From Linear to Non-Linear Bernd Sturmfels University of California at Berkeley John von Neumann Lecture, SIAM Annual Meeting, Pittsburgh, July 13, 2010 Undergraduate Linear Algebra All undergraduate

More information

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016

MTH 5102 Linear Algebra Practice Final Exam April 26, 2016 Name (Last name, First name): MTH 5 Linear Algebra Practice Final Exam April 6, 6 Exam Instructions: You have hours to complete the exam. There are a total of 9 problems. You must show your work and write

More information