Related papers: A Complete Characterization of Determinantal Quadr…

We show that for every pair of matrices (S,P), having the closed symmetrized bidisc $\Gamma$ as a spectral set, there is a one dimensional complex algebraic variety $\Lambda$ in $\Gamma$ such that for every matrix valued polynomial f, the…

Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…

We introduce and study the notion of read-$k$ projections of the determinant: a polynomial $f \in \mathbb{F}[x_1, \ldots, x_n]$ is called a {\it read-$k$ projection of determinant} if $f=det(M)$, where entries of matrix $M$ are either field…

This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…

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…

We define the non-commutative multiple bi-orthogonal polynomial systems, which simultaneously generalize the concepts of multiple orthogonality, matrix orthogonal polynomials and of the bi-orthogonality. We present quasideterminantal…

We compute all massive partition functions or characteristic polynomials and their complex eigenvalue correlation functions for non-Hermitean extensions of the symplectic and chiral symplectic ensemble of random matrices. Our results are…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We give two determinantal representations for a bivariate polynomial. They may be used to compute the zeros of a system of two of these polynomials via the eigenvalues of a two-parameter eigenvalue problem. The first determinantal…

Barvinok introduced the symmetrized determinant ($\sdet$) as a \emph{non-commutative} analogue of the determinant. Intuitively, given a square matrix over an associative algebra, we can obtain the symmetrized determinant by averaging over…

We estimate the number of primes represented by a general quadratic polynomial with discriminant $\Delta$, assuming that the corresponding real character is exceptional.

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

We will show that the roots of a polynomial equation in one variable of degree n are related to the solutions of a symmetric quadratic form in n-1 variables with constant positive integer coefficients. The classic polynomial notation will…

Symmetric polynomials of the roots of a polynomial can be written as polynomials of the coefficients, and by applying this to the characteristic polynomial we can write a symmetric polynomial of the eigenvalues $a_{i}$ of an $n\times n$…

Building on the classification of all characteristic polynomials of integer symmetric matrices having small span (span less than 4), we obtain a classification of small-span polynomials that are the characteristic polynomial of a Hermitian…

A hypersurface $H$ in $\mathbb{P}^r$ of degree $n$ is called determinantal if it is the zero locus of a polynomial of the form $\operatorname{det}(x_0 A_0 + \ldots + x_r A_r)$ for some $(r+1)$-tuple of $n \times n$ matrices $A = (A_0,…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…

The characteristic polynomial of an $r$-tuple $(A_1,..., A_r)$ of $n \times n$ matrices is the determinant $\det(x_0 I + x_1 A_1 + ... + x_r A_r)$. We show that if $r$ is at least 3 and $A = (A_1,..., A_r)$ is an $r$-tuple of matrices in…

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…

The entropic discriminant is a non-negative polynomial associated to a matrix. It arises in contexts ranging from statistics and linear programming to singularity theory and algebraic geometry. It describes the complex branch locus of the…