Related papers: Linked partition ideals, directed graphs and $q$-m…
Instanton partition functions of $\mathcal{N}=1$ 5d Super Yang-Mills reduced on $S^1$ can be engineered in type IIB string theory from the $(p,q)$-branes web diagram. To this diagram is superimposed a web of representations of the…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…
Due to Fortuin and Kastelyin the $q$ state Potts model has a representation as a sum over random graphs, generalizing the Potts model to arbitrary $q$ is based on this representation. A key element of the Random Cluster representation is…
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…
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…
In the planted partition problem, the $n$ vertices of a random graph are partitioned into $k$ "clusters," and edges between vertices in the same cluster and different clusters are included with constant probability $p$ and $q$, respectively…
We continue to investigate branching systems of directed graphs and their connections with graph algebras. We give a sufficient condition under which the representation induced from a branching system of a directed graph is faithful and…
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…
We show how networks of Wilson lines realize quantum groups U_q(sl(m)), for arbitrary m, in 3d SU(N) Chern-Simons theory. Lifting this construction to foams of surface operators in 4d theory we find that rich structure of junctions is…
A new hidden symmetry is exhibited in the reflection equation and related quantum integrable models. It is generated by a dual pair of operators $\{\textsf{A}, \textsf{A}^*\}\in{\cal A}$ subject to $q-$deformed Dolan-Grady relations. Using…
Partial duality generalizes the fundamental concept of the geometric dual of an embedded graph. A partial dual is obtained by forming the geometric dual with respect to only a subset of edges. While geometric duality preserves the genus of…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
We determine an infinite family of linear identities for the number $A_4(n)$ of partition pairs of $n$ with $4$-cores by employing elementary $q$-series techniques and certain $3$-dissection formulas. We then discover an infinite family of…
In his important 1920 paper on partitions, MacMahon defined the partition generating functions \begin{align*} A_k(q)=\sum_{n=1}^{\infty}\mathfrak{m}(k;n)q^n&:=\sum_{0< s_1<s_2<\cdots<s_k}…
Graph neural networks (GNNs), which propagate the node features through the edges and learn how to transform the aggregated features under label supervision, have achieved great success in supervised feature extraction for both node-level…
Although perturbative quantum field theory is highly successful, it possesses a number of well-known analytic problems, from ultraviolet and infrared divergencies to the divergence of the perturbative expansion itself. As a consequence, it…
We consider discrete sine-Gordon equation on branched domains. The latter is modeled in terms of the metric graphs with discrete bonds having the form of the branched 1D chains. Exact analytical solutions of the problem are obtained for…