Related papers: Minimal determinantal representations of bivariate…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
A method for computing global minima of real multivariate polynomials based on semidefinite programming was developed by N. Z. Shor, J. B. Lasserre and P. A. Parrilo. The aim of this article is to extend a variant of their method to…
Artin solved Hilbert's 17th problem, proving that a real polynomial in $n$ variables that is positive semidefinite is a sum of squares of rational functions, and Pfister showed that only $2^n$ squares are needed. In this paper, we…
In this work, the determinants of matrices constructed by evaluating homogeneous bivariate polynomials at pairs of vectors are investigated. For a polynomial $p(x,y)=\sum\limits_{i=0}^k \alpha_i x^{k-i}y^i$, an explicit factorization of the…
In 1978, Frost and Storey asserted that a bivariate polynomial matrix is equivalent to its Smith normal form if and only if the reduced minors of all orders generate the unit ideal. In this paper, we first demonstrate by constructing an…
It is proved that the discriminant of $n\times n$ real symmetric matrices can be written as a sum of squares, where the number of summands equals the dimension of the space of $n$-variable spherical harmonics of degree $n$. The…
Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…
For every bivariate polynomial $p(z_1, z_2)$ of bidegree $(n_1, n_2)$, with $p(0,0)=1$, which has no zeros in the open unit bidisk, we construct a determinantal representation of the form $$p(z_1,z_2)=\det (I - K Z),$$ where $Z$ is an…
The image of the principal minor map for n x n-matrices is shown to be closed. In the 19th century, Nansen and Muir studied the implicitization problem of finding all relations among principal minors when n=4. We complete their partial…
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…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…
Using a sums of squares formula for two variable polynomials with no zeros on the bidisk, we are able to give a new proof of a representation for distinguished varieties. For distinguished varieties with no singularities on the two-torus,…
A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
We prove that for writing the 3 by 3 permanent polynomial as a determinant of a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7 matrix is required. Our proof is computer based and uses the enumeration of bipartite…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
A homogeneous polynomial S(x_1, ..., x_n) of degree r in n variables posesses a discriminant D_{n|r}(S), which vanishes if and only if the system of equations dS/dx_i = 0 has non-trivial solutions. We give an explicit formula for…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
In 2005, Boman et al introduced the concept of factor width for a real symmetric positive semidefinite matrix. This is the smallest positive integer $k$ for which the matrix $A$ can be written as $A=VV^T$ with each column of $V$ containing…