Related papers: The characteristic polynomial of a random matrix

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We show that the averaged characteristic polynomial and the averaged inverse characteristic polynomial, associated with Hermitian matrices whose elements perform a random walk in the space of complex numbers, satisfy certain partial…

We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…

We give a dimension bound on the irreducible components of the characteristic variety of a system of linear partial differential equations defined from a suitable filtration of the Weyl algebra $A_{n}(k)$. This generalizes an important…

In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning, and affine transformations preserve the matrix Gaussian…

We compute correlation functions of inverse powers and ratios of characteristic polynomials for random matrix models with complex eigenvalues. Compact expressions are given in terms of orthogonal polynomials in the complex plane as well as…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

We calculate the average of two characteristic polynomials for the real Ginibre ensemble of asymmetric random matrices, and its chiral counterpart. Considered as quadratic forms they determine a skew-symmetric kernel from which all complex…

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

We consider n by n real matrices whose entries are non-degenerate random variables that are independent but non necessarily identically distributed, and show that the probability that such a matrix is singular is O(1/sqrt{n}). The purpose…

In this paper, we consider the condition when the characteristic polynomials of the Seidel matrix of the graphs are decomposed into products of linear polynomials over $\mathbb{F}_3$. We also show the equality over $\mathbb{F}_3$ between…

We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…

We obtain an asymptotic expansion for $p(n)$, the number of partitions of a natural number $n$, starting from a formula that relates its generating function $f(t), t\in (0,1)$ with the characteristic functions of a family of sums of…

We present a simple randomized polynomial time algorithm to approximate the mixed discriminant of $n$ positive semidefinite $n \times n$ matrices within a factor $2^{O(n)}$. Consequently, the algorithm allows us to approximate in randomized…

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Let $\F_q$ be a finite field of characteristic $p>0$. We prove that, given $F(t,x)\in \F_q[t][x]$ an irreducible separable monic polynomial in the variable $x$ and a generic monic polynomial $\phi(t)$ in the variable $t$, the polynomial…

In this short note, we give a new sufficient condition for a linear map from a product of copies of a field to endomorphisms of a finite dimensional vector space over the same field to be an algebra homomorphism. We expect that this result…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…