Related papers: Polynomials with and without determinantal represe…
The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
Assuming Schanuel's conjecture, we prove that any polynomial exponential equation in one variable must have a solution that is transcendental over a given finitely generated field. With the help of some recent results in Diophantine…
In the present paper we derive a new Hankel determinant representation for the square of the Vorob'ev-Yablonski polynomial $\mathcal{Q}_n(x),x\in\mathbb{C}$. These polynomials are the major ingredients in the construction of rational…
We derive identities for the determinants of matrices whose entries are (rising) powers of (products of) polynomials that satisfy a recurrence relation. In particular, these results cover the cases for Fibonacci polynomials, Lucas…
Given $H\subseteq \mathbb{C}$ two natural objects to study are the set of zeros of polynomials with coefficients in $H$, $$\{z\in \mathbb{C}: \exists k>0,\, \exists (a_n)\in H^{k+1}, \sum_{n=0}^{k}a_{n}z^n=0\},$$ and the set of zeros of…
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…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
In this article we study determinantal representations of adjoint hypersurfaces of polytopes. We prove that adjoint polynomials of all polygons can be represented as determinants of tridiagonal symmetric matrices of linear forms with the…
A form in a polynomial ring over a field is said to be homaloidal if its polar map is a Cremona map, i.e., if the rational map defined by the partial derivatives of the form has an inverse rational map. The object of this work is the search…
Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.
We study hyperbolic polynomials with nice symmetry and express them as the determinant of a Hermitian matrix with special structure. The goal of this paper is to answer a question posed by Chien and Nakazato in 2015. By properly modifying a…
The notion of root polynomials of a polynomial matrix $P(\lambda)$ was thoroughly studied in [F. Dopico and V. Noferini, Root polynomials and their role in the theory of matrix polynomials, Linear Algebra Appl. 584:37--78, 2020]. In this…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
Every linear, quadratic or cubic polynomial having all real zeros is the derivative of a polynomial having all real zeros. The statement is false for higher degree polynomials. In particular, not every fourth degree polynomial with real…
We prove that the Jacobian conjecture is false if and only if there exists a solution to a certain system of polynomial equations. We analyse the solution set of this system. In particular we prove that it is zero dimensional.
We prove that a non-degenerate simple linear recurrence sequence $ (G_n(x))_{n=0}^{\infty} $ of polynomials satisfying some further conditions cannot contain arbitrary large powers of polynomials if the order of the sequence is at least…
We consider a class of linear codes associated to projective algebraic varieties defined by the vanishing of minors of a fixed size of a generic matrix. It is seen that the resulting code has only a small number of distinct weights. The…
Any multilinear non-central polynomial $p$ (in several noncommuting variables) takes on values of degree $n$ in the matrix algebra $M_n(F)$ over an infinite field $F$. The polynomial $p$ is called {\it $\nu$-central} for $M_n(F)$ if $p^\nu$…
The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…