Group and algebra hyperdeterminant
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908887695753216 |
|---|---|
| author | Amanov, Alimzhan |
| author_facet | Amanov, Alimzhan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_14378 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Group and algebra hyperdeterminant Amanov, Alimzhan Combinatorics Representation Theory 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. |
| title | Group and algebra hyperdeterminant |
| topic | Combinatorics Representation Theory |
| url | https://arxiv.org/abs/2603.14378 |