English

Tensor rank and dimension expanders

Combinatorics 2025-12-10 v2 Computational Complexity

Abstract

We prove a lower bound on the rank of tensors constructed from families of linear maps that `expand' the dimension of every subspace. Such families, called {\em dimension expanders} have been studied for many years with several known explicit constructions. Using these constructions we show that one can construct an explicit [D]×[n]×[n][D]\times [n] \times [n]-tensor with rank at least (2ϵ)n(2 - \epsilon)n, with DD a constant depending on ϵ\epsilon. Our results extend to border rank over the real or complex numbers.

Keywords

Cite

@article{arxiv.2511.02670,
  title  = {Tensor rank and dimension expanders},
  author = {Zeev Dvir},
  journal= {arXiv preprint arXiv:2511.02670},
  year   = {2025}
}

Comments

9 pages

R2 v1 2026-07-01T07:21:27.717Z