Related papers: A new determinantal formula for the classical disc…
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
In this paper, a matrix representation for the differential resultant of two generic ordinary differential polynomials $f_1$ and $f_2$ in the differential indeterminate $y$ with order one and arbitrary degree is given. That is, a…
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 show that for any permutation $w$ that avoids a certain set of 13 patterns of lengths 5 and 6, the Schubert polynomial $\mathfrak S_w$ can be expressed as the determinant of a matrix of elementary symmetric polynomials in a manner…
This work is entirely devoted to construct huge families of indecomposable arithmetically Cohen-Macaulay (resp. Ulrich) sheaves E of arbitrary high rank on a general standard (resp. linear) determinantal scheme X\subset \PP^n of codimension…
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct…
The spectral density for random matrix $\beta$ ensembles can be written in terms of the average of the absolute value of the characteristic polynomial raised to the power of $\beta$, which for even $\beta$ is a polynomial of degree…
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 consider the problem of complex root classification, i.e., finding the conditions on the coefficients of a univariate polynomial for all possible multiplicity structures on its complex roots. It is well known that such conditions can be…
We present explicit formulas for the Macdonald polynomials of types $C_n$ and $D_n$ in the one-row case. In view of the combinatorial structure, we call them "tableau formulas". For the construction of the tableau formulas, we apply some…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
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 define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…
A class of self-inversive polynomials includes all the self-reciprocal polynomials. Let A denote the set of all self-reciprocal polynomials with n+1 coefficients. Let B denote the set of certain self-inversive and non self-reciprocal…
One of the aims of this paper is to provide a short survey on the Z2-graded, the symmetric and the left (right) generalizations of the classical determinant theory for square matrices with entries in an arbitrary (possibly non-commutative)…
Determinantal polynomials play a crucial role in semidefinite programming problems. Helton-Vinnikov proved that real zero (RZ) bivariate polynomials are determinantal. However, it leads to a challenging problem to compute such a…
From the irreducible decompositions' point of view, the structure of the cyclic $GL_n$-module generated by the $\alpha$-determinant degenerates when $\alpha=\pm \frac1k (1\leq k\leq n-1)$. In this paper, we show that $-\frac1k$-determinant…
Given a nonsingular $n \times n$ matrix of univariate polynomials over a field $\mathbb{K}$, we give fast and deterministic algorithms to compute its determinant and its Hermite normal form. Our algorithms use…
Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…
This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…