Normal and Triangular Determinantal Representations of Multivariate Polynomials
نویسنده
چکیده
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form i i i b x a , and in each column the same variable appears. We also apply the algorithm to obtain a triangular determinant representation, a reduced determinant representation, and a uniform determinant representation of any multivariable polynomial. The algorithm could be useful for obtaining representations of dimensions smaller than those available up to now to solve numerical problems.
منابع مشابه
Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملSymmetric Determinantal Representations in Characteristic 2
This paper studies Symmetric Determinantal Representations (SDR) in characteristic 2, that is the representation of a multivariate polynomial P by a symmetric matrix M such that P = det(M), and where each entry of M is either a constant or a variable. We first give some sufficient conditions for a polynomial to have an SDR. We then give a non-trivial necessary condition, which implies that some...
متن کاملPolynomials with and without Determinantal Representations
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov [9] have proved that any real zero polynomial in two variables has a determinantal representation. Brändén [2] has shown that the result does not extend to arbitrary numbers of variables, disproving the generalized Lax conjecture. We provide a ...
متن کاملDeterminantal Representations and the Hermite Matrix
We consider the problem of writing real polynomials as determinants of symmetric linear matrix polynomials. This problem of algebraic geometry, whose roots go back to the nineteenth century, has recently received new attention from the viewpoint of convex optimization. We relate the question to sums of squares decompositions of a certain Hermite matrix. If some power of a polynomial admits a de...
متن کاملDeterminantal Expression and Recursion for Jack Polynomials
We give matrices of which their determinants are the Jack polynomials expanded in terms of the monomial basis. The top row of this matrix is a list of monomial functions, the entries of the sub-diagonal are of the form −(rα + s), with r and s ∈ +, the entries above the sub-diagonal are nonnegative integers, and below all entries are 0. The quasi-triangular nature of this matrix gives a recursio...
متن کامل