Hyperdeterminants on semilattices
Combinatorics
2007-05-23 v3 General Mathematics
Abstract
We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to generalize a theorem of Lindstr\"om to higher-dimensional determinants. And we gave as an application generalizations of some results due to Lehmer, Li and Haukkanen.
Keywords
Cite
@article{arxiv.math/0607279,
title = {Hyperdeterminants on semilattices},
author = {Jean-Gabriel Luque},
journal= {arXiv preprint arXiv:math/0607279},
year = {2007}
}
Comments
New version of "A remark about factorizing GCD-type Hyperdeterminants". Title changed. Results, examples and remarks added