# Polynomial bound for the partition rank vs the analytic rank of tensors

## TL;DR

This paper proves a polynomial bound relating the partition rank and the analytic rank of tensors over finite fields, improving previous tower and Ackermann-type bounds, with implications for biased polynomials.

## Contribution

It establishes a polynomial bound for the partition rank in terms of the analytic rank, advancing from tower and Ackermann bounds, and independently confirms similar results by Milićević.

## Key findings

- Partition rank is polynomially bounded by analytic rank for tensors.
- Improves previous bounds from tower and Ackermann-type functions.
- Shows biased polynomials have low rank with polynomial dependence.

## Abstract

A tensor defined over a finite field $\mathbb{F}$ has low analytic rank if the distribution of its values differs significantly from the uniform distribution. An order $d$ tensor has partition rank 1 if it can be written as a product of two tensors of order less than $d$, and it has partition rank at most $k$ if it can be written as a sum of $k$ tensors of partition rank 1. In this paper, we prove that if the analytic rank of an order $d$ tensor is at most $r$, then its partition rank is at most $f(r,d,|\mathbb{F}|)$, where, for fixed $d$ and $\mathbb{F}$, $f$ is a polynomial in $r$. This is an improvement of a recent result of the author, where he obtained a tower-type bound. Prior to our work, the best known bound was an Ackermann-type function in $r$ and $d$, though it did not depend on $\mathbb{F}$. It follows from our results that a biased polynomial has low rank; there too we obtain a polynomial dependence improving the previously known Ackermann-type bound. A similar polynomial bound for the partition rank was obtained independently and simultaneously by Mili\'cevi\'c.