Related papers: Matrix kernels for measures on partitions
We prove an identity about partitions involving new combinatorial coefficients. The proof given is using a generating function. As an application we obtain the explicit expression of two shifted symmetric functions, related with Jack…
We prove that the Bergman kernel function associated to a smooth measure supported on a piecewise-smooth maximally totally real submanifold K in C^n is of polynomial growth (e.g, in dimension one, K is a finite union of transverse Jordan…
Matrices often represent important information in scientific applications and are involved in performing complex calculations. But systematically testing these applications is hard due to the oracle problem. Metamorphic testing is an…
The orbifold generalization of the partition function, which would describe the gauge theory on the ALE space, is investigated from the combinatorial perspective. It is shown that the root of unity limit of the q-deformed partition function…
We study multivariable Christoffel-Darboux kernels, which may be viewed as reproducing kernels for antisymmetric orthogonal polynomials, and also as correlation functions for products of characteristic polynomials of random Hermitian…
The universality properties of kernels characterize the class of functions that can be approximated in the associated reproducing kernel Hilbert space and are of fundamental importance in the theoretical underpinning of kernel methods in…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the set of $r$-decomposable correlation matrices: those that can…
A kernel density is an aggregate of kernel functions, which are itself densities and could be kernel densities. This is used to decompose a kernel into its constituent parts. Pearson's test for equality of proportions is applied to…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
We give a closed form for the correlation functions of ensembles of a class of asymmetric real matrices in terms of the Pfaffian of an antisymmetric matrix formed from a $2 \times 2$ matrix kernel associated to the ensemble. We apply this…
The behavior of correlation functions is studied in a class of matrix models characterized by a measure $\exp(-S)$ containing a potential term and an external source term: $S=N\tr(V(M)-MA)$. In the large $N$ limit, the short-distance…
Here we study problems related to the proportions of zeros, especially simple and distinct zeros on the critical line, of Dedekind zeta functions. We obtain new bounds on a counting function that measures the discrepancy of the zeta…
We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to…
We present the Schmidt decomposition for arbitrary wavefunctions of two indistinguishable bosons, extending the recent studies of entanglement or quantum correlations for two fermion systems [J. Schliemann et al., Phys. Rev. B {\bf 63},…
Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…
Models like support vector machines or Gaussian process regression often require positive semi-definite kernels. These kernels may be based on distance functions. While definiteness is proven for common distances and kernels, a proof for a…
Using techniques from integrable systems, we obtain a number of exact results for random partitions. In particular, we prove a simple formula for correlation functions of what we call the Schur measure on partitions (which is a far reaching…
Expanding upon previous work, using the path-integral formalism we derive expressions for the one-particle reduced density matrix and the two-point correlation function for a quadratic system of bosons that interact through a general class…
We consider the partition function and correlation functions in the bosonic and supersymmetric Yang-Mills matrix models with compact semi-simple gauge group. In the supersymmetric case, we show that the partition function converges when…