Related papers: Hyperdeterminants as integrable discrete systems
Cayley's hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a 2 x 2 x 2 array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts…
Hyperdeterminants are generalizations of determinants from matrices to multi-dimensional hypermatrices. They were discovered in the 19th century by Arthur Cayley but were largely ignored over a period of 100 years before once again being…
We use the representation theory of Lie algebras and computational linear algebra to determine the simplest nonconstant invariant polynomial in the entries of a general 2 x 2 x 3 array. This polynomial is homogeneous of degree 6 and has 66…
The hyperdeteminants considered here are the simplest analogues of determinants for higher rank tensors which have been defined by Cayley, and apply only to tensors with an even number of indices. We have shown in a previous article that…
The discriminant of a multivariate polynomial with indeterminate coefficients is not necessarily a hypersurface, and characterizing its codimension was an open problem for quite a while. We resolve this problem for the discriminants of…
We investigate the simplest class of hyperdeterminants defined by Cayley in the case of Hankel hypermatrices (tensors of the form $A_{i_1i_2... i_k}=f(i_1+i_2+...+i_k)$). It is found that many classical properties of Hankel determinants can…
Methods developed for the analysis of integrable systems are used to study the problem of hyperK\"ahler metrics building as formulated in D=2 N=4 supersymmetric harmonic superspace. We show, in particular, that the constraint equation…
Starting from the expression for the superdeterminant of (xI-M), where M is an arbitrary supermatrix, we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its characteristic…
The hyperdeterminant of format 2 x 2 x 2 x 2 is a polynomial of degree 24 in 16 unknowns which has 2894276 terms. We compute the Newton polytope of this polynomial and the secondary polytope of the 4-cube. The 87959448 regular…
We study the structure of ideals generated by some classes of 2 \times 2 permanents of hypermatrices. This generalizes [9] on 2 x 2 permanental ideal of generic matrices. We compare the obtained structure to that of the corresponding…
We use the representation theory of Lie algebras and computational linear algebra to obtain an explicit formula for the hyperdeterminant of a $3 \times 3 \times 2$ array: a homogeneous polynomial of degree 12 in 18 variables with 16749…
The family of (super)integrable potentials on spaces with curvature developed by A. Ballesteros et all is extend to all two-dimensional Cayley-Klein spaces with the help of contractions. It is shown that integrable systems on spaces with…
We formulate a division problem for a class of overdetermined systems introduced by L. H{\"o}rmander, and establish an effective divisibility criterion. In addition, we prove a coherence theorem which extends Nadel's coherence theorem from…
The article investigates systems of differential-difference equations of hyperbolic type, integrable in sense of Darboux. The concept of a complete set of independent characteristic integrals underlying Darboux integrability is discussed. A…
Starting from the expression for the superdeterminant of $ (xI-M)$, where $M$ is an arbitrary supermatrix , we propose a definition for the corresponding characteristic polynomial and we prove that each supermatrix satisfies its…
Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…
Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…
In the space of square matrices, we characterize row-generated subspaces, on which the determinant is an irreducible polynomial. As a corollary, we characterize square systems of polynomial equations with indeterminate coefficients, whose…
In 1896, Dedekind posed the problem of factoring the group determinant in the non-abelian case to Frobenius, whose solution sparked the birth of finite-group representation theory. Several decades earlier, Cayley introduced the notion of…
The hyperdeterminant of a polynomial (interpreted as a symmetric tensor) factors into several irreducible factors with multiplicities. Using geometric techniques these factors are identified along with their degrees and their…