Related papers: A double Sylvester determinant

Generalizing work from the 1970s on the determinants of distance hypermatrices of trees, we consider the hyperdeterminants of order-$k$ Steiner distance hypermatrices of trees on $n$ vertices. We show that they can be nearly diagonalized as…

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…

We describe a class of matrices whose determinants are trivial to compute. A nice example of such a matrix is given by considering the symmetric matrix with entries {i+j choose i} (mod 2) in {0,1}, 0 <= i,j < n the binomial coefficients…

We compute the deterministic approximation for mixed fluctuation moments of products of deterministic matrices and general Sobolev functions of Wigner matrices. Restricting to polynomials, our formulas reproduce recent results of [Male,…

For a positive integer sequence $\boldsymbol{a}=(a_1, \dots, a_{N+1})$, Sylvester's denumerant $E(\boldsymbol{a}; t)$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N+1} a_i x_i = t$ for a nonnegative integer $t$. It has…

We are interested in matrices of minors of order p of a invertible matrix. Special cases are studied when this matrix is in SL(n) or SO(n)

An integer matrix $\mathbf{A}$ is $\Delta$-modular if the determinant of each $\text{rank}(\mathbf{A}) \times \text{rank}(\mathbf{A})$ submatrix of $\mathbf{A}$ has absolute value at most $\Delta$. The study of $\Delta$-modular matrices…

Let $A_1,\ldots,A_s$ be unitary commutative rings which do not have non-trivial idempotents and let $A=A_1\oplus\cdots\oplus A_s$ be their direct sum. We describe all idempotents in the $2\times 2$ matrix ring $M_2(A[[X]])$ over the ring…

Let $A$ be a set in a prime field $\mathbb{F}_p$. In this paper, we prove that $d\times d$ matrices with entries in $A$ determine almost $|A|^{3+\frac{1}{45}}$ distinct determinants and almost $|A|^{2-\frac{1}{6}}$ distinct permanents when…

Denominators of normalized $R$-matrices provide important information on finite dimensional representations over quantum affine algebras, and over quiver Hecke algebras by the generalized quantum affine Schur-Weyl duality functors. We…

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

Minimizer schemes, or just minimizers, are a very important computational primitive in sampling and sketching biological strings. Assuming a fixed alphabet of size $\sigma$, a minimizer is defined by two integers $k,w\ge2$ and a total order…

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 1853 J. Sylvester introduced a family of double sum expressions for two finite sets of indeterminates and showed that some members of the family are essentially the polynomial subresultants of the monic polynomials associated with these…

For bivariate polynomials of degree $n\le 5$ we give fast numerical constructions of determinantal representations with $n\times n$ matrices. Unlike some other available constructions, our approach returns matrices of the smallest possible…

Let $k[X] = k[x_{i,j}: i = 1,..., m; j = 1,..., n]$ be the polynomial ring in $m n$ variables $x_{i,j}$ over a field $k$ of arbitrary characteristic. Denote by $I_2(X)$ the ideal generated by the $2 \times 2$ minors of the generic $m \times…

A new algorithm is presented for computing the largest degree invariant factor of the Sylvester matrix (with respect either to $x$ or $y$) associated to two polynomials $a$ and $b$ in $\mathbb F_q[x,y]$ which have no non-trivial common…

We give a short and elementary proof of a theorem of Procesi, Schacher and (independently) Gondard, Ribenboim that generalizes a famous result of Artin. Let $A$ be an $n \times n$ symmetric matrix with entries in the polynomial ring…

We compute hyperdeterminants of hypermatrices whose indices belongs in a meet-semilattice and whose entries depend only of the greatest lower bound of the indices. One shows that an elementary expansion of such a polynomial allows to…

Given polynomials a(z) of degree m and b(z) of degree n, we represent the inverse to the Sylvester resultant matrix of a(z) and b(z), if this inverse exists, as a canonical sum of m+n dyadic matrices each of which is a rational function of…