Related papers: Derivative moments for characteristic polynomials …
Using the character expansion method, we generalize several well-known integrals over the unitary group to the case where general complex matrices appear in the integrand. These integrals are of interest in the theory of random matrices and…
In the present work we show that the joint probability distribution of the eigenvalues can be expressed in terms of a differential operator acting on the distribution of some other matrix quantities. Those quantities might be the diagonal…
We calculate a general spectral correlation function of products and ratios of characteristic polynomials for a $N\times N$ random matrix taken from the chiral Gaussian Unitary Ensemble (chGUE). Our derivation is based upon finding an…
For random matrix ensembles with unitary symmetry, there is interest in the large $N$ form of the moments of the absolute value of the characteristic polynomial for their relevance to the Riemann zeta function on the critical line, and to…
In this work we provide a novel approach for computing the coefficients of the characteristic polynomial of a square matrix. We demonstrate that each coefficient can be efficiently represented by a set of circle graphs. Thus, one can employ…
We apply the operation of random independent thinning on the eigenvalues of $n\times n$ Haar distributed unitary random matrices. We study gap probabilities for the thinned eigenvalues, and we study the statistics of the eigenvalues of…
Exponential distributions appear in a wide range of applications including chemistry, nuclear physics, time series analyses, and stock market trends. There are conceivable circumstances in which one would be interested in the cumulative…
We consider the moment space $\mathcal{M}_n^{K}$ corresponding to $p \times p$ complex matrix measures defined on $K$ ($K=[0,1]$ or $K=\D$). We endow this set with the uniform law. We are mainly interested in large deviations principles…
Explicit expressions are proven for derivatives of the ratio of a determinant or Pfaffian determinant and a Vandermonde determinant. Such ratios appear for example in general group integrals of Harish-Chandra--Itzykson--Zuber type and in…
In a recent article, the class of functions from the integers to the integers computable in polynomial time has been characterized using discrete ordinary differential equations (ODE), also known as finite differences. Doing so, we pointed…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…
We investigate certain matrices composed of mixed, second-order moments of unitaries. The unitaries are taken from C*-algebras with moments taken with respect to traces, or, alternatively, from matrix algebras with the usual trace. These…
We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…
We provide a combinatorial derivation of an asymptotic formula for averages of mixed ratios of characteristic polynomials over the unitary group, where mixed ratios are products of ratios and/or logarithmic derivatives. Our proof of this…
This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…
We consider asymptotics of ratios of random characteristic polynomials associated with orthogonal polynomial ensembles. Under some natural conditions on the measure in the definition of the orthogonal polynomial ensemble we establish a…
A new method involving particle diagrams is introduced and developed into a rigorous framework for carrying out embedded random matrix calculations. Using particle diagrams and the attendant methodology including loop counting it becomes…
A family of random variables $\mathbf{X}(s)$, depending on a real parameter $s>-\frac{1}{2}$, appears in the asymptotics of the joint moments of characteristic polynomials of random unitary matrices and their derivatives, in the ergodic…
Given a uniform ensemble of quantum density matrices $\rho$, it is useful to calculate the mean value over this ensemble of a product of entries of $\rho$. We show how to calculate such moments in this paper. The answer involves well known…