A combinatorial approach to the algebra of hypermatrices

2014/03/12 by Edinah K. Gnang, Gnang, Edinah K.
Computer Science · Mathematics · #Advanced Graph Theory Research #Matrix Theory and Algorithms #Tensor decomposition and applications #math.CO

paper · pdf · doi:10.48550/arxiv.1403.3134

arxiv created 2015/03/17 · arxiv updated 2015/03/18

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.

Citations

• A combinatorial approach to matrix algebra

Related

• Polynomial identities for hypermatrices
• A combinatorial proof of the trace Cayley-Hamilton theorem
• On the Cayley-Hamilton Theorem for Supermatrices
• Hypergraphs and hypermatrices with symmetric spectrum
• Cayley's hyperdeterminant: a combinatorial approach via representation theory