Abstract 1 Introduction 2 Preliminaries 3 Universal Sequences of Tensors for the Asymptotic Rank Conjecture 4 Representation Theory and Universality of Specht Tensors 5 Equations of Secant Varieties and Asymptotic Rank References

A Universal Sequence of Tensors for the Asymptotic Rank Conjecture

Petteri Kaski ORCID Department of Computer Science, Aalto University, Finland Mateusz Michałek ORCID Fachbereich Mathematik und Statistik, Universität Konstanz, Germany
Abstract

The exponent σ(T) of a tensor T𝔽d𝔽d𝔽d over a field 𝔽 captures the base of the exponential growth rate of the tensor rank of T under Kronecker powers. Tensor exponents are fundamental from the standpoint of algorithms and computational complexity theory; for example, the exponent ω of square matrix multiplication can be characterized as ω=2σ(MM2), where MM2𝔽4𝔽4𝔽4 is the tensor that represents 2×2 matrix multiplication.

Strassen [FOCS 1986] initiated a duality theory for spaces of tensors that enables one to characterize the exponent of a tensor via objects in a dual space, called the asymptotic spectrum of the primal (tensor) space. While Strassen’s theory has considerable generality beyond the setting of tensors – Wigderson and Zuiddam [Asymptotic Spectra: Theory, Applications, and Extensions, preprint, 2023] give a recent exposition – progress in characterizing the dual space in the tensor setting has been slow, with the first universal points in the dual identified by Christandl, Vrana, and Zuiddam [J. Amer. Math. Soc. 36 (2023)]. In parallel to Strassen’s theory, the algebraic geometry community has developed a geometric theory of tensors aimed at characterizing the structure of the primal space and tensor exponents therein; the latter study was motivated in particular by an observation of Strassen (implicit in [J. Reine Angew. Math. 384 (1988)]) that matrix-multiplication tensors have limited universality in the sense that σ(𝔽d𝔽d𝔽d)2ω3=43σ(MM2) holds for all d1. In particular, this limited universality of the tensor MM2 puts forth the question whether one could construct explicit universal tensors that exactly characterize the worst-case tensor exponent in the primal space. Such explicit universal objects would, among others, give means towards a proof or a disproof of Strassen’s asymptotic rank conjecture [Progr. Math. 120 (1994)]; the former would immediately imply ω=2 and, among others, refute the Set Cover Conjecture (cf. Björklund and Kaski [STOC 2024] and Pratt [STOC 2024]).

Our main result is an explicit construction of a sequence 𝒰d of zero-one-valued tensors that is universal for the worst-case tensor exponent; more precisely, we show that σ(𝒰d)=σ(d) where σ(d)=supT𝔽d𝔽d𝔽dσ(T). We also supply an explicit universal sequence 𝒰Δ localised to capture the worst-case exponent σ(Δ) of tensors with support contained in Δ[d]×[d]×[d]; by combining such sequences, we obtain a universal sequence 𝒯d such that σ(𝒯d)=1 holds if and only if Strassen’s asymptotic rank conjecture holds for d. Finally, we show that the limit limdσ(d) exists and can be captured as limdσ(Dd) for an explicit sequence (Dd)d=1 of tensors obtained by diagonalisation of the sequences 𝒰d.

As our second result we relate the absence of polynomials of fixed degree vanishing on tensors of low rank, or more generally asymptotic rank, with upper bounds on the exponent σ(d). Using this technique, one may bound asymptotic rank for all tensors of a given format, knowing enough specific tensors of low asymptotic rank.

Keywords and phrases:
asymptotic rank conjecture, secant variety, Specht module, tensor rank, tensor exponent
Funding:
Mateusz Michałek: Supported by the DFG grant 467575307.
Copyright and License:
[Uncaptioned image] © Petteri Kaski and Mateusz Michałek; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Mathematics of computing
; Theory of computation Algebraic complexity theory
Related Version:
Previous Version: https://arxiv.org/abs/2404.06427
Acknowledgements:
We would like to thank Andreas Björklund, Joseph Landsberg, and Peter Vrana for useful discussions and important comments.
Editors:
Raghu Meka

1 Introduction

1.1 Exponents of Tensors and the Quest for Universality

For an infinite field 𝔽 and a positive integer constant d, the exponent of a nonzero tensor T𝔽d𝔽d𝔽d is the least nonnegative real σ(T) such that the sequence of tensor (Kronecker) powers

T=(Tp:p=1,2,) (1)

has its sequence of tensor ranks bounded by R(Tp)dσ(T)p+o(p). Exponents of specific constant-size tensors T are of fundamental significance in the study of algorithms and algebraic complexity theory [16, 76]. For example, Strassen showed that the exponent ω of square matrix multiplication satisfies ω=2σ(MM2) [71, 67], where MM2 is the 4×4×4 tensor representing the multiplication map for two 2×2 matrices. Recently, it was shown that the Set Cover Conjecture [29, 30, 40] fails if the exponent of a specific 7×7×7 tensor Q is sufficiently close to one [7, 59].

The study of exponents of tensors – or, what is the same up to exponentiation, the study of asymptotic rank111The asymptotic rank of T𝔽d𝔽d𝔽d is R~(T)=limpR(Tp)1/p and we have R~(T)=dσ(T). [34] of tensors – is difficult. The exponent ω of square matrix multiplication is perhaps the best studied nontrivial exponent, and even in its case the best current lower bound ω2 remains the trivial one (but see [8, 43, 52, 47, 24]), and the best current upper bound ω2.371866 [31] is a result of extensive work spanning decades (e.g.  [70, 58, 6, 62, 61, 25, 71, 26, 65, 75, 53, 2]) and relying on increasingly sophisticated techniques. In parallel to the study of exponents of individual tensors, research effort has been invested into developing a structural theory for spaces of tensors and their exponents, a theory to which the present paper also contributes. Two rough lines of research most relevant to our present work are as follows.

Strassen’s duality theory – the asymptotic spectrum of tensors.

The first line of research, announced by Strassen [71] in his 1986 FOCS paper and developed in a sequence of papers [66, 67, 68] and PhD theses [15, 74, 54] (cf. [72]), builds a duality theory for asymptotic rank of tensors based on the theory of preordered commutative semirings, with the direct sum and tensor (Kronecker) product of tensors as the pertinent semiring operations, and the preorder defined by a rank-capturing tensor restriction relation. Wigderson and Zuiddam [76] give a recent comprehensive exposition of Strassen’s theory and the preorder-theoretic topological dual spaces – the asymptotic spectrum of a space of tensors – which enable a tight characterization of the asymptotic rank of a tensor via the preorder-monotone homomorphisms in the dual. Yet, progress in terms of understanding the structure and identifying explicit points in the asymptotic spectrum of tensors has been slow. Beyond Strassen’s original construction of support functionals, which are restricted to the subspace of oblique tensors, only recently Christandl, Vrana, and Zuiddam [18] constructed a family of explicit universal spectral points – called quantum functionals – using theory of quantum entropy and covariants; however, also this dual family is far from yielding broadly tight lower bounds on asymptotic rank.

Viewed from the standpoint of Strassen’s duality theory, rather than working in a dual space, in this paper we seek and obtain as our main result an explicit and universal primal characterization of tensor exponents and thus asymptotic rank in 𝔽d𝔽d𝔽d – before proceeding to our results, let us review a second pertinent line of prior research and motivation.

Geometry of tensors and the asymptotic rank conjecture.

The second line of research seeks to study spaces of tensors to identify the worst-case behaviour in the space using tools from algebraic geometry, in particular building on the seminal concept of border rank of a tensor due to Bini, Capovani, Romani, and Lotti [6] (see also Schönhage [62]) and its geometric characterization via secant varieties of Segre and Veronese varieties (e.g. [13, 14, 50, 42, 45, 78]). For a space of tensors, let σ()=supTσ(T); as a special case, for d=1,2, let σ(d)=σ(𝔽d𝔽d𝔽d). It is immediate that 1σ(d)2 and that σ(1)=1. Over the complex numbers, it is a nontrivial consequence of the geometry of tensors that σ(2)=1. Already the value σ(3) is open and would be of substantial interest to determine. For example, it is known that σ(3)=1 implies ω=2 by the application of the Coppersmith–Winograd method [26] to a specific 3×3×3 tensor. It appears very difficult to prove lower bounds on σ(d) apart from the trivial σ(d)1. Indeed, any tensor T(𝔽d)3 with σ(T)>1 would yield an explicit sequence of tensors, namely its Kronecker powers, such that for any constant C>0 for k0 we have rank and border rank of Tk greater than Cdk. Currently, we do not know explicit examples of such sequences for C=3 with the current world record lower bound on rank in [1]. One of the main obstacles is lack of methods to prove that a given tensor has high rank or border rank. In case of rank, the state of the art is the substitution method, based on linear algebra. In case of border rank, one looks for polynomial witnesses that vanish on tensors of given bounded border rank. However in this case, most known equations, not found via explicit computations, also vanish on so-called cactus varieties, which fill the ambient space quickly and thus known methods cannot provide super-linear lower bounds on tensor rank [4, 5, 12, 32, 38]. The state of the art for border rank is based on mixture of different methods, barely breaking the bound for C=2 [48]. As the rank of the generic tensor grows quadratically with d the problem is often referred to as an instance of the hay in a haystack problem (phrase due to H. Karloff): find an explicit object that behaves generically. There is hope in the new introduced method of border apolarity [13], still there is currently no clear path of getting past C=3.

The difficulty of lower bounds and progressively improving upper bounds for specific exponents, the exponent ω in particular, has prompted bold conjectures on worst-case exponents for broad families of tensors. Most notably, writing 𝒯d for the space of all tight tensors in 𝔽d𝔽d𝔽d, Strassen’s asymptotic rank conjecture (cf. [69, Conjecture 5.3]) states that the worst-case exponent for this space is the least possible:

Conjecture 1 (Strassen’s asymptotic rank conjecture).

For all d1 it holds that σ(𝒯d)=1.

Strassen’s asymptotic rank conjecture, if true, immediately implies the algorithmically serendipitous corollary ω=2 in particular; cf. also [7, 59] for further consequences to algorithms. A yet stronger conjecture (cf. Bürgisser, Clausen, and Shokrollahi [16, Problem 15.5]; also e.g. Conner, Gesmundo, Landsberg, Ventura, and Wang [23, Conjecture 1.4] as well as Wigderson and Zuiddam [76, Section 13, p. 122]) states that the least possible exponent is shared by all concise tensors in 𝔽d𝔽d𝔽d:

Conjecture 2 (Extended asymptotic rank conjecture).

For all d1 it holds that σ(d)=1.

A key result supporting Conjecture 1 and Conjecture 2, implicit in Strassen [67, Proposition 3.6] and highlighted by Christandl, Vrana, and Zuiddam [17, Proposition 2.12] as well as Conner, Gesmundo, Landsberg, and Ventura [22, Remark 2.1], is that tensor rank is known to be nontrivially submultiplicative under Kronecker products; stated in terms of worst-case tensor exponents, Strassen proved that for all d1 it holds that σ(d)2ω3.

Viewed in terms of exponents of tensors and universality, we can rephrase Strassen’s result as stating that the exponent of the matrix multiplication tensor MM2 controls from above the exponent of all other tensors, namely we have σ(d)43σ(MM2)=2ω3. This rephrasing suggests that one should seek explicit constructions of tensors U𝔽d𝔽d𝔽d that are worst-case universal for the class with σ(d)=σ(U). In rough analogy with computational complexity theory, such explicit tensors capture the “hardest” tensors in a class of tensors and, for example, would provide an explicit object of study towards resolving Conjectures 1 and 2.

1.2 Our Results – Explicit Universal Sequences of Zero-One-Valued Tensors

While we do not present explicit individual tensors U that are universal, as our main result we present an explicit sequence 𝒰 of tensors that is universal and consists of zero-one-valued tensors in coordinates. Towards this end, let us extend the definition of the exponent of a tensor T to a sequence

𝒯=(Tj𝔽sj𝔽sj𝔽sj:j=1,2,) (2)

of nonzero tensors. The exponent of the sequence 𝒯 is the least nonnegative real σ(𝒯) such that R(Tj)sjσ(𝒯)+oj(1). From (1) and (2) we immediately have σ(T)=σ(T) for all tensors T𝔽d𝔽d𝔽d. Our main result is that there is an explicit sequence of tensors that characterizes the exponent of 𝔽d𝔽d𝔽d and thus enables an approach towards resolving Strassen’s conjecture.

Theorem 3 (Main; A universal sequence of tensors for d fixed).

For all d1 there is an explicit sequence 𝒰d of zero-one-valued tensors with σ(𝒰d)=σ(d).

In coordinates, the qth tensor in the sequence 𝒰d admits explicit combinatorial expression as a union of orbit-indicator tensors under a particular action of the symmetric group SSq. This combinatorial structure enables us to study the exponent σ(Δ) of the space of tensors spanned by {eiejek:(i,j,k)Δ}𝔽d𝔽d𝔽d for a nonempty Δ[d]×[d]×[d]; when equality holds, we have σ(Δ)=σ(d).

Theorem 4 (Support-localized universal sequences of tensors).

For all nonempty Δ[d]×[d]×[d] there is an explicit sequence 𝒰Δ of zero-one-valued tensors with σ(𝒰Δ)=σ(Δ).

From Theorem 4 we obtain the following corollary for tight tensors and Strassen’s conjecture (Conjecture 1). We need short preliminaries. We say that the set Δ is tight if there exist injective functions α,β,γ:[d] such that α(i)+β(j)+γ(k)=0 for all (i,j,k)Δ. A tensor T𝔽d𝔽d𝔽d is tight if it admits a coordinate-representation whose support is contained in a tight set.

Theorem 5 (A universal sequence of tensors for Strassen’s conjecture).

For all d1 there is an explicit sequence 𝒯d of tight zero-one-valued tensors with σ(𝒯d)=σ(𝒯d).

Further, by diagonalising the sequences 𝒰d for increasing d we obtain a universal sequence providing worst possible exponent irrespective of d; that is, a universal sequence for the extended asymptotic rank conjecture (Conjecture 2):

Theorem 6 (A universal sequence of tensors for the extended asymptotic rank conjecture).

There is an explicit sequence 𝒟=(Dd:d=1,2,) of zero-one-valued tensors with limdσ(Dd)=limdσ(d).

We note that the limit in the theorem above exists and is the supremum of all σ(d); cf. Lemma 19. The above theorem may be regarded as a solution to the aforementioned hay in the haystack problem for the exponent of tensors.

1.3 Overview of Techniques

Before proceeding to review our further results, it will be convenient to give an overview of our main techniques and concepts underlying Theorem 3. In particular, a basis induced from integer compositions for the linear span of the image of the Kronecker power map SSq will be our key tool.

The Kronecker power map 𝐊𝒅,𝒒 in coordinates.

For a field 𝔽 and positive integers d and q, our key object of study is the Kronecker power map

Kd,q:𝔽d𝔽d𝔽d𝔽dq𝔽dq𝔽dq

that takes a tensor S𝔽d𝔽d𝔽d to its qth tensor (Kronecker) power Kd,q(S)=Sq.

It will be convenient to study the Kronecker power map Kd,q by working with tensors in coordinates, so let us set up conventions accordingly. Let us write [d]={1,2,,d} and identify the spaces 𝔽d×d×d=𝔽d𝔽d𝔽d. For a tensor S𝔽d×d×d in the domain of Kd,q, we write Si,j,k𝔽 for the entry of S at position i,j,k[d]. For a tensor T𝔽dq×dq×dq in the codomain of Kd,q, it is convenient to index the entries TI,J,K𝔽 of T with q-tuples I=(i1,i2,,iq)[d]q, J=(j1,j2,,jq)[d]q, K=(k1,k2,,kq)[d]q. Indeed, with this convention, the image Kd,q(S)=Sq of a tensor S𝔽d×d×d can be defined entrywise for all I,J,K[d]q by

SI,J,Kq=Si1,j1,k1Si2,j2,k2Siq,jq,kq. (3)

An explicit basis for the linear span of the image of 𝐊𝒅,𝒒.

Next we embed the image Kd,q(𝔽d×d×d) in the least-dimensional subspace of 𝔽dq×dq×dq possible, so-called linear span, and provide an explicit basis for this subspace in the assumed coordinates. Towards this end, working with integer compositions that capture the distinct right-hand sides of (3) for a generic S with support in a nonempty set Δ[d]×[d]×[d] will be convenient. In precise terms, a function g:Δ0 with δΔg(δ)=q is a composition of the positive integer q with domain Δ. Let us write 𝒞qΔ for the set of all compositions of q with domain Δ. The distinct right-hand sides of (3) for a generic S are now enumerated by the compositions g𝒞qΔ; explicitly, associate with g the product

Sg=i,j,k[d]Si,j,kg(i,j,k)𝔽. (4)

Writing 𝔽Δ for the subspace of all tensors in 𝔽d×d×d with support in Δ, we next provide a basis (T(g)𝔽dq×dq×dq:g𝒞qΔ) that enables us to express the Kronecker power Sq of an arbitrary tensor S𝔽Δ as the linear combination

Sq=g𝒞qΔSgT(g). (5)

We need short preliminaries to define the tensors T(g) in the assumed coordinates. For I,J,K[d]q, define the triple-counting composition ΦI,J,K𝒞q[d]×[d]×[d] for all u,v,w[d] by

ΦI,J,K(u,v,w)=|{[q]:i=u,j=v,k=w}|. (6)

We use Iverson’s bracket notation; for a logical proposition P, we write [[P]] to indicate a 0 if P is false and a 1 if P is true.

Definition 7 (Composition basis for the linear span of the image Kd,q(𝔽Δ)).

For g𝒞qΔ, define the tensor T(g)𝔽dq×dq×dq in coordinates for all I,J,K[d]q by

(T(g))I,J,K=[[ΦI,J,K=g]]. (7)

The tensors (T(g):g𝒞qΔ) are the composition basis for the linear span of Kd,q(𝔽Δ).

We provide various equivalent characterisations of these tensors T(g) in Lemma 9 (on page 9). The characterisation via integer compositions in Definition 7 in particular enables an immediate verification via (7), (4), and (3) that (5) holds. In particular, the linear span of the image Kd,q(𝔽Δ) is contained in the linear span of the composition basis. What is less immediate is that the reverse containment holds under mild assumptions on the field 𝔽 by identifying the Kronecker power map with the Veronese map on homogeneous Δ-variate polynomials of degree q. In coordinates, by relying on homogeneous polynomial interpolation we show in Corollary 13 and Proposition 15 that for every g𝒞qΔ there exist tensors Sf𝔽Δ and scalars λf,g𝔽 indexed by f𝒞qΔ such that

T(g)=f𝒞qΔλf,gSfq. (8)

Now (5) and (8) imply the composition basis spans exactly the linear span of Kd,q(𝔽Δ).

Sublinearity and serendipity of polynomial dimensionality of the span.

By subadditivity of tensor rank, from the linear combination (5) we have immediately for an arbitrary tensor S𝔽Δ that

R(Sq)g𝒞qΔR(T(g)).

Conversely, for an arbitrary g𝒞qΔ, we have from (8) that

R(T(g))f𝒞qΔR(Sfq).

Recalling from combinatorics of integer compositions that |𝒞qΔ|=(|Δ|1+q|Δ|1)(|Δ|1+q)|Δ|1, we observe that dimension of the linear span of Kd,q(𝔽Δ) grows only polynomially in q when Δ is fixed. Theorem 3 and Theorem 4 follow essentially immediately by taking 𝒰Δ=(UΔ,q:q=1,2,) with UΔ,q=g𝒞qΔT(g) as the universal sequence.

Structure and description of the tensors 𝑻(𝒈).

The tensors T(g) admit several descriptions, e.g. a group-theoretic description can be given using orbit-indicators of the group SSq, see Lemma 9, and an alternative description can be given via type decompositions [76, Section 9.3] (see also [28]). There are several important applications of group theory in the study or tensor rank and asymptotic rank. We note that when G is an Abelian group then the structure tensor SG of the group algebra is an orbit-indicator of the group G2 identified with {(g1,g2,g3)G3:g1+g2=g3}; in this case, the tensor SG has also minimal rank, equal to |G|, via the Discrete Fourier Transform. When G is not Abelian, the representation theory of G allows for nontrivial bounds on the rank of SG; similar observations have been leveraged in the study of fast matrix multiplication; e.g. Cohn and Umans [20], Cohn, Kleinberg, Szegedy, and Umans [19], Cohn and Umans [21], Blasiak, Cohn, Grochow, Pratt, and Umans [10]. We expect this structure to enable further work towards an eventual proof or disproof of the (extended) asymptotic rank conjecture.

A win-win dichotomy.

In addition to enabling worst-case characterisation of tensor exponents for families of tensors, the tensors T(g) enable the following “win-win” dichotomy (cf. Corollary 21 for a precise statement) that motivates their further study:
   Either the extended asymptotic rank conjecture (Conjecture 2) holds, implying ω=2 and a disproof of the Set Cover Conjecture; or the tensors T(g) form an explicit sequence of tensors with superlinear border rank growth, providing substantial progress for the “hay in the haystack” problem for rank and border rank.

A remark on explicitness.

We stress that we here view explicitness as the property of not only a single tensor but rather a sequence of tensors; cf. e.g. [48, Section 3]. Both the tensors T(g) and the tensors in our universal sequences have zero-one entries in coordinates, and these entries may be computed fast. Indeed, from (7) it is immediate that we have linear-time algorithms that output TI,J,K(g) given I,J,K,g as input. Similarly, listing (or ranking/unranking) integer compositions g𝒞qΔ for given Δ,q admit fast algorithms.

Invariant Specht tensors.

Our techniques reduce the question about asymptotic ranks to questions about ranks of specific tensors, where T(g) is only one possible choice. Another one is to apply representation theory of the symmetric group SSp. It turns out that ranks of very special tensors, precisely invariants in the tensor product of three Specht modules (SαSβSγ)SSp, where α,β,γ are partitions of p with at most d parts, govern the exponent σ(d). Precise results are given in Section 4.

1.4 Further Results

Our second result relates extended Strassen’s conjecture to equations of varieties, in particular secant varieties. We tacitly assume sufficient background in algebraic geometry and geometry of tensors (e.g. [27, 42, 55]). Also, unless otherwise mentioned, we assume that the field 𝔽 is the field of complex numbers.

To set the context, it is a well-established method to prove that tensors have high border rank by exhibiting polynomials vanishing on the kth secant variety of the Segre variety X=(d1)×3 and evaluating it on a given tensor T. Among the state of the art theoretical equations in this context are the Koszul flattenings and the Young flattenings, which can provide border rank bounds up (2ϵ)d for any ϵ>0 for d0. The degree of those equations grows as a polynomial in d for fixed ϵ, however the degree of this polynomial also grows as ϵ0. The second method to obtain equations of secant varieties is computational, based on representation theory and linear algebra. This is an exhaustive method, finding all equations in the given degree and partitioning them into so-called isotypic components [11, 36]. Still of course its scope is limited due to computational obstacles. For border rank k<d, the smallest degree of a polynomial vanishing on the kth secant variety is exactly k+1 [46]. However, for border rank above d, one observes fast grow of the minimal degree in which equations exist; for example, the smallest degree of an equation vanishing on the 6th secant variety of (3)×3 is 19 and on the 18th secant variety of (6)×3 is at least 187000 [36]. The lack of low-degree (or otherwise easy) equations has been perceived so far as an obstacle in proving that tensors have high border rank, in particular in disproving Strassen’s conjecture or its extensions. In this paper, we proceed in the opposite direction, namely that absence of low-degree equations of secant varieties implies upper bound on σ(d).

Theorem 8 (Absence of low-degree equations implies low asymptotic rank).

Let X((𝔽d)3) be a variety contained in the locus of tensors of asymptotic rank at most r. Suppose that no polynomial of degree p vanishes on X. Then every tensor in (𝔽d)3 has asymptotic rank at most

r(d31+pd31)1p.

We note that the theorem above implies that bounds on asymptotic rank of special tensors may imply bounds for all tensors. As the variety X may be always assumed to be GL(d)×3 invariant one may combine the computational method of finding isotypic decomposition of homogeneous polynomials with obtaining good bounds on p, in order to obtain new bounds on σ(d). We leave this line of research for the future.

1.5 Related Work

It is known that computing the tensor rank of a given tensor is NP-hard [35]; see also [37, 60, 63] for pertinent hardness results. It is also difficult in practice to determine the rank and border rank of small tensors; for example, the rank, border rank and border support rank of MM2 are known to be seven [9, 36, 41, 70].

There has been extensive interest in constructing explicit tensors of high rank or border rank [1, 44, 48, 51]. This study is motivated by the need for new methods to provide lower complexity bounds. Currently, we do not know how to construct sequences of explicit tensors T𝔽d𝔽d𝔽d of rank or border rank above 3d. In fact, there are no known examples of tensors with entries 0 or 1 and rank or border rank greater than 3d. The only method to construct such tensors, is by making the entries incomparable in size, i.e. each entry is of different order of magnitude then other entries, or making them algebraically independent, which makes the tensors very far from explicit. However, it is easy to prove that tensors of super-linear border rank, with respect to their size exist. Precisely, for any constant C>0 and d sufficiently large there exists a tensor T(𝔽d)3 of border rank greater than Cd. Even more: general tensors will have greater border rank than Cd for d sufficiently large and the growth of maximal border rank is quadratic in d. We simply do not know how to provide explicit examples of such tensors, as the methods we have do not allow to prove that particular tensors have large rank. These obstructions are related to the fact that the cactus variety, that contains the secant variety, fills the whole ambient space, while most of the equations we know for secant varieties, also vanish on cactus varieties [12, 33, 32, 38, 49, 73]. We even do not know how to provide a sequence of explicit tensors so that infinitely many elements of the sequence would have high rank, say above 3d.

The families of tensors with fixed support are also studied. An important concept is that of support rank [21], which has given rise to other support-based algorithm-design techniques (e.g. [3, 39]). Further, bounding asymptotic rank of special tensors was recently tied to NP-hard problems; in particular, Strassen’s conjecture (Conjecture 1) would imply unexpected (but not polynomial) upper bounds on complexity of (randomized) algorithms for NP-hard problems [7, 59].

Beyond the present invariant Specht tensors, representation theory of the symmetric and general linear groups has extensive connections to algebraic complexity theory via Strassen’s theory of asymptotic spectra (e.g. [18]) as well as the geometric complexity theory program (e.g. [56, 57]).

1.6 Organization of This Paper

Section 2 reviews notational preliminaries and definitions. Section 3 studies the composition basis and proves our main theorems on explicit universal sequences of tensors (Theorems 3 to 6). Section 4 introduces invariant Specht tensors and shows their universality for the exponent σ(d) (Corollary 38). Section 5 relates the equations of varieties to bounds on asymptotic rank and proves Theorem 8.

2 Preliminaries

Recall that we write [d]={1,2,,d}. The set [d]q consists of sequences of length q of integers in [d]. We fix the canonical basis e1,e2,,em𝔽m.

In this article, we exclusively work with tensors of format a×b×c, where in most cases a=b=c. These are elements of the vector space 𝔽a𝔽b𝔽c𝔽a×b×c. In analogy to the case of matrices, the reader may freely think about tensors as three dimensional arrays filled with elements of 𝔽. For a vector v𝔽a we write vi:=ei(v)𝔽 for 1ia. We write Si,j,k𝔽 for the entry of S𝔽a𝔽b𝔽c at position (i,j,k)[a]×[b]×[c].

For three vectors v1𝔽a,v2𝔽b and v3𝔽c we define the tensor v1v2v3𝔽a𝔽b𝔽c where the (i,j,k) coordinate equals (v1)i(v2)j(v3)k. Tensors of this form are called rank one tensors. The rank of a tensor T is the smallest r such that T is sum of r rank one tensors.

In case 𝔽= or 𝔽= we define the border rank of a tensor T as the smallest r such that in any neighbourhood of T there exists a tensor of rank r. For more details about rank and border rank we refer to [16, 42, 55]. The Kronecker power of a tensor is defined as in formula (3). Asymptotic rank [34] of a tensor T is defined as limnR(Tn)1n. We write s to be the unit tensor s=i=1seieiei.

3 Universal Sequences of Tensors for the Asymptotic Rank Conjecture

In this section we prove that the tensors T(g) in the composition basis (Definition 7) form a universal family for the asymptotic rank conjecture. We start with a more detailed analysis of the structure of the composition basis for fixed d (Section 3.1), and follow with an analysis for increasing d (Section 3.2); in particular, we establish the existence of the limit exponent limdσ(d). Theorem 3 and Theorem 6 are restated and proved next (Section 3.3). Using techniques of Strassen, we then show that the universal sequences have nontrivially low tensor rank (Section 3.4). We end this section by setting up our techniques for support-localization (Section 3.5) as well as restate and prove Theorem 5, our main result for tight tensors (Section 3.6).

3.1 Properties of the Composition Basis

We start with the following easy lemma that provides various alternative characterisations of tensors T(g) in Definition 7.

We note that the symmetric group SSq acts by permutations on 𝔽[d]q and diagonally on (𝔽[d]q)3.

Lemma 9 (Equivalent definitions of the composition basis).

We have the following equivalent definitions of tensors T(g) for any g𝒞q[d]3.

  1. 1.

    The tensors T(g) are precisely sums of SSq orbits of canonical basis tensors in (𝔽[d]q)3.

  2. 2.

    The tensors T(g) are coefficients of monomials for the Kronecker map Kd,q, explicitly:

    Kd,q(S)=g𝒞q[d]3SgT(g).

    In particular, the linear span of the image is contained in the linear span of tensors T(g).

  3. 3.

    If |𝔽|>q, then the tensors T(g), up to scaling by a constant, are precisely tensors with inclusion minimal supports in the linear span of the image of Kd,q.

Proof.

We note that the condition ΦI,J,K=g from Definition 7 determines the triple (I,J,K) up to simultaneous action by an element of SSq. This proves equivalence of point (1) with the original definition.

The coordinates of Kd,p(S) in the canonical basis are monomials of degree q in the coordinates of S. A monomial Sg appears exactly on the entries indexed by such (I,J,K)’s that ΦI,J,K=g. This proves equivalence of point (2) with Definition 7.

In Proposition 15, we show that the linear span of the image of Kd,q coincides with the linear span of T(g)’s for g𝒞q[d]3 and |𝔽|>q. As T(g)’s have disjoint supports, we obtain point (3).

 Remark 10 (Invariant subspaces defined by marginals of g).

It is immediate that T(g)(𝔽[d]q)3, however the tensor T(g) also belongs to smaller invariant subspace defined by g. Namely, for g𝒞q[d]3 let g1:[d] be the first marginal of g; that is, let g1(j)=a,b[d]g(j,a,b) for all j[d]. In the same way, define the second marginal g2 and third marginal g3. For i=1,2,3, let Ui[d]q be the set of all q-tuples I[d]q such that the value j appears in I exactly gi(j) times for all j[d]. We have |Ui|=(qgi(1),gi(2),,gi(d)) as well as T(g)𝔽U1𝔽U2𝔽U3. Clearly, the ambient space is SSq invariant.

Example 11 (The small Coppersmith–Winograd tensor).

Let d=2, q=3 and g assign value 1 on (0,0,1), (0,1,0) and (1,0,0). The tensor T(g) is the small Coppersmith–Winograd tensor in (𝔽3)3, that is:

e0e1e2+e0e2e1+e1e0e2+e1e2e0+e2e0e1+e2e1e0.
Definition 12 (Linear span of the composition basis).

Let Ld,q be the linear span of the tensors T(g) for g𝒞q[d]3. As the tensors T(g) have disjoint supports they are linearly independent and hence form a basis of Ld,q. We note that dimLd,q=(d3+q1q) which is the cardinality of 𝒞q[d]3.

Corollary 13 (Span coincides with the space of invariants).

The tensors T(g) for g𝒞q[d]3 form a basis of the invariants space ((𝔽[d]q)3)SSq, which coincides with Ld,q. Up to rescaling, it is the unique basis of that space made of tensors with disjoint supports.

From now on we will assume that the cardinality of the field is greater than q.

Lemma 14 (Dual space of homogeneous polynomials).

There is an isomorphism of vector spaces: Ld,q of linear forms and functions on (𝔽d)3 given by homogeneous polynomials of degree q. The isomorphism sends a linear form l to the polynomial function lKd,q.

Proof.

Let T(g) be the basis of Ld,q dual to T(g). The image of the linear function λgT(g) is λgSg. Surjectivity is obvious.

By induction on the number n of variables, one proves that no polynomial of degree q may vanish identically on 𝔽n, when |𝔽|>q. Hence, no linear form l is mapped to the zero function and the linear map llKd,p is injective. This finishes the proof.

Proposition 15 (Span of the image of the Kronecker power map).

The space Ld,q is the linear span of the image of Kd,q.

Proof.

Clearly Ld,q contains the image of Kd,q. If the containment was strict, there would exist a nonzero linear function lLd,q vanishing on the image. Then lKd,q=0. This is not possible by Lemma 14.

 Remark 16 (The Veronese map of degree q).

Up to isomorphism, Kd,q may be identified with the qth Veronese map, that is a map defined by all degree q monomials. However, in coordinates each monomial may appear more than once, as each monomial represented by g𝒞q[d]3 appears on the support of T(g).

Lemma 17 (Maximum rank in the composition basis controls rank in Ld,q).

Let r be the maximum rank (respectively, asymptotic rank) of T(g) over g𝒞q[d]3. Every tensor in Ld,q has rank (respectively, asymptotic rank) at most

r|𝒞q[d]3|=r(d31+qd31).

In particular, every tensor in (𝔽d)3 has asymptotic rank at most

(r(d31+qd31))1q.

Proof.

Fix T(𝔽d)3. By Lemma 9 the tensor Kd,q(T) is a linear combination of T(g)’s for g𝒞q[d]3. As |𝒞q[d]3|=(d31+qd31) we obtain:

R(Kd,q(T))r(d31+qd31).

The statement under the assumption of asymptotic rank r for T(g)’s is proved in the same way, noting that asymptotic rank is subadditive and submultiplicative (e.g. [76]).

3.2 The Extended Asymptotic Rank Conjecture and the Limit Exponent

We are now ready to connect the composition-basis tensors T(g) to the extended asymptotic rank conjecture (Conjecture 2).

Corollary 18 (The composition basis suffices for the extended asymptotic rank conjecture).

If there exists an infinite set S={d1,d2,}1 such that for any di there exist infinitely many qi,j1 such that Conjecture 2 holds for the tensor T(g) for all g𝒞qi,j[di]3, then Conjecture 2 holds for all tensors.

Proof.

First fix di. By Lemma 17 we see that any T((𝔽di)3) has asymptotic rank at most:

(diq)1q(di31+qdi31)1q.

Note that for fixed di we have

limq(di31+qdi31)1q=1.

This confirms Conjecture 2 for any T(𝔽di)3. We conclude that it must hold for each d from the next Lemma 19.

Lemma 19 (Existence of the limit exponent).

The limit limdσ(d) exists and equals the supremum of the set {σ(d):d1}.

Proof.

As the sequence σ(d) is bounded it is enough to prove:

d01ϵ>0D1d>Dσ(d)>σ(d0)ϵ.

Fix ϵ>0 and d01. For contradiction assume there are infinitely many di such that σ(di)σ(d0)ϵ. Hence, we also obtain infinitely many ki such that d0kidi<d0ki+1.

We note that we have σ(d0ki)σ(d0) as taking Kronecker power of a tensor does not change the exponent. Hence, for any δ>0 there exists Tδ(𝔽d0ki)3 of asymptotic rank at least d0ki(σ(d0)δ). As we may embed Tδ in larger space, we see that its asymptotic rank is at most diσ(di)d0(ki+1)(σ(d0)ϵ). We obtain:

ki(σ(d0)δ)(ki+1)(σ(d0)ϵ).

As this holds for any δ>0 we obtain:

kiσ(d0)(ki+1)(σ(d0)ϵ),

which is a contradiction for ki sufficiently large. The following more precise result shows that the exponent governing the asymptotic rank is completely determined via asymptotic ranks of the tensors T(g).

Corollary 20 (The composition bases govern tensor exponents).

For all τ0 it holds that each tensor T(g)(𝔽m)3 (where m is uniquely determined by g) has asymptotic rank at most mτ if and only if any tensor T(𝔽d)3 (where d is arbitrary) has asymptotic rank at most dτ. In particular, for any tensor T we have σ(T)supgσ(T(g)).

Proof.

The implication “” is immediate. For the implication “”, assume that a tensor T has asymptotic rank greater than dτ+ϵ for fixed ϵ>0. By applying Lemma 17 for q0 such that (d31+qd31)1q<dϵ we obtain a contradiction.

We note that there are countably many tensors T(g) and they form a sequence of explicit tensors. This sequence gives rise to the following dichotomy.

Corollary 21 (A dichotomy on improved algorithms or explicit rank lower bounds).

We have the following dichotomy. Either

  1. (i)

    the extended asymptotic rank conjecture (Conjecture 2) holds; that is, for all tensors T we have σ(T)1, which implies ω=2 and disproves the Set Cover Conjecture; or

  2. (ii)

    the tensors T(g) form a sequence of explicit tensors such that for any constant C1 there exist infinitely many T(g)(𝔽m)3, such that rank, border rank, and asymptotic rank is greater than Cm.

It is clear that for special g the rank of T(g) can be small. For example if g is supported at one element, then T(g) has support of cardinality one and thus is of rank one.

3.3 Explicit Universal Sequences and Main Results

We first prove our main theorem for fixed d, and define the universal sequence accordingly.

Definition 22 (Universal sequence for a fixed d).

For a fixed positive integer d, we define the sequence 𝒰d=(Ud,q:q=1,2,) of tensors, where we set

Ud,q=g𝒞q[d]3T(g).

We are now ready to prove our main theorem; Theorem 3 is restated below for convenience.

Theorem 23 (Main; Explicit universal sequences of tensors).

For all d1 we have σ(𝒰d)=σ(d).

Proof.

We prove the equality by proving both inequalities.

First, suppose that σ(𝒰d)<σ for some constant σ. Fix an ϵ>0 so that for q sufficiently large R(Ud,q)<(|𝒞q[d]3|dq)σϵ. Then, for q sufficiently large and all g𝒞q[d]3 we have R(T(g))R(Ud,q)<(|𝒞q[d]3|dq)σϵ. As limq|𝒞q[d]3|1/q=1 we see that for q sufficiently large and all g𝒞q[d]3 we have σ(T(g))σ. Applying Lemma 17 and taking limit, as q we see that σ(T)σ for all T(𝔽d)3.

Suppose now that for all T(𝔽d)3 we have σ(T)<σ. Fix ϵ>0, such that σ(T)<σϵ for all T(𝔽d)3. By Proposition 15 for any g𝒞q[d]3 the tensor T(g) is a sum of at most |𝒞q[d]3|-many tensors of type Kd,q(T). Hence, for q sufficiently large we have:

R(T(g))|𝒞q[d]3|dq(σϵ).

It follows that:

R(Ud,q)|𝒞q[d]3|2dq(σϵ).

As limq|𝒞q[d]3|/dϵq=0 we see that R(Ud,q)(|𝒞q[d]3|dq)σ for q0. Thus σ(𝒰d)σ, which finishes the proof.

Next, we construct one universal sequence realizing the worst possible exponent, irrespective of d via a diagonal argument on the sequences 𝒰d. Accordingly, recalling Definition 22, define the diagonal sequence 𝒟=(Dd:d=1,2,) of tensors for all positive integers d by setting Dd=Ud,d4. It is immediate that the sequence is explicit. Theorem 6 is restated below for convenience.

Theorem 24 (An explicit universal sequence for the extended asymptotic rank conjecture).

The sequence 𝒟 satisfies limdσ(Dd)=limdσ(d).

Proof.

By Lemma 19 it is enough to prove that for every ϵ>0, for all d sufficiently large we have σ(Ud,d4)>σ(d)ϵ. For any (concise) T(𝔽d)3 we have:

dd4σ(T)=R~(T)d4g𝒞d4[d]3R~(T(g))|𝒞d4[d]3|R~(Ud,d4)|𝒞d4[d]3|(|𝒞d4[d]3|dd4)σ(Ud,d4).

After taking root of order d4 we only need to prove that limd|𝒞d4[d]3|1/d4=1. We have:

limd|𝒞d4[d]3|1/d4=limd(d4+d31d31)1/d4limd(2d4)d3/d4=1,

which finishes the proof.

3.4 Upper Bounds on Tensor Rank in the Universal Sequences

A natural question arises: what are ranks of the tensors T(g). In order to provide upper bounds, we recall the following lemma due to Strassen (implicit in [67, Proposition 3.6]).

Lemma 25 (Limited universality of matrix multiplication tensors).

The matrix multiplication tensor MMd2 degenerates to T3 for any tensor T(𝔽d)3. In particular, σ(T)2ω/3.

Proof.

Let us write in coordinates T=(λp,q,r) and

MMd2=i1,i2,j1,j2,k1,k2[d]ej1,j2i1,i2ek1,k2j1,j2ei1,i2k1,k2.

For i=1,2,3, define li:𝔽d4𝔽d3 as follows:

l1(ej1,j2i1,i2) =a[d]λa,j1,i1ea,j2,i2,
l2(ek1,k2j1,j2) =b[d]λj2,b,k1ej1,b,k2,
l3(ei1,i2k1,k2) =c[d]λi2,k2,cei1,k1,c.

We have l1l2l3(MMd2)=T3. In a similar way we obtain:

Lemma 26 (Limited universality of matrix multiplication under powers).

The matrix multiplication tensor MMd2k degenerates to T3k for any tensor T(𝔽d)3.

We obtain the following corollary, which currently is asymptotically in k0 the best one we know, that works for arbitrary g𝒞3k[d]3.

Corollary 27 (Upper bound on rank via matrix multiplication).

For any g𝒞3k[d]3 the tensor T(g) has rank at most R(MMd2k)(d31+3kd31).

 Remark 28 (Note on special g).

We note that Corollary 27 may be improved for many special g. For any g𝒞3k[d]3 we have three marginal distributions on [d]. If such a distribution is close to uniform, then we obtain about dk compatible sequences of length k; that is, asymptotically every sequence is compatible. However, if the distribution is far from uniform, we obtain less sequences, say dck for some c<1. In such a case MMd2k in Lemma 26 may be changed into smaller matrix multiplication.

3.5 Support-Localized Universality

Many of our results remain true if we consider tensors T(𝔽d)3 with support contained in a nonempty Δ[d]3. Let us write 𝔽Δ be the linear space of tensors with such a support. As before Kd,q restricted to 𝔽Δ is still a Veronese map, simply in variables corresponding to elements from Δ. The image of Kd,q|𝔽Δ has a basis made of tensors T(g) for g𝒞qΔ. Below we present a variant of Lemma 17, which proof is analogous.

Lemma 29 (Maximum rank in the support-localized composition basis controls rank in 𝔽Δ).

Let r be the maximum rank (respectively, asymptotic rank) of T(g) over g𝒞qΔ. The qth Kronecker power of every tensor in 𝔽Δ has rank (respectively, asymptotic rank) at most

r|𝒞qΔ|=r(|Δ|1+q|Δ|1).

In particular, every tensor in (𝔽d)3 with support contained in Δ has asymptotic rank at most

(r(|Δ|1+q|Δ|1))1q.

Next, we present a variant of Strassen’s result for tensors with fixed support. For Δ[d]3, we will use the following notation: Δ1,2={(i,j):k(i,j,k)Δ}, Δ1,3={(i,k):j(i,j,k)Δ}, and Δ2,3={(j,k):i(i,j,k)Δ}.

Consider the following support-localized restriction of the matrix multiplication tensor MMd2:

MMΔ:=(j1,i1)Δ2,3(j2,k1)Δ1,3(i2,k2)Δ1,2ej1,j2i1,i2ek1,k2j1,j2ei1,i2k1,k2.

We obtain the following version of Lemma 25.

Lemma 30 (Limited universality of support-localized matrix multiplication).

The tensor MMΔ degenerates to T3 for any tensor T(𝔽d)3 with support contained in Δ.

Corollary 31 (Upper bound on rank via support-localized matrix multiplication).

For any g𝒞3kΔ the tensor T(g) has rank at most R(MMΔ)(|Δ|1+3k|Δ|1).

Next we present the proof of Theorem 4.

Theorem 32 (Support-localized universal sequences of tensors).

For all nonempty Δ[d]×[d]×[d] there is an explicit sequence 𝒰Δ of zero-one-valued tensors with σ(𝒰Δ)=σ(Δ).

Proof.

Let 𝒰Δ=(UΔ,q:q=1,2,) for

UΔ,q=g𝒞qΔT(g).

As the image of Kd,q|𝔽Δ has a basis made of tensors T(g) for g𝒞qΔ the proof is analogous to the proof of Theorem 23 where we replace reference to Lemma 17 by reference to Lemma 29.

3.6 Tight Tensors and Strassen’s Conjecture

We now proceed to our main theorem for tight tensors and fixed d; we start by defining a corresponding universal sequence.

Definition 33 (Universal sequence for tight tensors and fixed d).

For a fixed positive integer d, we define the sequence 𝒯d=(Td,q:q=1,2,) of tensors, where we set

Td,q=Δ[d]3Δ tightUΔ,q=Δ[d]3Δ tightg𝒞qΔT(g).

Next we prove Theorem 5, which we restate below for convenience.

Theorem 34 (A universal sequence of tensors for Strassen’s conjecture).

We have σ(𝒯d)=σ(𝒯d) and each Td,q is tight.

Proof.

First, we prove that for g𝒞qΔ, where Δ is tight, the tensor T(g) is tight. Indeed, if we take any tensor T with support Δ, it is tight, thus so is Tq. As T(g) has smaller support it is tight. As direct sum of tight tensors is tight, we see that each Td,q is tight.

Next we note that for fixed d each Td,q is a sum of a fixed number of tensors UΔ,q. Thus, there exists a constant C such that:

maxΔ[d]3Δ tightR(UΔ,q)R(Td,q)CmaxΔ[d]3Δ tightR(UΔ,q)

and the same inequalities hold for the size of the tensors. For every tight T, we may find tight Δ such that σ(T)σ(Δ). By Theorem 4 this equals σ(𝒰Δ) and by the inequality above this is upper bounded by σ(𝒯d).

For the other inequality, we see that σ(𝒯d) is upper bounded by σ(𝒰Δ) for some tight Δ. Clearly, σ(𝒰Δ)σ(𝒯d) which finishes the proof.

4 Representation Theory and Universality of Specht Tensors

Let us now take a representation-theoretic view to the invariant subspace ([d]p×[d]p×[d]p)SSp and start by observing that the SSp-module [d]p×[d]p×[d]p is isomorphic to the SSp-module dpdpdp. A k-tuple λ=(λ1,λ2,,λk) of integers λ1λ2λk1 is an (integer) partition of the integer p=λ1+λ2++λk into k parts. We write (p) for the set of all integer partitions of p and (p,d) for the set of all integer partitions with at most d parts. For λ(p) we write λ!=(λ1!)(λ2!)(λk!). For λ(p,d) we write D(λ)=(dk)!=1p(|{j[k]:λj=}|!). For λ(p), let us write Mλ for the SSp-permutation module on Young tabloids of shape λ. Recall that the dimension of Mλ is p!/λ!. We have the SSp-module isomorphism

dpλ(p,d)d!D(λ)Mλ

and thus

dpdpdpμ,ν,λ(p,d)d!D(μ)d!D(ν)d!D(λ)MμMνMλ. (9)

For α(p), let us write Sα for the Specht module associated with α. For α,μ(p), let us write mα,μ for the Kostka numbers so that the SSp-module isomorphism

Mμα(p)mα,μSα (10)

holds. We have the following elementary lemma that puts a strong restriction on the Specht modules that need to be considered for small values of d in (9) and (10). Recall that a partition (α1,α2,) is greater or equal to a partition (μ1,μ2,) in the dominance order if and only if for any i, we have j=0iαjj=0iμj. Here, if one of partitions, say α, has k parts, we let αj=0 for j>k.

Lemma 35 (Restriction to at most d parts).

For α,μ(p) we have mα,μ0 if and only if α is larger than μ in the dominance order. In particular, for all μ(p,d) we have mα,μ=0 unless α(p,d).

Proof.

See e.g. [64, p. 315]. From (9), (10), and Lemma 35 we thus have

dpdpdpμ,ν,λ(p,d)d!D(μ)d!D(ν)d!D(λ)α,β,γ(p,d)mα,μmβ,νmγ,λSαSβSγ. (11)

Writing K(α,β,γ) for the Kronecker coefficient of α,β,γ(p), we have that the invariant space (SαSβSγ)SSp has dimension K(α,β,γ). Since ([d]p×[d]p×[d]p)SSp has dimension (d31+pd31), from (11) we immediately have

(d31+pd31)=μ,ν,λ(p,d)d!D(μ)d!D(ν)d!D(λ)α,β,γ(p,d)mα,μmβ,νmγ,λK(α,β,γ). (12)

Assuming that d is fixed and p grows, we observe that the left-hand side of (12) grows at most polynomially in p, and all summands on the right-hand side are nonnegative, implying that every summand on the right-hand grows at most polynomially in p. The above observations motivate the following definition.

Definition 36.

For any three Specht modules Sα,Sβ,Sγ, where α,β,γ are partitions of p, we call any element of (SαSβSγ)SSp an invariant Specht tensor with margin α,β,γ and degree p.

 Remark 37.

For fixed α,β,γ the dimension of the space of invariant Specht tensors equals the Kronecker coefficient K(α,β,γ).

By Lemma 35 and Equation (11) only invariant Specht tensors with margins that have at most d parts appear in the decomposition of ([d]p×[d]p×[d]p)SSp and each such tensor does appear. Further, for fixed d the dimension of all invariant Specht tensors with arbitrary margins α,β,γ(p,d) is polynomial in p. Thus, we can equivalently define σ(d) as the infimum of all positive real numbers such that for all α,β,γ(p,d) the maximum tensor rank in (SαSβSγ)SSp is at most dσ(d)p+o(p). We obtain the following corollary.

Corollary 38.

Fix an integer d2. Then σ(d) is the infimum of all positive real numbers such that for all α,β,γ(p,d) the maximum tensor rank of an invariant Specht tensor is at most dσ(d)p+o(p).

The above corollary motivates the following questions:

  • What is the maximum tensor rank for an invariant Specht tensor of degree p with margins in (p,d) as p grows?

  • Which margins witness this maximum?

Specht modules and tensor products of Specht modules have considerable structure; e.g. [77]. As highlighted above, already the case d=3 is interesting.

 Remark 39.

Our results allow to translate between asymptotic rank and rank of invariant Specht tensors. As σ(d)2ω3<2, we see that in the range α,β,γ(p,d) one indeed obtains nontrivial upper bounds on ranks of invaiant Specht tensors; that is, such tensors in general do not have generic ranks in their ambient spaces SαSβSγ.

5 Equations of Secant Varieties and Asymptotic Rank

In this section we relate existence of polynomials vanishing on special varieties, like secant varieties, and asymptotic rank. In particular, we obtain upper-bound control on σ(d) via the absence of low-degree equations of secants.

5.1 Equations and Bounds on 𝝈(𝒅)

We start with a generalization of Proposition 15.

Proposition 40 (Span of the image of a subset).

For any subset S(𝔽d)3, the following are equivalent:

  1. 1.

    no homogeneous polynomial of degree p vanishes on S,

  2. 2.

    Kd,p(S) linearly spans Ld,p.

Proof.

The second condition is equivalent to the fact that no linear form in Ld,p vanishes on Kd,p(S). By Lemma 14 this is also equivalent to the first condition.

Corollary 41 (Absence of low-degree equations implies low asymptotic rank).

Let X be the Segre variety of rank one tensors in (𝔽d)3. Suppose that for fixed n no polynomial of degree p vanishes on the nth secant variety σn(X). Then every tensor in Ld,p has rank at most

(d31+pd31)np.

Every tensor in (𝔽d)3 has asymptotic rank at most

n(d31+pd31)1p.

Proof.

Note that dimLd,p=(d31+pd31) and by Proposition 40 we have a basis of Ld,p made of tensors of rank at most np. The last statement follows. A more general, but less explicit version is given by Theorem 8, which we derive as the following corollary.

Corollary 42 (Absence of low-degree equations implies low asymptotic rank; implicit version).

Let Y(𝔽d)3 be a subset with the property that for all TY the asymptotic rank of T is at most n. Suppose that no homogeneous polynomial of degree p vanishes on Y. Then, every tensor in (𝔽d)3 has asymptotic rank at most

n(d31+pd31)1p.
 Remark 43.

The dimension component (d31+pd31) may be improved (by going to border rank) by the smallest s, such that σs(Kd,p(σn(X)))=Ld,p. The latter number is in most cases much smaller then dimLd,p. Each particular case may be exactly studied by the Teraccini Lemma.

Alternatively we could greedily, starting from rank one and going up, take tensors Ti such that Kd,p(Ti) are linearly independent, building a basis of Ld,p.

For tensors belonging to a fixed subspace W(𝔽d)3 we also have the following variant.

Theorem 44.

Let YW(𝔽d)3 be a subset with the property that for all TY the asymptotic rank of T is at most n. Suppose that no homogeneous polynomial on W of degree p vanishes on Y. Then every tensor in W has asymptotic rank at most

n(dimW1+pdimW1)1p.

Proof.

We recall that the restriction of the Veronese map of degree p to any linear subspace is still a Veronese map of degree p; that is,  a map defined by polynomials spanning the space of degree p polynomials, simply in smaller number of variables.

We restrict Kd,p to W. The linear span of Kd,p(W) is spanned by Kd,p(Y) and has dimension (dimW1+pdimW1). Hence for any tensor TW the asymptotic rank of Kd,p(T) is at most:

np(dimW1+pdimW1).

As Kd,p(T) is the pth Kronecker power of T, the statement follows. The previous result could be particularly useful if we can provide many examples of low rank tensors inside a linear subspace.

5.2 Equations of Secant Varieties and Applications

We note that deciding if there exists a nonzero polynomial of degree p on (𝔽d)3 vanishing on tensors of rank r is a question in linear algebra. The naïve approach is a as follows.

Consider 3r vectors vi,j𝔽d where 1i3 and 1jr with coordinates (vi,j)k treated as variables. The tensor T:=j=1rv1,jv2,jv3,j is a general tensor of rank r. We have:

Ta,b,c=j=1r(v1,j)a(v2,j)b(v3,j)c.

If we assign the weight (1,0,0)3 to each (v1,j)a, the weight (0,1,0) to each (v2,j)b, and the weight (0,0,1) to each (v3,j)c, we see that an evaluation of a degree p polynomial P on T is a degree (p,p,p) polynomial. Furthermore, P vanishes on all tensors of rank at most r if and only if P(T)=0 as a polynomial. To check the last condition we may build a matrix Nd,r,p with:

  1. 1.

    (p+d31p) columns indexed by 𝒞p[d]3, equivalently monomials of degree p,

  2. 2.

    (p+dr1p)3 rows indexed by monomials of degree (p,p,p) in variables (vi,j)k,

  3. 3.

    the entry in a column indexed by a monomial g𝒞p[d]3 and a row indexed by a monomial m is the coefficient of m in the polynomial g(T).

The kernel of Nd,r,p is naturally identified with the space of homogeneous degree p polyomials vanishing on rank r tensors. In particular, the kernel is trivial if and only if there are no such polynomials. While this approach is very general, it is also not applicable in most cases due to the large sizes of the matrices Nd,r,p.

A better approach to understand the equations of secant varieties is to exploit group actions. For this, one decomposes the space Sp(ddd) of homogeneous degree p polynomials on the tensor space as a direct sum of irreducible G:=GL(n)×GL(n)×GL(n) representations. The irreducible polynomial representations of G are indexed by triples of Young diagrams, in our case each one in the triple will have p elements:

Sp(ddd)=Vλ,μ,νgλ,μ,ν,

where Vλ,μ,ν is the triple corresponding to three Young diagrams λ,μ,ν with p boxes each and Vλ,μ,ν is the Kronecker coefficient. The vector space of homogeneous polynomials of degree p that vanish on the nth secant variety is a subrepresentation and hence also may be decomposed as:

Vλ,μ,νaλ,μ,ν,

where now the coefficients aλ,μ,νgλ,μ,ν are unknown. One way to determine them is to consider highest weigh space HWSλ,μ,ν, that is a vector space of dimension gλ,μ,ν inside Vλ,μ,νgλ,μ,ν. It turns out that aλ,μ,ν equals the dimension of the subspace of HWSλ,μ,ν consisting on those polynomials that vanish on the nth secant variety. Finding the basis of HWSλ,μ,ν and efficiently evaluating it on points of the secant variety is an art on its own. However, in many examples, the procedure above was successfully carried out in practice. We refer to [11, 36] for details.

Example 45.

The generic rank in 777 is 19. Tensors of border rank 18 form a hypersurface with the defining equation of degree at least 187000 [36, Section 3.2]. Applying Corollary 41 we see that every tensor in that space has asymptotic rank smaller than 18.25.

We believe that many further results on asymptotic rank may be obtained in a similar way, through Corollary 41 and 42, especially in combination with Remark 43. We leave this for future work.

References

  • [1] Boris Alexeev, Michael A. Forbes, and Jacob Tsimerman. Tensor rank: Some lower and upper bounds. In Proceedings of the 26th Annual IEEE Conference on Computational Complexity, CCC 2011, San Jose, California, USA, June 8-10, 2011, pages 283–291. IEEE Computer Society, 2011. doi:10.1109/CCC.2011.28.
  • [2] Josh Alman and Virginia Vassilevska Williams. A refined laser method and faster matrix multiplication. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 522–539. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2021. doi:10.1137/1.9781611976465.32.
  • [3] Josh Alman and Hengjie Zhang. Generalizations of matrix multiplication can solve the light bulb problem. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 1471–1495. IEEE, 2023. doi:10.1109/FOCS57990.2023.00090.
  • [4] Alessandra Bernardi and Kristian Ranestad. On the cactus rank of cubics forms. J. Symbolic Comput., 50:291–297, 2013. doi:10.1016/j.jsc.2012.08.001.
  • [5] Alessandra Bernardi and Daniele Taufer. Waring, tangential and cactus decompositions. J. Math. Pures Appl. (9), 143:1–30, 2020. doi:10.1016/j.matpur.2020.07.003.
  • [6] Dario Bini, Milvio Capovani, Francesco Romani, and Grazia Lotti. O(n2.7799) complexity for n×n approximate matrix multiplication. Inform. Process. Lett., 8(5):234–235, 1979. doi:10.1016/0020-0190(79)90113-3.
  • [7] Andreas Björklund and Petteri Kaski. The asymptotic rank conjecture and the set cover conjecture are not both true. In Bojan Mohar, Igor Shinkar, and Ryan O’Donnell, editors, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, pages 859–870. ACM, 2024. doi:10.1145/3618260.3649656.
  • [8] Markus Bläser. A 52n2-lower bound for the rank of n×n-matrix multiplication over arbitrary fields. In 40th Annual Symposium on Foundations of Computer Science (New York, 1999), pages 45–50. IEEE Computer Soc., Los Alamitos, CA, 1999. doi:10.1109/SFFCS.1999.814576.
  • [9] Markus Bläser, Matthias Christandl, and Jeroen Zuiddam. The border support rank of two-by-two matrix multiplication is seven. Chic. J. Theoret. Comput. Sci., pages Art. 5, 16, 2018. doi:10.4086/cjtcs.2018.005.
  • [10] Jonah Blasiak, Henry Cohn, Joshua A. Grochow, Kevin Pratt, and Chris Umans. Matrix multiplication via matrix groups. In Yael Tauman Kalai, editor, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA, volume 251 of LIPIcs, pages 19:1–19:16. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023. doi:10.4230/LIPICS.ITCS.2023.19.
  • [11] Paul Breiding, Reuven Hodges, Christian Ikenmeyer, and Mateusz Michałek. Equations for GL invariant families of polynomials. Vietnam J. Math., 50(2):545–556, 2022. doi:10.1007/s10013-022-00549-4.
  • [12] Weronika Buczyńska and Jarosław Buczyński. Secant varieties to high degree Veronese reembeddings, catalecticant matrices and smoothable Gorenstein schemes. J. Algebraic Geom., 23(1):63–90, 2014. doi:10.1090/S1056-3911-2013-00595-0.
  • [13] Weronika Buczyńska and Jarosław Buczyński. Apolarity, border rank, and multigraded Hilbert scheme. Duke Math. J., 170(16):3659–3702, 2021. doi:10.1215/00127094-2021-0048.
  • [14] Jarosław Buczyński and J. M. Landsberg. Ranks of tensors and a generalization of secant varieties. Linear Algebra Appl., 438(2):668–689, 2013. doi:10.1016/j.laa.2012.05.001.
  • [15] Peter Bürgisser. Degenerationsordnung und Trägerfunktional bilinearer Abbildungen. PhD thesis, Universität Konstanz, 1990. URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-20311.
  • [16] Peter Bürgisser, Michael Clausen, and M. Amin Shokrollahi. Algebraic Complexity Theory, volume 315 of Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, Berlin, 1997. doi:10.1007/978-3-662-03338-8.
  • [17] Matthias Christandl, Péter Vrana, and Jeroen Zuiddam. Barriers for fast matrix multiplication from irreversibility. Theory Comput., 17:Paper No. 2, 32, 2021. doi:10.4086/toc.2021.v017a002.
  • [18] Matthias Christandl, Péter Vrana, and Jeroen Zuiddam. Universal points in the asymptotic spectrum of tensors. J. Amer. Math. Soc., 36(1):31–79, 2023. doi:10.1090/jams/996.
  • [19] Henry Cohn, Robert D. Kleinberg, Balázs Szegedy, and Christopher Umans. Group-theoretic algorithms for matrix multiplication. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pages 379–388. IEEE Computer Society, 2005. doi:10.1109/SFCS.2005.39.
  • [20] Henry Cohn and Christopher Umans. A group-theoretic approach to fast matrix multiplication. In 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, pages 438–449. IEEE Computer Society, 2003. doi:10.1109/SFCS.2003.1238217.
  • [21] Henry Cohn and Christopher Umans. Fast matrix multiplication using coherent configurations. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, pages 1074–1087. SIAM, 2013. doi:10.1137/1.9781611973105.77.
  • [22] Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, and Emanuele Ventura. Rank and border rank of Kronecker powers of tensors and Strassen’s laser method. Comput. Complexity, 31(1):Paper No. 1, 40, 2022. doi:10.1007/s00037-021-00217-y.
  • [23] Austin Conner, Fulvio Gesmundo, Joseph M. Landsberg, Emanuele Ventura, and Yao Wang. Towards a geometric approach to Strassen’s asymptotic rank conjecture. Collect. Math., 72(1):63–86, 2021. doi:10.1007/s13348-020-00280-8.
  • [24] Austin Conner, Alicia Harper, and J. M. Landsberg. New lower bounds for matrix multiplication and det3. Forum Math. Pi, 11:Paper No. e17, 30, 2023. doi:10.1017/fmp.2023.14.
  • [25] D. Coppersmith and S. Winograd. On the asymptotic complexity of matrix multiplication. SIAM J. Comput., 11(3):472–492, 1982. doi:10.1137/0211038.
  • [26] Don Coppersmith and Shmuel Winograd. Matrix multiplication via arithmetic progressions. J. Symbolic Comput., 9(3):251–280, 1990. doi:10.1016/S0747-7171(08)80013-2.
  • [27] David A. Cox, John Little, and Donal O’Shea. Ideals, Varieties, and Algorithms. Undergraduate Texts in Mathematics. Springer, Cham, fourth edition, 2015. doi:10.1007/978-3-319-16721-3.
  • [28] Imre Csiszár and János Körner. Information Theory. Cambridge University Press, Cambridge, second edition, 2016.
  • [29] Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, and Magnus Wahlström. On problems as hard as CNF-SAT. ACM Trans. Algorithms, 12(3):41:1–41:24, 2016. doi:10.1145/2925416.
  • [30] Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. doi:10.1007/978-3-319-21275-3.
  • [31] Ran Duan, Hongxun Wu, and Renfei Zhou. Faster matrix multiplication via asymmetric hashing. In 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, November 6-9, 2023, pages 2129–2138. IEEE, 2023. doi:10.1109/FOCS57990.2023.00130.
  • [32] Maciej Gałązka. Vector bundles give equations of cactus varieties. Linear Algebra Appl., 521:254–262, 2017. doi:10.1016/j.laa.2016.12.005.
  • [33] Maciej Gałązka. Multigraded apolarity. Math. Nachr., 296(1):286–313, 2023. doi:10.1002/mana.202000484.
  • [34] Philip Alan Gartenberg. Fast Rectangular Matrix Multiplication. PhD thesis, University of California, Los Angeles, 1985. URL: https://www.proquest.com/dissertations-theses/fast-rectangular-matrix-multiplication-algebraic/docview/303332114/se-2.
  • [35] Johan Håstad. Tensor rank is NP-complete. J. Algorithms, 11(4):644–654, 1990. doi:10.1016/0196-6774(90)90014-6.
  • [36] Jonathan D. Hauenstein, Christian Ikenmeyer, and J. M. Landsberg. Equations for lower bounds on border rank. Exp. Math., 22(4):372–383, 2013. doi:10.1080/10586458.2013.825892.
  • [37] Christopher J. Hillar and Lek-Heng Lim. Most tensor problems are NP-hard. J. ACM, 60(6):Art. 45, 39, 2013. doi:10.1145/2512329.
  • [38] Anthony Iarrobino and Vassil Kanev. Power Sums, Gorenstein Algebras, and Determinantal Loci, volume 1721 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1999. doi:10.1007/BFb0093426.
  • [39] Matti Karppa and Petteri Kaski. Probabilistic tensors and opportunistic Boolean matrix multiplication. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 496–515. SIAM, Philadelphia, PA, 2019. doi:10.1137/1.9781611975482.31.
  • [40] Robert Krauthgamer and Ohad Trabelsi. The set cover conjecture and subgraph isomorphism with a tree pattern. In Rolf Niedermeier and Christophe Paul, editors, 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13-16, 2019, Berlin, Germany, volume 126 of LIPIcs, pages 45:1–45:15. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2019. doi:10.4230/LIPIcs.STACS.2019.45.
  • [41] J. M. Landsberg. The border rank of the multiplication of 2×2 matrices is seven. J. Amer. Math. Soc., 19(2):447–459, 2006. doi:10.1090/S0894-0347-05-00506-0.
  • [42] J. M. Landsberg. Tensors: Geometry and Applications, volume 128 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2012. doi:10.1090/gsm/128.
  • [43] J. M. Landsberg. New lower bounds for the rank of matrix multiplication. SIAM J. Comput., 43(1):144–149, 2014. doi:10.1137/120880276.
  • [44] J. M. Landsberg. Nontriviality of equations and explicit tensors in mmm of border rank at least 2m2. J. Pure Appl. Algebra, 219(8):3677–3684, 2015. doi:10.1016/j.jpaa.2014.12.016.
  • [45] J. M. Landsberg. Tensors: Asymptotic Geometry and Developments 2016–2018, volume 132 of CBMS Regional Conference Series in Mathematics. American Mathematical Society, Providence, RI, 2019. doi:10.1090/cbms/132.
  • [46] J. M. Landsberg and L. Manivel. On the ideals of secant varieties of Segre varieties. Found. Comput. Math., 4(4):397–422, 2004. doi:10.1007/s10208-003-0115-9.
  • [47] J. M. Landsberg and Mateusz Michałek. On the geometry of border rank decompositions for matrix multiplication and other tensors with symmetry. SIAM J. Appl. Algebra Geom., 1(1):2–19, 2017. doi:10.1137/16M1067457.
  • [48] J. M. Landsberg and Mateusz Michałek. Towards finding hay in a haystack: explicit tensors of border rank greater than 2.02m in mmm. CoRR, abs/1912.11927, 2019. doi:10.48550/arXiv.1912.11927.
  • [49] J. M. Landsberg and Giorgio Ottaviani. Equations for secant varieties of Veronese and other varieties. Ann. Mat. Pura Appl. (4), 192(4):569–606, 2013. doi:10.1007/s10231-011-0238-6.
  • [50] J. M. Landsberg and Zach Teitler. On the ranks and border ranks of symmetric tensors. Found. Comput. Math., 10(3):339–366, 2010. doi:10.1007/s10208-009-9055-3.
  • [51] Joseph M. Landsberg and Mateusz Michałek. A 2n2log2(n)1 lower bound for the border rank of matrix multiplication. Int. Math. Res. Not. IMRN, 15:4722–4733, 2018. doi:10.1093/imrn/rnx025.
  • [52] Joseph M. Landsberg and Giorgio Ottaviani. New lower bounds for the border rank of matrix multiplication. Theory Comput., 11:285–298, 2015. doi:10.4086/toc.2015.v011a011.
  • [53] François Le Gall. Powers of tensors and fast matrix multiplication. In ISSAC 2014—Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pages 296–303. ACM, New York, 2014. doi:10.1145/2608628.2608664.
  • [54] Franz Mauch. Ein Randverteilungsproblem und seine Anwendung auf das asymptotische Spektrum bilinearer Abbildungen. PhD thesis, Universität Konstanz, 1998. URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-20543.
  • [55] Mateusz Michałek and Bernd Sturmfels. Invitation to Nonlinear Algebra, volume 211 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2021. doi:10.1090/gsm/211.
  • [56] Ketan Mulmuley. The GCT program toward the P vs. NP problem. Commun. ACM, 55(6):98–107, 2012. doi:10.1145/2184319.2184341.
  • [57] Ketan D. Mulmuley. On P vs. NP and geometric complexity theory. J. ACM, 58(2):Art. 5, 26, 2011. doi:10.1145/1944345.1944346.
  • [58] Victor Y. Pan. Strassen’s algorithm is not optimal: Trililnear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In 19th Annual Symposium on Foundations of Computer Science, Ann Arbor, Michigan, USA, 16-18 October 1978, pages 166–176. IEEE Computer Society, 1978. doi:10.1109/SFCS.1978.34.
  • [59] Kevin Pratt. A stronger connection between the asymptotic rank conjecture and the set cover conjecture. In Bojan Mohar, Igor Shinkar, and Ryan O’Donnell, editors, Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, June 24-28, 2024, pages 871–874. ACM, 2024. doi:10.1145/3618260.3649620.
  • [60] Ran Raz. Tensor-rank and lower bounds for arithmetic formulas. J. ACM, 60(6):Art. 40, 15, 2013. doi:10.1145/2535928.
  • [61] Francesco Romani. Some properties of disjoint sums of tensors related to matrix multiplication. SIAM J. Comput., 11(2):263–267, 1982. doi:10.1137/0211020.
  • [62] A. Schönhage. Partial and total matrix multiplication. SIAM J. Comput., 10(3):434–455, 1981. doi:10.1137/0210032.
  • [63] Zhao Song, David P. Woodruff, and Peilin Zhong. Relative error tensor low rank approximation. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2772–2789. SIAM, Philadelphia, PA, 2019. doi:10.1137/1.9781611975482.172.
  • [64] Richard P. Stanley. Enumerative Combinatorics. Vol. 2, volume 62 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1999. doi:10.1017/CBO9780511609589.
  • [65] Andrew James Stothers. On the Complexity of Matrix Multiplication. PhD thesis, University of Edinburgh, 2010. URL: http://hdl.handle.net/1842/4734.
  • [66] V. Strassen. Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math., 375/376:406–443, 1987. doi:10.1515/crll.1987.375-376.406.
  • [67] V. Strassen. The asymptotic spectrum of tensors. J. Reine Angew. Math., 384:102–152, 1988. doi:10.1515/crll.1988.384.102.
  • [68] V. Strassen. Degeneration and complexity of bilinear maps: some asymptotic spectra. J. Reine Angew. Math., 413:127–180, 1991. doi:10.1515/crll.1991.413.127.
  • [69] V. Strassen. Algebra and complexity. In First European Congress of Mathematics, Vol. II (Paris, 1992), volume 120 of Progr. Math., pages 429–446. Birkhäuser, Basel, 1994.
  • [70] Volker Strassen. Gaussian elimination is not optimal. Numer. Math., 13:354–356, 1969. doi:10.1007/BF02165411.
  • [71] Volker Strassen. The asymptotic spectrum of tensors and the exponent of matrix multiplication. In 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pages 49–54. IEEE Computer Society, 1986. doi:10.1109/SFCS.1986.52.
  • [72] Volker Strassen. Komplexität und Geometrie bilinearer Abbildungen. Jahresber. Deutsch. Math.-Verein., 107(1):3–31, 2005.
  • [73] Zach Teitler. Geometric lower bounds for generalized ranks. CoRR, abs/1406.5145, 2014. doi:10.48550/arXiv.1406.5145.
  • [74] Verena Tobler. Spezialisierung und Degeneration von Tensoren. PhD thesis, Universität Konstanz, 1991. URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-opus-20324.
  • [75] Virginia Vassilevska Williams. Multiplying matrices faster than Coppersmith-Winograd [extended abstract]. In STOC’12—Proceedings of the 2012 ACM Symposium on Theory of Computing, pages 887–898. ACM, New York, 2012. doi:10.1145/2213977.2214056.
  • [76] Avi Wigderson and Jeroen Zuiddam. Asymptotic spectra: Theory, applications and extensions. Manuscript dated October 24, 2023; available at https://www.math.ias.edu/~avi/PUBLICATIONS/WigdersonZu_Final_Draft_Oct2023.pdf, 2023.
  • [77] John D. Wiltshire-Gordon, Alexander Woo, and Magdalena Zajaczkowska. Specht polytopes and Specht matroids. In Combinatorial Algebraic Geometry, volume 80 of Fields Inst. Commun., pages 201–228. Fields Inst. Res. Math. Sci., Toronto, ON, 2017.
  • [78] F. L. Zak. Tangents and Secants of Algebraic Varieties, volume 127 of Translations of Mathematical Monographs. American Mathematical Society, Providence, RI, 1993. doi:10.1090/mmono/127.