Unbounded strength of the determinant

From papers

For each form PP, let \str(P)\str(P) denote the least number of reducible forms whose sum is PP. Let detn\mathrm{det}_n be the determinant viewed as a homogeneous polynomial in the rows (or columns) of an n×nn\times n matrix. Strength conjecture.

limn\str(detn)=.\lim_{n \to \infty} \str(\mathrm{det}_n) = \infty.

The strength measures expansions in which the factors need not be multilinear. Even obtaining any nontrivial bound for the strength of the determinant is open, so this conjecture asks for the much weaker assertion that the strength is unbounded as the matrix size grows.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Amichai Lampert and Guy Moshkovitz, “Slice rank and partition rank of the determinant”, arXiv:2509.06294 (2025).

Solutions 0

No solutions have been posted yet.