Related papers: Transformations of polynomial ensembles
The exponential of an NxN matrix can always be expressed as a matrix polynomial of order N-1. In particular, a general group element for the fundamental representation of SU(N) can be expressed as a matrix polynomial of order N-1 in a…
Probabilistic image registration methods estimate the posterior distribution of transformation. The conventional way of interpreting the transformation posterior is to use the mode as the most likely transformation and assign its…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
We introduce a family of polynomials, which arise in three distinct ways: in the large $N$ expansion of a matrix integral, as a weighted enumeration of factorisations of permutations, and via the topological recursion. More explicitly, we…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
A density operator, $\rho = {P}_{\alpha } |\alpha > <\alpha | + {P}_{\beta } |\beta > <\beta |$, with ${P}_{\alpha }$ and ${P}_{\beta }$ linearly independent normalized wave functions, must be traced normalized, so ${P}_{\beta } = 1 -…
The diagonalization of Hermitian supermatrices is studied. Such a change of coordinates is inevitable to find certain structures in random matrix theory. However it still poses serious problems since up to now the calculation of all…
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…
Several new transformations for q-binomial coefficients are found, which have the special feature that the kernel is a polynomial with nonnegative coefficients. By studying the group-like properties of these positivity preserving…
We consider an ensemble of self-dual matrices with arbitrary complex entries. This ensemble is closely related to a previously defined ensemble of anti-symmetric matrices with arbitrary complex entries. We study the two-level correlation…
We study sampling algorithms for $\beta$-ensembles with time complexity less than cubic in the cardinality of the ensemble. Following Dumitriu & Edelman (2002), we see the ensemble as the eigenvalues of a random tridiagonal matrix, namely a…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We propose a technique for calculating and understanding the eigenvalue distribution of sums of random matrices from the known distribution of the summands. The exact problem is formidably hard. One extreme approximation to the true density…
A random matrix ensemble incorporating both GUE and Poisson level statistics while respecting $U(N)$ invariance is proposed and shown to be equivalent to a system of noninteracting, confined, one dimensional fermions at finite temperature.
The most general evolution of the density matrix of a quantum system with a finite-dimensional state space is by stochastic maps which take a density matrix linearly into the set of density matrices. These dynamical stochastic maps form a…
Packing density is a permutation occurrence statistic which describes the maximal number of permutations of a given type that can occur in another permutation. In this article we focus on containment of sets of permutations. Although this…
Partial compositeness is a mechanism for the generation of fermion masses which replaces a direct Higgs coupling to the fermions by a linear mixing with heavy composite partners. We present the first calculation of the relevant matrix…
Gaussian and Chiral Beta-Ensembles, which generalise well known orthogonal (Beta=1), unitary (Beta=2), and symplectic (Beta=4) ensembles of random Hermitian matrices, are considered. Averages are shown to satisfy duality relations like…
In this article, we consider $\beta$-ensembles, i.e. collections of particles with random positions on the real line having joint distribution $$\frac{1}{Z_N(\beta)}|\Delta(\lambda)|^\beta e^{- \frac{N\beta}{4}\sum_{i=1}^N\lambda_i^2}d…
Skew orthogonal polynomials arise in the calculation of the $n$-point distribution function for the eigenvalues of ensembles of random matrices with orthogonal or symplectic symmetry. In particular, the distribution functions are completely…