Related papers: The Cayley-Hamilton theorem for supermatrices

We develop a noncommutative analogue of the spectral decomposition with the quasideterminant defined by I. Gelfand and V. Retakh. In this theory, by introducing a noncommutative Lagrange interpolating polynomial and combining a…

We give an elementary proof of a Caratheodory-type result on the invertibility of a sum of matrices, due first to Facchini and Barioli. The proof yields a polynomial identity, expressing the determinant of a large sum of matrices in terms…

We introduce a deformation of Cayley's second hyperdeterminant for even-dimensional hypermatrices. As an application, we formulate a generalization of the Jacobi-Trudi formula for Macdonald functions of rectangular shapes generalizing…

Dual quaternion/complex matrices have important applications in brain science and multi-agent formation control. In this paper, we first study some basic properties of determinants of dual complex matrices, including Sturm theorem and…

This paper, a continuation of [3], involves a closer study of polynomials of supertropical semirings and their version of tropical geometry in which we introduce the concept of relatively prime polynomials and resultants, with the aid of…

We enumerate generalizations of the superintegrability property $<character>\ \sim {\rm character}$ and illuminate possible general structures behind them. We collect variations of original formulas available up to date and emphasize the…

In this note, we consider matrices similar to $X$-form matrices, which are the matrices for which only the diagonal and the anti-diagonal elements can be different from zero. First, we give a characterization of these matrices using the…

Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…

E. Bayer-Fluckiger gave a necessary and sufficient condition for a polynomial to be realized as the characteristic polynomial of a semisimple isometry of an even unimodular lattice, by describing the local-global obstruction, and the author…

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

We provide conditions and algorithmic tools so as to classify and construct the smallest possible determinantal formulae for multihomogeneous resultants arising from Weyman complexes associated to line bundles in products of projective…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Let K be an infinite field and let R be a K-algebra endowed with a homogeneous polynomial norm N of degree n. If N satisfies a formal analogue of the Cayley-Hamilton Theorem the we will show that R is a quotient of the ring of the…

We give the basic definitions and some theoretical results about hyperdeterminants, introduced by A. Cayley in 1845. We prove integrability (understood as 4d-consistency) of a nonlinear difference equation defined by the…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

The Cayley-Hamilton-Newton identities which generalize both the characteristic identity and the Newton relations have been recently obtained for the algebras of the RTT-type. We extend this result to a wider class of algebras M(R,F) defined…

With the aim of derive a quasi-monomiality formulation in the context of discrete hypercomplex variables, one will amalgamate through a Clifford-algebraic structure of signature $(0,n)$ the umbral calculus framework with Lie-algebraic…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…

The R-matrix formalism for the construction of integrable systems with infinitely many degrees of freedom is reviewed. Its application to Poisson, noncommutative and loop algebras as well as central extension procedure are presented. The…