A New Formula for the Determinant and Bounds on Its Tensor and Waring Ranks
Robin Houston, Adam P. Goucher, Nathaniel Johnston

TL;DR
This paper introduces a new explicit formula for the determinant with fewer terms, providing tighter bounds on tensor and Waring ranks, and revealing new geometric structures.
Contribution
It presents a novel explicit determinant formula, improves bounds on tensor and Waring ranks, and uncovers new tiling polytopes in high-dimensional spaces.
Findings
Determinant formula with superexponentially fewer terms
Tensor rank of $n imes n$ determinant bounded by Bell number
Exact tensor rank of $4 imes 4$ determinant over $ extbf{F}_2$ is 12
Abstract
We present a new explicit formula for the determinant that contains superexponentially fewer terms than the usual Leibniz formula. As an immediate corollary of our formula, we show that the tensor rank of the determinant tensor is no larger than the -th Bell number, which is much smaller than the previously best known upper bounds when . Over fields of non-zero characteristic we obtain even tighter upper bounds, and we also slightly improve the known lower bounds. In particular, we show that the determinant over has tensor rank exactly equal to . Our results also improve upon the best known upper bound for the Waring rank of the determinant when , and lead to a new family of axis-aligned polytopes that tile .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Algorithms and Data Compression · graph theory and CDMA systems
