Preprint · arXiv · March 15, 2026

Group and algebra hyperdeterminant

Read on arXiv PDFDOI 10.48550/arxiv.2603.14378

Abstract

In 1896, Dedekind posed the problem of factoring the group determinant in the non-abelian case to Frobenius, whose solution sparked the birth of finite-group representation theory. Several decades earlier, Cayley introduced the notion of the combinatorial hyperdeterminant of a $d$-way tensor, which is the most natural generalization of an ordinary determinant. In this note, we solve the problem of factoring the group hyperdeterminant. We reduce the computation of the group hyperdeterminant to the computation of the hyperdeterminant at the matrix multiplication tensor and derive a nice closed formula. Further, we extend this notion to associative algebra tensors and show that this polynomial is nonzero if and only if the algebra is semisimple.

Tensor decomposition and applicationsAdvanced Combinatorial MathematicsFinite Group Theory Researchhyperdeterminantgroup determinantmatrix multiplication tensor

Group and algebra hyperdeterminant

Abstract

More by Alimzhan Amanov