Related papers: Definite Determinantal Representations via Orthost…

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 study the complexity of algorithmic problems for matrices that are represented by multi-terminal decision diagrams (MTDD). These are a variant of ordered decision diagrams, where the terminal nodes are labeled with arbitrary elements of…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…

This article proposes a bivariate polynomial problem for finite-order real matrices that endows a \textit{`sufficient condition'} for a map from the standard vector spaces of finite-order real matrices to the same dimensional bivariate…

We determine the Poincar\'e polynomial of the determinantal variety $\{\det = 0\}$ in the projective space associated with the monoid of $n\times n$ matrices.

In this article we extend the notion of determinantal representation of hypersurfaces to the determinantal representation of sections of the determinant line bundle of a vector bundle. We give several examples, and prove some necessary…

It is known that determinantal point processes have an intimate relation to operator algebras. In the paper, we extend this relationship to encompass dynamical aspects. Especially, we delve into two types of determinantal point processes.…

Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…

In this paper, a fourth-order partial divided-difference equation on quadratic lattices with polynomial coefficients satisfied by bivariate Racah polynomials is presented. From this equation we obtain explicitly the matrix coefficients…

Hyperbolic homogeneous polynomials with real coefficients, i.e., hyperbolic real projective hypersurfaces, and their determinantal representations, play a key role in the emerging field of convex algebraic geometry. In this paper we…

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the…

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper…

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

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…

In order to verify programs or hybrid systems, one often needs to prove that certain formulas are unsatisfiable. In this paper, we consider conjunctions of polynomial inequalities over the reals. Classical algorithms for deciding these not…

A (global) determinantal representation of hypersurface in P^n is a matrix, whose entries are linear forms in homogeneous coordinates and whose determinant defines the hypersurface. We study the properties of such representations for…

We discuss several conjectures about the real-rootedness of polynomials whose coefficients are determinants of coefficients of a real-rooted polynomial. We also consider some questions about matrices generalizing totally positive matrices,…