Related papers: Norm-constrained determinantal representations of …

We show that an irreducible polynomial $p$ with no zeros on the closure of a matrix unit polyball, a.k.a. a cartesian product of Cartan domains of type I, and such that $p(0)=1$, admits a strictly contractive determinantal representation,…

We show that for a multivariable polynomial $p(z)=p(z_1, \ldots , z_d)$ with a determinantal representation $$ p(z) = p(0) \det (I_n- K (\oplus_{j=1}^d z_j I_{n_j}))$$ the matrix $K$ is structurally similar to a strictly $J$-contractive…

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 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…

We prove that every matrix-valued rational function $F$, which is regular on the closure of a bounded domain $\mathcal{D}_\mathbf{P}$ in $\mathbb{C}^d$ and which has the associated Agler norm strictly less than 1, admits a…

Given a proper cone $K \subseteq \mathbb{R}^n$, a multivariate polynomial $f \in \mathbb{C}[z] = \mathbb{C}[z_1, \ldots, z_n]$ is called $K$-stable if it does not have a root whose vector of the imaginary parts is contained in the interior…

We call a multivariable polynomial an Agler denominator if it is the denominator of a rational inner function in the Schur-Agler class, an important subclass of the bounded analytic functions on the polydisk. We give a necessary and…

We provide a short proof of the theorem that every real multivariate polynomial has a symmetric determinantal representation, which was first proved in J. W. Helton, S. A. McCullough, and V. Vinnikov, Noncommutative convexity arises from…

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

Let D be a domain with quotient field K and A a D-algebra. We call a polynomial with coefficients in K that maps every element of A to an element of A "integer-valued on A". For commutative A we also consider integer-valued polynomials in…

Given a polynomial P of partial derivatives of the Kahler metric, expressed as a linear combination of directed multigraphs, we prove a simple criterion in terms of the coefficients for $P$ to be an invariant polynomial, i.e. invariant…

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…

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 , and in each column the same variable appears. We also apply the algorithm to obtain a…

We introduce certain quiver analogue of the determinantal variety. We study the Kempf-Lascoux-Weyman's complex associated to a line bundle on the variety. In the case of generalized Kronecker quivers, we give a sufficient condition on when…

The problem of expressing a multivariate polynomial as the determinant of a monic (definite) symmetric or Hermitian linear matrix polynomial (LMP) has drawn a huge amount of attention due to its connection with optimization problems. In…

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…

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 =…

In this paper, we consider the problem of representing a multivariate polynomial as the determinant of a definite (monic) symmetric/Hermitian linear matrix polynomial (LMP). Such a polynomial is known as determinantal polynomial.…

The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…

Every polynomial of the form $P=(x+1)(x^{n-1}+c_1x^{n-2}+\cdots +c_{n-1})$ is representable as Schur-Szeg\H{o} composition of $n-1$ polynomials of the form $(x+1)^{n-1}(x+a_i)$, where the numbers $a_i$ are unique up to permutation. We give…