Related papers: The characteristic polynomial of a random matrix

We calculate the discrete moments of the characteristic polynomial of a random unitary matrix, evaluated a small distance away from an eigenangle. Such results allow us to make conjectures about similar moments for the Riemann zeta…

We consider the algebra of invariants of $d$-tuples of $n\times n$ matrices under the action of the orthogonal group by simultaneous conjugation over an infinite field of characteristic $p$ different from two. It is well-known that this…

We compute the average characteristic polynomial of the hermitised product of $M$ real or complex Wigner matrices of size $N\times N$ and the average of the characteristic polynomial of a product of $M$ such Wigner matrices times the…

Linear statistics, a random variable build out of the sum of the evaluation of functions at the eigenvalues of a N times N random matrix,sum[j=1 to N]f(xj) or tr f(M), is an ubiquitous statistical characteristics in random matrix theory.…

In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…

Let L be a restricted Lie superalgebra with its restricted enveloping algebra u(L) over a field F of characteristic p>2. A polynomial identity is called non-matrix if it is not satisfied by the algebra of 2\times 2 matrices over F. We…

We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…

We say that a polynomial automorphism $\phi $ in $n$ variables is stably co-tame if the tame subgroup in $n$ variables is contained in the subgroup generated by $\phi $ and affine automorphisms in $n+1$ variables. In this paper, we give…

For an algebraically closed field $K$ of characteristic zero and a non-singular matrix $A\in \mbox{GL}_n(K)$, a semi-invariant polynomial of $A$ is defined to be a polynomial $p(x)=p(x_1,\dots,x_n)$ with coefficients in $K$ such that…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

We consider a tuple $\Phi = (\phi_1,\ldots,\phi_m)$ of commuting maps on a finitary matroid $X$. We show that if $\Phi$ satisfies certain conditions, then for any finite set $A\subseteq X$, the rank of $\{\phi_1^{r_1}\cdots\phi_m^{r_m}(a):a…

Let $A_n$ be the sum of $d$ permutation matrices of size $n\times n$, each drawn uniformly at random and independently. We prove that the normalized characteristic polynomial $\frac{1}{\sqrt{d}}\det(I_n - z A_n/\sqrt{d})$ converges when…

Let $F$ be a field of prime characteristic $p$ containing $F_{p^n}$ as a subfield. We refer to $q(X)=X^{p^n}-X-a\in F[X]$ as a generalized Artin-Schreier polynomial. Suppose that $q(X)$ is irreducible and let $C_{q(X)}$ be the companion…

This note presents some equalities in law for $Z_N:=\det(\Id-G)$, where $G$ is an element of a subgroup of the set of unitary matrices of size $N$, endowed with its unique probability Haar measure. Indeed, under some general conditions,…

We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…

Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…

Assume that the Riemann hypothesis holds for Dedekind zeta functions. Under this assumption, we prove that a degree $d$ polynomial with random multiplicative $\pm1$ coefficients is irreducible in $\mathbb{Z}[x]$ with probability…

We investigate the second-order correlation function of the characteristic polynomial of a sample covariance matrix. Starting from an explicit formula for the generating function, we re-obtain several well-known kernels from random matrix…

Let f be a polynomial in two complex variables. We say that f is nearly irreducible if any two nonconstant polynomial factors of f have a common zero. In the paper we give a criterion of nearly irreducibility for a given polynomial f in…

We provide necessary and sufficient conditions on the characteristics of an infinitely divisible distribution under which its characteristic function $\phi$ decays polynomially. Under a mild regularity condition this polynomial decay is…