Affiliation:
1. Mathematical Institute University of Oxford Oxford UK
Abstract
AbstractLet be integers. Using a fragmentation technique, we characterise ‐tuples of non‐empty families of partitions of such that it suffices that an order‐ tensor has bounded ‐rank for each for it to have bounded ‐rank. On the way, we prove power lower bounds on suitable products of diagonal tensors, providing a qualitative answer to a question of Naslund.
Funder
H2020 European Research Council
Reference17 articles.
1. D. M.Correia B.Sudakov andI.Tomon Flattening rank and its combinatorial applications arXiv:2103.03217 2021.
2. Progression-free sets in $\mathbb{Z}_4^n$ are exponentially small
3. On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression
4. Linear Forms and Higher-Degree Uniformity for Functions On $${\mathbb{F}^{n}_{p}}$$
5. The distribution of polynomials over finite fields, with applications to the Gowers norms;Green B.;Contrib. Discrete Math.,2009