Tensor rank and dimension expanders
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 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]-tensor with rank at least (2 - ε)n, with D a constant depending on ε. Our results extend to border rank over the real or complex numbers.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.