The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
From MaRDI portal
Publication:2174943
DOI10.1016/j.jcta.2019.105190zbMath1477.11047arXiv1701.04475OpenAlexW3011285915MaRDI QIDQ2174943
Publication date: 27 April 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04475
Related Items
Approximately symmetric forms far from being exactly symmetric ⋮ Universal points in the asymptotic spectrum of tensors ⋮ Exponential bounds for the Erdős-Ginzburg-Ziv constant ⋮ A recursive Lovász theta number for simplex-avoiding sets ⋮ The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ Avoiding right angles and certain Hamming distances ⋮ A Gap in the Subrank of Tensors ⋮ Inverse theorem for certain directional Gowers uniformity norms ⋮ Partition and analytic rank are equivalent over large fields ⋮ Geometric rank and linear determinantal varieties ⋮ Subspaces of tensors with high analytic rank ⋮ Unnamed Item ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ A gap in the slice rank of \(k\)-tensors ⋮ Maximum subsets of \(\mathbb{F}^n_q\) containing no right angles ⋮ Polynomial bound for the partition rank vs the analytic rank of tensors ⋮ On the size of subsets of \(\mathbb{F}_p^n\) without \(p\) distinct elements summing to zero ⋮ A note on extensions of multilinear maps defined on multilinear varieties ⋮ Polynomial bound for partition rank in terms of analytic rank ⋮ Tensor slice rank and Cayley's first hyperdeterminant
Cites Work
- Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- An upper bound for the cardinality of an s-distance subset in real euclidean space
- Occurrence of right angles in vector spaces over finite fields
- Exponential bounds for the Erdős-Ginzburg-Ziv constant
- Arithmetic Circuits: A survey of recent results and open questions
- On cap sets and the group-theoretic approach to matrix multiplication
- UPPER BOUNDS FOR SUNFLOWER-FREE SETS
