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 -tensor with rank at least , with a constant depending on . Our results extend to border rank over the real or complex numbers.
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