Related papers: On determinants of random symmetric matrices over …

This paper presents a method for expressing the determinant of an N {\times} N complex block matrix in terms of its constituent blocks. The result allows one to reduce the determinant of a matrix with N^2 blocks to the product of the…

Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…

Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this…

We show that positivity on $\mathbb{R}_+^n$ and on $\mathbb{R}^n$ of real symmetric polynomials of degree at most $p$ in $n\ge2$ variables is solvable by algorithms running in $\mathrm{poly}(n)$ time. For real symmetric quartics, we find…

We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…

In this paper we generalize the notion of discriminant for symmetric matrices and some results about it to the case of symmetric spaces.

For non-negative integers $r$ and $m$, let $S_m^{(r)}(n)$ denote the $r$-fold summation (or hyper-sum) over the first $n$ positive integers to the $m$th powers, with the initial condition $S_m^{(0)}(n) =n^m$. In this paper, we derive a new…

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…

We consider random symmetric matrices with independent entries distributed according to the Haar measure on $\mathbb{Z}_p$ for odd primes $p$ and derive the distribution of their canonical form with respect to several equivalence relations.…

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…

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

We consider the logarithm of the characteristic polynomial of random permutation matrices, evaluated on a finite set of different points. The permutations are chosen with respect to the Ewens distribution on the symmetric group. We show…

The determinant of an $N \times N$ circulant matrix $M = {\rm CIRC}[x_0, x_1, ..., x_{N-1}$] can be expanded in the form det$ ~M= \sum C_{a_0 a_1 ...a_{N-1}} x_{a_0} x_{a_1}...x_{a_{N-1}}$. By using the generating function of a restricted,…

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

With $\{X_i\}$ independent $N \times N$ standard Gaussian random matrices, the probability $p_{N,N}^{P_m}$ that all eigenvalues are real for the matrix product $P_m = X_m X_{m-1} \cdots X_1$ is expressed in terms of an $N/2 \times N/2$ ($N$…

In this paper, we are going to calculate the determinant of a certain type of square matrices, which are related to the well-known Cauchy and Toeplitz matrices. Then, we will use the results to determine the rank of special non-square…

Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…

We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…

Consider an nxn random matrix X with i.i.d. nonnegative entries with bounded density, mean m, and finite positive variance sigma^2. Let M be the nxn random Markov matrix with i.i.d. rows obtained from X by dividing each row of X by its sum.…

Consider a random matrix $H:\mathbb{R}^n\longrightarrow\mathbb{R}^m$. Let $D\geq2$ and let $\{W_l\}_{l=1}^{p}$ be a set of $k$-dimensional affine subspaces of $\mathbb{R}^n$. We ask what is the probability that for all $1\leq l\leq p$ and…