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

DOI10.19086/DA.12935zbMath1475.11023arXiv1902.11207OpenAlexW2916106022MaRDI QIDQ5126770

Oliver Janzer

Publication date: 20 October 2020

Published in: discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.11207

zbMATH Keywords

tensorpartition rankanalytic rank

Mathematics Subject Classification ID

Multilinear algebra, tensor calculus (15A69) Vector spaces, linear dependence, rank, lineability (15A03) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (10)

The analytic rank of tensors and its applications ⋮ Approximately symmetric forms far from being exactly symmetric ⋮ Partition and analytic rank are equivalent over large fields ⋮ On rank in algebraic closure ⋮ Relative rank and regularization ⋮ Subspaces of tensors with high analytic rank ⋮ Properties of high rank subvarieties of affine spaces ⋮ Applications of algebraic combinatorics to algebraic geometry ⋮ Unnamed Item ⋮ A note on extensions of multilinear maps defined on multilinear varieties

Cites Work

• Unnamed Item
• Linear forms and higher-degree uniformity for functions on \(\mathbb F^n_p\)
• On the Bogolyubov-Ruzsa lemma
• The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
• Polynomial bound for partition rank in terms of analytic rank
• Approximate cohomology
• On the structure of cubic and quartic polynomials
• The distribution of polynomials over finite fields, with applications to the Gowers norms
• The analytic rank of tensors and its applications
• Subsets of Cayley graphs that induce many edges

This page was built for publication: Polynomial bound for the partition rank vs the analytic rank of tensors