Related papers: Hyperdeterminants of Polynomials

This is a complement to our paper arXiv:0802.1461. We study irreducibility of spectral determinants of some one-parametric eigenvalue problems in dimension one with polynomial potentials.

A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices,…

We show that for every smooth hyperbolic polynomial h there is another hyperbolic polynomial q such that qh has a definite determinantal representation. This is proved by considering sum-of-squares decompositions of certain bilinear forms…

We prove a generalization of the Hermitian version of the Helton-Vinnikov determinantal representation of hyperbolic polynomials to the class of semi-hyperbolic polynomials, a strictly larger class, as shown by an example. We also prove…

We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

We attempt to get a polynomial solution to the inverse problem, that is, to determine the form of the mechanical Hamiltonian when given the energy spectrum and transition dipole moment matrix. Our approach is to determine the potential in…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…

We show that each member of a doubly infinite sequence of highly nonlinear expressions of Bernoulli polynomials, which can be seen as linear combinations of certain higher-order convolutions, is a multiple of a specific product of linear…

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

We give algorithms to compute decompositions of a given polynomial, or more generally mixed tensor, as sum of rank one tensors, and to establish whether such a decomposition is unique. In particular, we present methods to compute the…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

A symmetric tensor, which has a symmetric nonnegative decomposition, is called a completely positive tensor. We consider the completely positive tensor decomposition problem. A semidefinite algorithm is presented for checking whether a…

We prove an interesting identity for the sum of determinants, which is a generalization of the sum of a geometric progression. The proof is quite long and a number of other identities are proved along the way. Some of the more elementary…

Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.

Several determinants with gamma functions as elements are evaluated. This kind of determinants are encountered in the computation of the probability density of the determinant of random matrices. The s-shifted factorial is defined as a…

Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…