Related papers: SU(N) integrals and tau functions

We give a path integral construction of the quantum mechanical partition function for gauged finite groups. Our construction gives the quantization of a system of $d$, $N\times N$ matrices invariant under the adjoint action of the symmetric…

Earlier we explained that partition functions of various matrix models can be constructed from that of the cubic Kontsevich model, which, therefore, becomes a basic elementary building block in "M-theory" of matrix models. However, the less…

There are well-known constructions of integrable systems which are chains of infinitely many copies of the equations of the KP hierarchy ``glued'' together with some additional variables, e.g., the modified KP hierarchy. Another…

We compute the ${\cal N}=2$ supersymmetric partition function of a gauge theory on a four-dimensional compact toric manifold via equivariant localization. The result is given by a piecewise constant function of the K\"ahler form with jumps…

In this paper, by making use of a certain family of fractional derivative operators in the complex domain, we introduce and investigate a new subclass $\mathcal{P}_{\tau,\mu}(k,\delta,\gamma)$ of analytic and univalent functions in the open…

Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…

Partitions of unity in ${\mathbf R}^d$ formed by (matrix) scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D\geq 1$. For a vertex $x$ of $\Gamma$ the corresponding subconstituent algebra $T=T(x)$ is generated by the adjacency matrix $A$ of $\Gamma$ and the dual adjacency…

We compute the contour integral for the partition function of an $\mathcal{N}=2$ $SU(2)$ topologically twisted theory on $\mathbb{CP}^2$, dimensionally reducing from an $\mathcal{N}=1$ theory on $S^5$. Earlier works presented the partition…

We show that, given a $ k $-tangle $ \tau $ in a graph $ G $, there always exists a weight function $ w\colon V(G)\to\mathbb{N} $ such that a separation $ (A,B) $ of $ G $ of order $ {<}k $ lies in $ \tau $ if and only if $ w(A)<w(B) $,…

We exhibit explicitly the intertwiner operator for the monodromy matrices of the recent proposed SU(N) Hubbard model [5]. This produces a new family of non-additive R-matrices and generalizes an earlier result by Shastry [2].

Itoyama-Tokura type USp matrix model is discussed. Non-Abelian Berry's phases in a T-dualized model of IT model were reconsidered. These phases describe the higher dimensional monopoles; Yang monopole and nine-dimensional monopole. They are…

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

Inspired by recent formul\ae\ of Dubrovin, Yang, and Zagier, we interpret the tau function enumerating stationary Gromov-Witten invariants of $\mathbb{P}^1$ as an isomonodromic tau function associated with a difference equation. As a…

We prove that a certain sequence of tau functions of the Garnier system satisfies Toda equation. We construct a class of algebraic solutions of the system by the use of Toda equation; then show that the associated tau functions are…

Let $G=(U \cup V, E)$ be a bipartite graph, where $U$ represents jobs and $V$ represents machines. We study a new variant of the bipartite matching problem in which each job in $U$ can be matched to at most one machine in $V$, and the…

For a class of arithmetic subgroups $\Gamma$ in SU(d,1) we prove that for every positive integer $n$ there exists a subgroup $\Gamma_n$ of finite index in $\Gamma$, which lifts to the $n$-fold connected cover of of SU(d,1). Consequently…

The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are general conditions under which the partition function is tractable? The answer leads to a new…

Let $G$ be a finite group and $\chi: G \rightarrow \mathbb{C}$ a class function. Let $H = (V,E)$ be a directed graph with for each vertex a cyclic order of the edges incident to it. The cyclic orders give a collection $F$ of faces of $H$.…

It has been understood that correlation functions of multi-trace operators in ${\cal N}=4$ SYM can be neatly computed using the group algebra of symmetric groups or walled Brauer algebras. On the other hand such algebras have been known to…