Results 1 
8 of
8
Geometry and the complexity of matrix multiplication
, 2007
"... Abstract. We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii) to motivate researchers to work on these questions, ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
Abstract. We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i) to show how open questions in algebraic complexity theory are naturally posed as questions in geometry and representation theory, (ii) to motivate researchers to work on these questions, and (iii) to point out relations with more general problems in geometry. The key geometric objects for our study are the secant varieties of Segre varieties. We explain how these varieties are also useful for algebraic statistics, the study of phylogenetic invariants, and quantum computing.
New lower bounds for the border rank of matrix multiplication
"... Abstract. The border rank of the matrix multiplication operator for n × n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n 2 − n. Our bounds are better than the previous lower bound (due to Li ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract. The border rank of the matrix multiplication operator for n × n matrices is a standard measure of its complexity. Using techniques from algebraic geometry and representation theory, we show the border rank is at least 2n 2 − n. Our bounds are better than the previous lower bound (due to Lickteig in 1985) of 3 2 n2 + n 2 − 1 for all n ≥ 3. The bounds are obtained by finding new equations that bilinear maps of small border rank must satisfy, i.e., new equations for secant varieties of triple Segre products, that matrix multiplication fails to satisfy.
Secant varieties of SegreVeronese varieties P m × P n embedded by O(1,2)
, 2008
"... Let Xm,n be the SegreVeronese variety P m × P n embedded by the morphism given by O(1,2). In this paper, we provide two functions s(m, n) ≤ s(m, n) such that the s th secant variety of Xm,n has the expected dimension if s ≤ s(m,n) or s(m, n) ≤ s. We also present a conjecturally complete list of ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Let Xm,n be the SegreVeronese variety P m × P n embedded by the morphism given by O(1,2). In this paper, we provide two functions s(m, n) ≤ s(m, n) such that the s th secant variety of Xm,n has the expected dimension if s ≤ s(m,n) or s(m, n) ≤ s. We also present a conjecturally complete list of defective secant varieties of such SegreVeronese varieties.
On the hypersurface of Lüroth quartics
, 903
"... The hypersurface of Lüroth quartic curves inside the projective space of plane quartics has degree 54. We give a proof of this fact along the lines outlined in a paper by Morley, published in 1919. Another proof has been given by Le Potier and Tikhomirov in 2001, in the setting of moduli spaces of v ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The hypersurface of Lüroth quartic curves inside the projective space of plane quartics has degree 54. We give a proof of this fact along the lines outlined in a paper by Morley, published in 1919. Another proof has been given by Le Potier and Tikhomirov in 2001, in the setting of moduli spaces of vector bundles on the projective plane. Morley’s proof uses the description of plane quartics as branch curves of Geiser involutions and gives new geometrical interpretations of the 36 planes, studied by Coble, associated to the Cremona hexahedral representations of a nonsingular cubic surface. We also discuss the invarianttheoretical significance of these results and we give some new information about the locus of singular Lüroth quartics.
KOSZUL OBSTRUCTIONS FOR SMOOTHABILITY OF 0SCHEMES OF REGULARITY TWO
, 2009
"... In this paper we introduce a numerical invariant which imposes obstructions for smoothability of certain 0dimensional schemes. This allows for the construction of families of nonsmoothable 0schemes. Conversely, in low degree, the vanishing of these obstructions is sufficient for smoothability. We ..."
Abstract
 Add to MetaCart
In this paper we introduce a numerical invariant which imposes obstructions for smoothability of certain 0dimensional schemes. This allows for the construction of families of nonsmoothable 0schemes. Conversely, in low degree, the vanishing of these obstructions is sufficient for smoothability. We use the tools introduced in this paper to characterize nonsmoothable 0schemes of minimal degree in every embedding dimension d ≥ 4, and to provide other results about Hilbert schemes of points.
A CRITERION FOR A GENERIC m × n × n TO HAVE RANK n
, 2008
"... Determining the rank of a tensor has always been an interesting and important problem in algebraic complexity theory[8], algebraic statistics[3, 9], engineering[4] and algebraic geometry[6]. In this paper, I will first give a criterion for a generic m × n × n to have rank n. Right after the criterio ..."
Abstract
 Add to MetaCart
Determining the rank of a tensor has always been an interesting and important problem in algebraic complexity theory[8], algebraic statistics[3, 9], engineering[4] and algebraic geometry[6]. In this paper, I will first give a criterion for a generic m × n × n to have rank n. Right after the criterion, the first application is given. Then the symmetric version of this criterion is formulated. In Section 4, I will give a detailed discussion of the (O(1, 2) symmetric) ranks of (O(1, 2) symmetric) 3 × 2 × 2 tensors over the complex and real numbers with the aid of these criterions. This criterion also provides another way to attack the ”Salmon Problem ” over real numbers. 1. The Criterion In this section, we are working over any fixed field K. For a m×n×n tensor X, let X1, X2, · · · , Xm (which are n × n matrices) denote the slices in the first direction. Theorem. Let X be a m × n × n tensor with X1 nonsingular. Then X has rank n if the set of matrices {XjX −1 1: j = 2,...m} can be diagonalized simultaneously. Remark. The condition of the theorem can be weakened. In fact, if there exists a nonsingular linear combination of slices X1, X2, · · ·, Xm, then we can just replace X1 by that linear combination. This operation doesn’t change the rank at all. Note also that all linear combinations of Xi are singular is an algebraic condition, it amounts to say that det ( ∑ n i=1 λiXi) ≡ 0 for all λi ∈ C, i.e. all the coefficients of λi are
ON NONDEFECTIVITY OF CERTAIN SEGREVERONESE VARIETIES
"... Abstract. Let Xm,n be the SegreVeronese variety Pm×Pn embedded by the morphism given by O(1, 2) and let σs(Xm,n) denote the sth secant variety to Xm,n. In this paper, we prove that if m = n or m = n+1, then σs(Xm,n) has the expected dimension except for σ6(X4,3). As an immediate consequence, we wil ..."
Abstract
 Add to MetaCart
Abstract. Let Xm,n be the SegreVeronese variety Pm×Pn embedded by the morphism given by O(1, 2) and let σs(Xm,n) denote the sth secant variety to Xm,n. In this paper, we prove that if m = n or m = n+1, then σs(Xm,n) has the expected dimension except for σ6(X4,3). As an immediate consequence, we will give function s1(m,n) ≤ s2(m,n) such that if s ≤ s1(m,n) or if s ≥ s2(m,n), then σs(Xm,n) has the expected dimension. 1.