Related papers: The Cullis' determinant as Pfaffian

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

In the following short paper we list some useful results concerning determinants and inverses of matrices. First we show, how to calculate determinants of $d \times d$ matrices, if their traces are known. As a next step $4 \times 4$…

Gaussian blur is a commonly-used method to filter image data. This paper introduces the collapsing sum, a new operator on matrices that provides a combinatorial interpretation of Gaussian blur. We study the combinatorial properties of this…

The aim of this paper is to show an estimate for the determinant of the covariance of a two-dimensional vector of multiple stochastic integrals of the same order in terms of a linear combination of the expectation of the determinant of its…

A theorem of Mina evaluates the determinant of a matrix with entries $D^j(f(x)^i)$. We note the important special case where the matrix entries are evaluated at $x=0$ and give a simple proof of it, and some applications. We then give a…

Given a matrix U, using a deterministic method, we extract a "large" submatrix of U'(whose columns are obtained by normalizing those of U) and estimate its smallest and largest singular value. We apply this result to the study of contact…

The fundamental matrix solution of the quantum Knizhnik-Zamolodchikov equation associated with quantum affine sl2 algebra is constructed for |q|=1. The formula for its determinant is given in terms of the double sine function.

The generalized sequence of numbers is defined by W_{n}=pW_{n-1}+qW_{n-2} with initial conditions W_{0}=a and W_{1}=b for a,b,p,q\inZ and n\geq2, respectively. Let W_{n}=circ(W_{1},W_{2},...,W_{n}). The aim of this paper is to establish…

We evaluate the determinant of a matrix whose entries are elliptic hypergeometric terms and whose form is reminiscent of Sylvester matrices. A hypergeometric determinant evaluation of a matrix of this type has appeared in the context of…

The computation of determinants plays a central role in diagrammatic Monte Carlo algorithms for strongly correlated systems. The evaluation of large numbers of determinants can often be the limiting computational factor determining the…

We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.

We study the maximum absolute value of the determinant of matrices with entries in the set of $\ell$-th roots of unity; this is a generalization of $D$-optimal designs and Hadamard's maximal determinant problem, which involves $\pm 1$…

In this paper we explore determinantal representations of multiaffine polynomials and consequences for the image of various spaces of matrices under the principal minor map. We show that a real multiaffine polynomial has a definite…

We derive analytic expressions for infinite products of random 2x2 matrices. The determinant of the target matrix is log-normally distributed, whereas the remainder is a surprisingly complicated function of a parameter characterizing the…

In this note, we present a systematic method to explicitly compute the determinants and inverses for some generalized Hilbert matrices associated with orthogonal systems with explicit representations. We expressed the determinant, the…

Let $f(x)\in\mathbb{Z}[x]$ be a nonconstant polynomial. Let $n, k$ and $c$ be integers such that $n\ge 1$ and $k\ge 2$. An integer $a$ is called an $f$-exunit in the ring $\mathbb{Z}_n$ of residue classes modulo $n$ if $\gcd(f(a),n)=1$. In…

Given a sheaf on a projective space P^n we define a sequence of canonical and easily computable Chow complexes on the Grassmannians of planes in P^n, generalizing the Beilinson monad on P^n. If the sheaf has dimension k, then the Chow form…

Cardinal's factorization algorithm of 1996 splits a univariate polynomial into two factors with root sets separated by the imaginary axis, which is an important goal itself and a basic step toward root-finding. The novelty of the algorithm…

Let $X$ be a projective variety (possibly singular) over an algebraically closed field of any characteristic and $\mathcal{F}$ be a coherent sheaf. In this article, we define the determinant of $\mathcal{F}$ such that it agrees with the…

A well-known problem in Malliavin calculus concerns the relation between the determinant of the Malliavin matrix of a random vector and the determinant of its covariance matrix. We give an explicit relation between these two determinants…