Related papers: Transformations of polynomial ensembles
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…
The real Ginibre ensemble consists of random $N \times N$ matrices formed from i.i.d. standard Gaussian entries. By using the method of skew orthogonal polynomials, the general $n$-point correlations for the real eigenvalues, and for the…
We investigate spectral properties of a Hermitised random matrix product which, contrary to previous product ensembles, allows for eigenvalues on the full real line. We prove that the eigenvalues form a bi-orthogonal ensemble, which reduces…
We study the characteristic polynomial $p_{n}(x)=\prod_{j=1}^{n}(|z_{j}|-x)$ where the $z_{j}$ are drawn from the Mittag-Leffler ensemble, i.e. a two-dimensional determinantal point process which generalizes the Ginibre point process. We…
A generalisation of the Ginibre ensemble of non-Hermitian random square matrices is introduced. The corresponding probability measure is induced by the ensemble of rectangular Gaussian matrices via a quadratisation procedure. We derive the…
We introduce a non-Hermitian $\beta$-ensemble and determine its spectral density in the limit of large $\beta$ and large matrix size $n$. The ensemble is given by a general tridiagonal complex random matrix of normal and chi-distributed…
Ensembles of complex symmetric, and complex self dual random matrices are known to exhibit local statistical properties distinct from those of the non-Hermitian Ginibre ensembles. On the other hand, in distinction to the latter, the joint…
We describe an algorithm, implemented in Python, which can enumerate any permutation class with polynomial enumeration from a structural description of the class. In particular, this allows us to find formulas for the number of permutations…
We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…
Multiple orthogonal polynomials are a generalization of orthogonal polynomials in which the orthogonality is distributed among a number of orthogonality weights. They appear in random matrix theory in the form of special determinantal point…
We introduce constellation ensembles, in which charged particles on a line (or circle) are linked with charged particles on parallel lines (or concentric circles). We present formulas for the partition functions of these ensembles in terms…
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
According to the classification scheme of the generalized random matrix ensembles, we present various kinds of concrete examples of the generalized ensemble, and derive their joint density functions in an unified way by one simple formula…
Very recently, we have shown how the harmonic analysis approach can be modified to deal with products of general Hermitian and complex random matrices at finite matrix dimension. In the present work, we consider the particular product of a…
The symmetry properties under permutation of tomograms representing the states of a system of identical particles are studied. Starting from the action of the permutation group on the density matrix we define its action on the tomographic…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
In the present context, superintegrability is a property of certain probability density functions coming from matrix models, which relates to the average over a distinguished basis of symmetric functions, typically the Jack or Macdonald…
An ensemble of 2 x 2 pseudo-Hermitian random matrices is constructed that possesses real eigenvalues with level-spacing distribution exactly as for the Gaussian Unitary Ensemble found by Wigner. By a re-interpretation of Connes' spectral…
We introduce the first random matrix model of a complex $\beta$-ensemble. The matrices are tridiagonal and can be thought of as the non-Hermitian analogue of the Hermite $\beta$-ensembles discovered by Dumitriu and Edelman (J. Math. Phys.,…