RTNANAJun 17, 2016

Nondegenerate $2 \times k \times (k+1)$ Hypermatrices

arXiv:1606.04532h-index: 1
Originality Synthesis-oriented
AI Analysis

For mathematicians studying hypermatrices and hyperdeterminants, this work provides new structural results and computational tools, though it is incremental in extending known techniques.

This paper extends Gaussian elimination to $2 \ imes k \ imes (k+1)$ hypermatrices, providing a transitive group action that enables computation of homotopy groups over $\\mathbb{C}$, counting over finite fields, and an $O(k^4)$ algorithm for hyperdeterminants.

We construct an extension of Gaussian elimination to show that if $\mathbb{F}$ is a topological field, then there is a transitive, free, and continuous action of a natural quotient of $GL_k(\mathbb{F}) \times GL_{k+1}(\mathbb{F})$ on the set $M_k(\mathbb{F})$ of $2 \times k \times (k+1)$ hypermatrices over $\mathbb{F}$ with nonzero hyperdeterminant. We use this action to answer a number of questions including determining the homotopy groups of $M_k(\mathbb{C})$, counting elements of $M_k(\mathbb{F}_q)$ (generalizing an unpublished result of Lewis and Sam), and computing hyperdeterminants for $2 \times k \times (k+1)$ hypermatrices in $O(k^4)$ time, which we use to compute explicit formulas in some special cases.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes