Structure vs. Randomness for Bilinear Maps

02/09/2021
by   Alex Cohen, et al.
0

We prove that the slice rank of a 3-tensor (a combinatorial notion introduced by Tao in the context of the cap-set problem), the analytic rank (a Fourier-theoretic notion introduced by Gowers and Wolf), and the geometric rank (a recently introduced algebro-geometric notion) are all equivalent up to an absolute constant. As a corollary, we obtain strong trade-offs on the arithmetic complexity of a biased bililnear map, and on the separation between computing a bilinear map exactly and on average. Our result settles open questions of Haramaty and Shpilka [STOC 2010], and of Lovett [Discrete Anal., 2019] for 3-tensors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/30/2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors

Since the seminal works of Strassen and Valiant it has been a central th...
research
06/24/2022

Notes on presheaf representations of strategies and cohomological refinements of k-consistency and k-equivalence

In this note, we show how positional strategies for k-pebble games have ...
research
03/15/2021

Bilinear Complexity of 3-Tensors Linked to Coding Theory

A well studied problem in algebraic complexity theory is the determinati...
research
11/06/2019

Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory

We study the variety membership testing problem in the case when the var...
research
06/01/2021

Extended retraction maps: a seed of geometric integrators

The classical notion of retraction map used to approximate geodesics is ...
research
02/21/2021

An Optimal Inverse Theorem

We prove that the partition rank and the analytic rank of tensors are eq...
research
05/19/2020

Growth of bilinear maps

For a bilinear map *:ℝ^d×ℝ^d→ℝ^d of nonnegative coefficients and a vecto...

Please sign up or login with your details

Forgot password? Click here to reset