Related papers: Gluing Ladders into Fishnets
In analogy with the well-known 2-linkage tractor-trailer problem, we define a 2-linkage problem in the plane with novel non-holonomic ``no-slip'' conditions. Using constructs from sub-Riemannian geometry, we look for geodesics corresponding…
In this note, we study the equivalence between planar Ising networks and cells in the positive orthogonal Grassmannian. We present a microscopic construction based on amalgamation, which establishes the correspondence for any planar Ising…
We present a procedure which allows one to integrate explicitly the class of checkerboard IC-nets which has recently been introduced as a generalisation of incircular (IC) nets. The latter class of privileged congruences of lines in the…
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
The Pfaffian structure of the boundary monomer correlation functions in the dimer-covering planar graph models is rederived through a combinatorial / topological argument. These functions are then extended into a larger family of…
Duality relations for the correlation functions of $n$ sites on the boundary of a planar lattice are derived for the $(N_{\alpha}, N_{\beta})$ model of Domany and Riedel for $n=2,3$. Our result holds for arbitrary lattices which can have…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the…
We consider a special double scaling limit, recently introduced by two of the authors, combining weak coupling and large imaginary twist, for the $\gamma$-twisted $\mathcal{N}=4$ SYM theory. We also establish the analogous limit for ABJM…
We show that a class of $L$-loop conformal ladder graphs correspond to twisted partition functions of free massive complex scalars in $d=2L+1$ dimensions. The graphs arise as four-point functions in certain two- and four-dimensional…
In this short note we use the flat space limit and the relation between the 4-pt correlation function of the bottom and top components of the stress tensor multiplet to constraint its stringy corrections at strong coupling in the planar…
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…
Four-dimensional conformal fishnet theory is an integrable scalar theory which arises as a double scaling limit of $\gamma$-deformed maximally supersymmetric Yang-Mills. We give a perturbative reformulation of $\gamma$-deformed…
The two-loop QCD corrections to vector boson pair production at hadron colliders involve a new class of Feynman integrals: two-loop four-point functions with two off-shell external legs. We describe their reduction to a small set of master…
We calculate the four-point function in \lambda\phi^4 theory by using Krein regularization and compare our result, which is finite, with the usual result in \lambda\phi^4 theory. The effective coupling constant (\lambda_\mu) is also…
We elaborate on the connection between Gel'fand-Kapranov-Zelevinsky systems, de Rham theory for twisted cohomology groups, and Pfaffian equations for Feynman integrals. We propose a novel, more efficient algorithm to compute Macaulay…
Based on conformal symmetry we propose an exact formula for the four-point connectivities of FK clusters in the critical Ising model when the four points are anchored to the boundary. The explicit solution we found displays logarithmic…
We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…
A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…