Related papers: Some Remarks on Non-Planar Diagrams
Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…
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…
On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…
We give formulae for the first homology of the $n$-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the…
We present the first algorithm to morph graphs on the torus. Given two isotopic essentially 3-connected embeddings of the same graph on the Euclidean flat torus, where the edges in both drawings are geodesics, our algorithm computes a…
Recently, Bern et al observed that a certain class of next-to-planar Feynman integrals possess a bonus symmetry that is closely related to dual conformal symmetry. It corresponds to a projection of the latter along a certain lightlike…
Starting from the Mellin-Barnes integral representation of a Feynman integral depending on set of kinematic variables $z_i$, we derive a system of partial differential equations w.r.t.\ new variables $x_j$, which parameterize the…
The behaviour of two-loop two-point diagrams at non-zero thresholds corresponding to two-particle cuts is analyzed. The masses involved in a cut and the external momentum are assumed to be small as compared to some of the other masses of…
Sampling conditional distributions is a fundamental task for Bayesian inference and density estimation. Generative models, such as normalizing flows and generative adversarial networks, characterize conditional distributions by learning a…
This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…
Using standard field theoretical techniques, we survey pure Yang-Mills theory on the noncommutative torus, including Feynman rules and BRS symmetry. Although in general free of any infrared singularity, the theory is ultraviolet divergent.…
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…
Geometric representations provide a principled framework for structuring the description of latent constructs and clarifying sources of uncertainty in their dimensional characterisation. We introduce a novel geometric representation of…
We consider embeddings of 3-regular graphs into 3-dimensional Cartesian coordinates, in such a way that two vertices are adjacent if and only if two of their three coordinates are equal (that is, if they lie on an axis-parallel line) and…
We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing. The…
Computing a morph between two drawings of a graph is a classical problem in computational geometry and graph drawing. While this problem has been widely studied in the context of planar graphs, very little is known about the existence of…
In the first part of this lecture, the 1/N expansion technique is illustrated for the case of the large-N sigma model. In large-N gauge theories, the 1/N expansion is tantamount to sorting the Feynman diagrams according to their degree of…
In the models defined on the inhomogeneous background the propagators depend on the two space - time momenta rather than on one momentum as in the homogeneous systems. Therefore, the conventional Feynman diagrams contain extra integrations…
We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar…