Related papers: Supplement to the article "irreducible polynomials…
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…
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.
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
A question of Bergman asks whether the adjoint of the generic square matrix over a field can be factored nontrivially as a product of square matrices. We show that such factorizations indeed exist over any coefficient ring when the matrix…
A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…
In this paper, we study the complexity of computing the determinant of a matrix over a non-commutative algebra. In particular, we ask the question, "over which algebras, is the determinant easier to compute than the permanent?" Towards…
We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…
We prove the conjecture about the probability that Pn of Bernulli +- 1 square matrix to be singular and asymptotic expansion of Pn.
This is a complement to our paper arXiv:0802.1461. We study irreducibility of spectral determinants of some one-parametric eigenvalue problems in dimension one with polynomial potentials.
The determinant for complex matrices cannot be extended to quaternionic matrices. Instead, the Study determinant and the closely related $q$-determinant are widely used. We show that the Study determinant can be characterized as the unique…
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 study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…
The set of real matrices of upper-bounded rank is a real algebraic variety called the real generic determinantal variety. An explicit description of the tangent cone to that variety is given in Theorem 3.2 of Schneider and Uschmajew [SIAM…
We consider a square random matrix of size $N$ of the form $P(Y,A)$ where $P$ is a noncommutative polynomial, $A$ is a tuple of deterministic matrices converging in $\ast$-distribution, when $N$ goes to infinity, towards a tuple $a$ in some…
This article studies the scheme structure of the jet schemes of determinantal varieties. We show that in general, these jet schemes are not irreducible. In the case of the determinantal variety $X$ of $r \times s$ matrices of rank at most…
We prove that hypersurfaces defined by irreducible square-free polynomials have rational singularities. As an easy consequence, we deduce that certain (possibly non-square-free) polynomials associated to pairs of square-free polynomials…
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,…
We survey recent results on determinantal processes, random growth, random tilings and their relation to random matrix theory.
We show that the existence of $\{\pm 1\}$-matrices having largest possible determinant is equivalent to the existence of certain tournament matrices. In particular, we prove a recent conjecture of Armario. We also show that large…
We prove that the Cayley-Menger determinant of an $n$-dimensional simplex is an absolutely irreducible polynomial for $n\geq3.$ We also study the irreducibility of polynomials associated to related geometric constructions.