Related papers: SU(N) integrals and tau functions
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
We investigate a construction which associates a finite von Neumann algebra $M(\Gamma,\mu)$ to a finite weighted graph $(\Gamma,\mu)$. Pleasantly, but not surprisingly, the von Neumann algebra associated to to a `flower with $n$ petals' is…
Partition functions of some two-dimensional statistical models can be represented by means of Grassmann integrals over loops living on two-dimensional torus. It is shown that those Grassmann integrals are topological invariants, which…
A new representation of the 2N fold integrals appearing in various two-matrix models that admit reductions to integrals over their eigenvalues is given in terms of vacuum state expectation values of operator products formed from…
The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…
The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…
Orthogonal and symplectic matrix integrals are investigated. It is shown that the matrix integrals can be considered as a $\tau$-function of the coupled KP hierarchy, whose solution can be expressed in terms of pfaffians.
Given a symmetric matrix $M\in \{0,1,*\}^{D\times D}$, an $M$-partition of a graph $G$ is a function from $V(G)$ to $D$ such that no edge of $G$ is mapped to a $0$ of $M$ and no non-edge to a $1$. We give a computer-assisted proof that,…
Results are obtained on extending flat vector bundles or equivalently general representations from the fundamental group of S, a connected subsurface of the connected boundary of a compact, connected, oriented 3-dimensional manifold, to the…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We solve, for finite $N$, the matrix model of supersymmetric $U(N)$ Chern-Simons theory coupled to $N_{f}$ massive hypermultiplets of $R$-charge $\frac{1}{2}$, together with a Fayet-Iliopoulos term. We compute the partition function by…
Using the matrix-resolvent method and a formula of the second-named author on the $n$-point function for a KP tau-function, we show that the tau-function of an arbitrary solution to the Toda lattice hierarchy is a KP tau-function. We then…
The simplest nontrivial tau functions of the Toda lattice and the $\tN$-component Toda lattice are compared in their applications to multimatrix integrals.
In this paper, we explore the concept of the ``matrix product of graphs," initially introduced by Prasad, Sudhakara, Sujatha, and M. Vinay. This operation involves the multiplication of adjacency matrices of two graphs with assigned labels,…
We consider the number of the $6$-regular partitions of $n$, $b_6(n)$, and give infinite families of congruences modulo $3$ (in arithmetic progression) for $b_6(n)$. We also consider the number of the partitions of $n$ into distinct parts…
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets $A$ and~$B$, where $A$ is an independent set and $B$ induces a graph from some specified graph class ${\cal…
We prove that 3d superconformal index for general $\mathcal N=2$ U(N) gauge group with fundamentals and anti-fundmentals with/without Chern-Simons terms is factorized into vortex and anti-vortex partition function. We show that for simple…
For every ADE Dynkin diagram, we give a realization, in terms of usual fusion algebras (graph algebras), of the algebra of quantum symmetries described by the associated Ocneanu graph. We give explicitly, in each case, the list of the…
We consider the problem of finding a subgraph of a given graph minimizing the sum of given functions at vertices evaluated at their subgraph degrees. While the problem is NP-hard already for bipartite graphs when the functions are convex on…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…