Related papers: Some Remarks on Non-Planar Diagrams
A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In…
For a wide class of nonlinear equations a perturbative solution is constructed. This class includes equations of motion of field theories. The solution possesses a graphical representation in terms of diagrams. To illustrate the formalism…
We obtain the detailed Feynman rules for perturbative gauge theory on a fixed Yang-Mills plane wave background. Using these rules, the tree-level 4-point gluon amplitude is computed and some 1-loop Feynman diagrams are considered. As an…
A drawing of a graph is fan-planar if the edges intersecting a common edge $a$ share a vertex $A$ on the same side of $a$. More precisely, orienting $e$ arbitrarily and the other edges towards $A$ results in a consistent orientation of the…
A rectangular dual of a plane graph $G$ is a contact representation of $G$ by interior-disjoint rectangles such that (i) no four rectangles share a point, and (ii) the union of all rectangles is a rectangle. In this paper, we study…
We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph $G$, the goal is to construct a straight-line drawing $\Gamma$ of $G$ in the plane such that, for any two vertices $u$ and $v$ of $G$,…
We give an algorithm for obtaining expansions of massive two-loop Feynman graphs in powers of the external momentum around a finite, nonzero value of the momentum. This is based on our general two-loop formalism to reduce massive two-loop…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
Flows in networks (or graphs) play a significant role in numerous computer vision tasks. The scalar-valued edges in these graphs often lead to a loss of information and thereby to limitations in terms of expressiveness. For example,…
The differential equations satisfied by the wavefunction coefficients of conformally coupled scalars in a power-law cosmology can be recast into an iterative differential system of basis functions. These functions can be encoded within…
We discuss a two-parameter family of maps that generalize piecewise linear, expanding maps of the circle. One parameter measures the effect of a non-linearity which bends the branches of the linear map. The second parameter rotates points…
Recent developments in quantum chemistry, perturbative quantum field theory, statistical physics or stochastic differential equations require the introduction of new families of Feynman-type diagrams. These new families arise in various…
A comprehensive study is performed of two-loop Feynman diagrams with three external legs which, due to the exchange of massless gauge-bosons, give raise to infrared and collinear divergencies. Their relevance in assembling realistic…
We present a theory of the nonlinear growth of zonal flows in magnetized plasma turbulence, by the mechanism of secondary instability. The theory is derived for general magnetic geometry, and is thus applicable to both tokamaks and…
A new method is developed to calculate multiloop Feynman diagrams in non-relativistic field theories. A consistent scheme for regularizing and renormalizing loop integrals is established and shown to reproduce the results of dimensional…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
For two-loop two-point diagrams with arbitrary masses, an algorithm to derive the asymptotic expansion at large external momentum squared is constructed. By using a general theorem on asymptotic expansions of Feynman diagrams, the…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
We study the symbology of planar Feynman integrals in dimensional regularization by considering geometric configurations in momentum twistor space corresponding to their leading singularities (LS). Cutting propagators in momentum twistor…
In this paper we introduce a diagrammatic equation for the planar sector of square non hermitian random matrix models strongly reminiscent of Polchinski's equation in quantum field theory. Our fundamental equation is first obtained by a…