Related papers: SU(N) integrals and tau functions
We study multi-matrix models which may be viewed as integrals of products of tau functions which depend on the eigenvalues of products of random matrices. In the present paper we consider tau functions of the hierarchy the two-component KP…
We show that any polynomial tau-function of the s-component KP and the BKP hierarchies can be interpreted as a zero mode of an appropriate combinatorial generating function. As an application, we obtain explicit formulas for all polynomial…
Our previous work on a hidden integrable structure of the melting crystal model (the U(1) Nekrasov function) is extended to a modified crystal model. As in the previous case, "shift symmetries" of a quantum torus algebra plays a central…
Seymour's famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called $k$-sums starting from network matrices and their transposes and…
We consider the matrix spherical function related to the compact symmetric pair $(G,K)=(\mathrm{SU}(n+m),\mathrm{S}(\mathrm{U}(n)\times\mathrm{U}(m)))$. The irreducible $K$ representations $(\pi,V)$ in the ${\rm U}(n)$ part are considered…
Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and…
We study the hermitean and normal two matrix models in planar approximation for an arbitrary number of eigenvalue supports. Its planar graph interpretation is given. The study reveals a general structure of the underlying analytic complex…
A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…
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,…
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…
Matrix elements in different representations are connected by quadratic relations. If matrix elements are those of a $\textit{group element}$, i.e. satisfying the property $\Delta(X) = X\otimes X$, then their generating functions obey…
The differential systems satisfied by orthogonal polynomials with arbitrary semiclassical measures supported on contours in the complex plane are derived, as well as the compatible systems of deformation equations obtained from varying such…
We use the method of the Weingarten functions to evaluate SU(N) integrals of the polynomial type. As an application we calculate various one-link integrals for lattice gauge and spin SU(N) theories.
We study the structure of the normal matrix model (NMM). We show that all correlation functions of the model with axially symmetric potentials can be expressed in terms of holomorphic functions of one variable. This observation is used to…
We consider one-plaquette unitary matrix model at finite $N$ using exact expression of the partition function for both SU($N$) and U($N$) groups.
A symmetric $m\times m$ matrix $M$ with entries taken from $\{0,1,\ast\}$ gives rise to a graph partition problem, asking whether a graph can be partitioned into $m$ vertex sets matched to the rows (and corresponding columns) of $M$ such…
An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$…
We give the first analysis of the computational complexity of {\it coalition structure generation over graphs}. Given an undirected graph $G=(N,E)$ and a valuation function $v:2^N\rightarrow\RR$ over the subsets of nodes, the problem is to…
In Part 1 we study the spherical functions on compact symmetric pairs of arbitrary rank under a suitable multiplicity freeness assumption and additional conditions on the branching rules. The spherical functions are taking values in the…
We consider 4d supersymmetric (special) unitary $\Gamma$ quiver gauge theories on compact manifolds which are $T^2$ fibrations over $S^2$. We show that their partition functions are correlators of vertex operators and screening charges of…