# A combinatorial approach to the algebra of hypermatrices

Source: [A combinatorial approach to the algebra of hypermatrices](<https://www.sota2.com/research/paper/68fa519f1e209131ce97509b>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:29:14.401Z

Authors: Edinah K. Gnang

Published: 2014-03-12T23:58:06.000Z

## Abstract

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing an application of the theorem to computing graph invariants which distinguish some non-isomorphic graphs with isospectral adjacency matrices.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1403.3134>)

[PDF](<https://arxiv.org/pdf/1403.3134.pdf>)
