Score: 1

Tensor rank and dimension expanders

Published: November 4, 2025 | arXiv ID: 2511.02670v2

By: Zeev Dvir

BigTech Affiliations: Princeton University

Potential Business Impact:

Makes computers understand complex math problems better.

Business Areas:
A/B Testing Data and Analytics

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 - ε)n$, with $D$ a constant depending on $ε$. Our results extend to border rank over the real or complex numbers.

Country of Origin
🇺🇸 United States

Page Count
9 pages

Category
Mathematics:
Combinatorics