Related papers: Polynomial relations among principal minors of a 4…
The algebraic relations between the principal minors of an $n\times n$ matrix are somewhat mysterious, see e.g. [lin-sturmfels]. We show, however, that by adding in certain \emph{almost} principal minors, the relations are generated by a…
The principal minors of a symmetric $n{\times}n$-matrix form a vector of length $2^n$. We characterize these vectors in terms of algebraic equations derived from the $ 2{\times}2{\times}2$-hyperdeterminant.
All matrices we consider have entries in a fixed algebraically closed field $K$. A minor of a square matrix is principal means it is defined by the same row and column indices. We study the ideal generated by size $t$ principal minors of a…
A minor is principal means it is defined by the same row and column indices. Let $X$ be a square generic matrix, $K[X]$ the polynomial ring in entries of $X$, over an algebraically closed field, $K$. For fixed $t\leq n$, let $\mathfrak P_t$…
The variety of principal minors of $n\times n$ symmetric matrices, denoted $Z_{n}$, is invariant under the action of a group $G\subset \GL(2^{n})$ isomorphic to $\G$. We describe an irreducible $G$-module of degree $4$ polynomials…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
It is well known that the bivariate polynomial interpolation problem at domain points of a triangle is correct. Thus the corresponding interpolation matrix $M$ is nonsingular. L.L. Schumaker stated the conjecture, that the determinant of…
We show that if $A$ is an $n\times n$-matrix, then the diagonal entries of each power $A^{m}$ are uniquely determined by the principal minors of $A$, and can be written as universal (integral) polynomials in the latter. Furthermore, if the…
This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…
In polarization optics, an important role play Mueller matrices -- real four-dimensional matrices which describe the effect of action of optical elements on the polarization state of the light, described by 4-dimensional Stokes vectors. An…
Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…
This note presents explicit formulae for the exponentials of a wide variety of matrices which are 4x4, anti-Hermitian. Easily verifiable conditions characterizing when such matrices admit one of three minimal polynomials are also given.…
Formanek made the conjecture that the minimal degree of the central polynomials for the $n\times n$ matrix algebra over a field of characteristic 0 is $(n^2+3n-2)/2$ and this is true for $n\leq 3$. For $n=4$ there are examples of central…
Over a field K of characteristic 0, we study the algebra of invariants of the general linear group GL(4,K) acting by simultaneous conjugation on two matrices of order 4. It coincides with the trace algebra generated by all traces of…
The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…
It is well-known that the Pl\"ucker relations generate the ideal of relations of the maximal minors of a generic matrix. In this paper we discuss the relations between minors of a (non-maximal) fixed size. We will exhibit minimal relations…