Related papers: Transformations of polynomial ensembles
These lectures provide an informal introduction into the notions and tools used to analyze statistical properties of eigenvalues of large random Hermitian matrices. After developing the general machinery of orthogonal polynomial method, we…
We show the density of eigenvalues for three classes of random matrix ensembles is determinantal. First we derive the density of eigenvalues of product of $k$ independent $n\times n$ matrices with i.i.d. complex Gaussian entries with a few…
In this paper we construct a class of random matrix ensembles labelled by a real parameter $\alpha \in (0,1)$, whose eigenvalue density near zero behaves like $|x|^\alpha$. The eigenvalue spacing near zero scales like $1/N^{1/(1+\alpha)}$…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
Explicit treatment of many-body Fermi statistics in path integral Monte Carlo (PIMC) results in exponentially scaling computational cost due to the near cancellation of contributions to observables from even and odd permutations. Through…
Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…
Moments of the characteristic polynomial of a random matrix taken from any of the three ensembles, orthogonal, unitary or symplectic, are given either as a determinant or a pfaffian or as a sum of determinants. For gaussian ensembles…
We consider random non-hermitean matrices in the large $N$ limit. The power of analytic function theory cannot be brought to bear directly to analyze non-hermitean random matrices, in contrast to hermitean random matrices. To overcome this…
We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…
The $N$-representability problem places fundamental constraints on reduced density matrices (RDMs) that originate from physical many-fermion quantum states. Motivated by recent developments in functional theories, we introduce a hierarchy…
Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as…
We provide frequency probabilistic analysis of perturbations of physical systems by preparation procedures. We obtained the classification of possible probabilistic transformations connecting input and output probabilities that can appear…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
The eigenvalue probability density function of the Gaussian unitary ensemble permits a $q$-extension related to the discrete $q$-Hermite weight and corresponding $q$-orthogonal polynomials. A combinatorial counting method is used to specify…
The ensemble inter-relations to be considered are special features of classical cases, where the joint eigenvalue probability density can be computed explicitly. Attention will be focussed too on the consequences of these inter-relations,…
Let $x_1, \dots, x_n$ be $n$ independent and identically distributed random variables with mean zero, unit variance, and finite moments of all remaining orders. We study the random polynomial $p_n$ having roots at $x_1, \dots, x_n$. We…
A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…
I review aspects of work done in collaboration with A. Zee and R. Scalettar \cite{fz1,fz2,fsz} on complex non-hermitean random matrices. I open by explaining why the bag of tools used regularly in analyzing hermitean random matrices cannot…
A numerical semigroup is a subset of the non-negative integers that is closed under addition. For a randomly generated numerical semigroup, the expected number of minimum generators can be expressed in terms of a doubly-indexed sequence of…