Hyperdeterminants on semilattices
classification
🧮 math.CO
math.GM
keywords
hyperdeterminantsindiceswhoseallowsapplicationbelongsboundcompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.