Polynomial bound for the partition rank vs the analytic rank of tensors
Polynomial bound for the partition rank vs the analytic rank of tensors, Discrete Analysis 2020:7, 18 pp. There are a number of proofs in additive combinatorics that involve bilinear forms on $\mathbb F_p^n$ that split into a high-rank case and a low-rank case. If the form has high rank, then it h...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Diamond Open Access Journals
|
| Series: | Discrete Analysis |
| Online Access: | http://discrete-analysis.scholasticahq.com/article/12935-polynomial-bound-for-the-partition-rank-vs-the-analytic-rank-of-tensors.pdf |