2000 character limit reached
Tensor rank and dimension expanders
Published 4 Nov 2025 in math.CO and cs.CC | (2511.02670v1)
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]\times [n] \times [n]$-tensor with rank at least $(2 - \epsilon)n$, with $D$ a constant depending on $\epsilon$. Our results extend to border rank over the real or complex numbers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.