The Partition Rank of a Tensor and -Right Corners in
arXiv:1701.04475 · doi:10.1016/j.jcta.2019.105190
Abstract
Following the breakthrough of Croot, Lev, and Pach, Tao introduced a symmetrized version of their argument, which is now known as the slice rank method. In this paper, we introduce a more general version of the slice rank of a tensor, which we call the Partition Rank. This allows us to extend the slice rank method to problems that require the variables to be distinct. Using the partition rank, we generalize a recent result of Ge and Shangguan, and prove that any set of size \[|A|>\binom{n+(k-1)q}{(k-1)(q-1)}\] contains a -right-corner, that is distinct vectors where are mutually orthogonal, for , a prime power with .
arXiv commentUpdated section 5, as well as the proof for the improved k=2 bound
References in corpus (5)
Cited by in corpus (10)
- Polynomial bound for the partition rank vs the analytic rank of tensors
- Monochromatic Equilateral Triangles in the Unit Distance Graph
- An inverse theorem for Freiman multi-homomorphisms
- A Gap in the Subrank of Tensors
- Exponential Bounds for the Erdős-Ginzburg-Ziv Constant
- Partition and Analytic Rank are Equivalent over Large Fields
- Universal points in the asymptotic spectrum of tensors
- The slice rank of a direct sum
- A note on extensions of multilinear maps defined on multilinear varieties
- Ranges of polynomials control degree ranks of Green and Tao over finite prime fields