Geometric rank of tensors and subrank of matrix multiplication

Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce the geometric rank as a new tool in the study of tensors and hypergraphs. We prove that the geometric rank is an upper bound on the subrank of tensors and the independence number of hypergraphs. We prove that the geometric rank is smaller than the slice rank of Tao, and relate geometric rank to the analytic rank of Gowers and Wolf in an asymptotic fashion. As a first application, we use geometric rank to prove a tight upper bound on the (border) subrank of the matrix multiplication tensors, matching Strassen's well-known lower bound from 1987.

[1]  L. Milicevic.  Polynomial bound for partition rank in terms of analytic rank , 2019, Geometric and Functional Analysis.

[2]  叶袆 黎海芪,et al.  Werner综合征一例 , 2009 .

[3]  Josh Alman,et al.  Limits on the Universal method for matrix multiplication , 2018, CCC.

[4]  Markus Bläser,et al.  Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory , 2019, ArXiv.

[5]  Shachar Lovett,et al.  Variety Evasive Sets , 2013, computational complexity.

[6]  Joshua A. Grochow,et al.  Which groups are amenable to proving exponent two for matrix multiplication? , 2017, ArXiv.

[7]  Pooya Hatami,et al.  On Multilinear Forms: Bias, Correlation, and Tensor Rank , 2018, Electron. Colloquium Comput. Complex..

[8]  Bruce K. Bell,et al.  Volume 5 , 1998 .

[9]  V. Strassen.  The asymptotic spectrum of tensors. , 1988 .

[10]  Marvin A. Carlson.  Editor , 2015 .

[11]  V. Strassen.  Relative bilinear complexity and matrix multiplication. , 1987 .

[12]  W. Sawin,et al.  UPPER BOUNDS FOR SUNFLOWER-FREE SETS , 2016, Forum of Mathematics, Sigma.

[13]  Joe W. Harris,et al.  Algebraic Geometry: A First Course , 1995 .

[14]  Matthias Christandl,et al.  Barriers for fast matrix multiplication from irreversibility , 2018, CCC.

[16]  J. Urry.  Complexity , 2006, Interpreting Art.

[17]  Jacob Tsimerman,et al.  Sum–product estimates for rational functions , 2010, 1002.2554.

[18]  Oliver Janzer.  Polynomial bound for the partition rank vs the analytic rank of tensors , 2019, 1902.11207.

[19]  V. Strassen,et al.  Degeneration and complexity of bilinear maps: Some asymptotic spectra. , 1991 .

[20]  B. M. Fulk.  MATH , 1992 .

[21]  S. Lang,et al.  NUMBER OF POINTS OF VARIETIES IN FINITE FIELDS. , 1954 .

[22]  P. Steerenberg,et al.  Targeting pathophysiological rhythms: prednisone chronotherapy shows sustained efficacy in rheumatoid arthritis. , 2010, Annals of the rheumatic diseases.

[23]  A. H. Werner,et al.  Tensor network representations from the geometry of entangled states , 2018, SciPost Physics.

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[25]  D. Berend,et al.  Polynomials with roots modulo every integer , 1996 .

[26]  Matthias Christandl,et al.  Universal points in the asymptotic spectrum of tensors , 2017, STOC.

[27]  James Ax,et al.  Solving Diophantine Problems Modulo Every Prime , 1967 .

[28]  Shachar Lovett,et al.  Bias vs structure of polynomials in large fields, and applications in effective algebraic geometry and coding theory , 2015, Electron. Colloquium Comput. Complex..

[29]  Josh Alman,et al.  Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[30]  Shachar Lovett.  The analytic rank of tensors and its applications , 2018, 1806.09179.

[31]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[32]  Yuval Filmus,et al.  High dimensional Hoffman bound and applications in extremal combinatorics , 2019, Algebraic Combinatorics.

[33]  Jordan S. Ellenberg,et al.  On large subsets of $F_q^n$ with no three-term arithmetic progression , 2016 .

[34]  Volker Strassen,et al.  Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[35]  Joshua A. Grochow,et al.  On cap sets and the group-theoretic approach to matrix multiplication , 2016, ArXiv.

[36]  W. T. Gowers,et al.  Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$ , 2010, 1002.2208.

[37]  Pascal Koiran.  Randomized and deterministic algorithms for the dimension of algebraic varieties , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[39]  Andris Ambainis,et al.  Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method , 2014, STOC.

[40]  Andris Ambainis,et al.  Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method , 2014, STOC.