Related papers: On overlapping Feynman (sub)graphs
A graph is said to be orthogonalisable if the set of real symmetric matrices whose off-diagonal pattern is prescribed by its edges contains an orthogonal matrix. We determine some necessary and some sufficient conditions on the sizes of the…
Some problems related to the structure of higher terms of the epsilon-expansion of Feynman diagrams are discussed.
In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…
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…
We present a rigorous proof of the convergence theorem for the Feynman graphs in arbitrary massive Euclidean quantum field theories on non-commutative R^d (NQFT). We give a detailed classification of divergent graphs in some massive NQFT…
We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…
An algorithm for obtaining the Taylor coefficients of an expansion of Feynman diagrams is proposed. It is based on recurrence relations which can be applied to the propagator as well as to the vertex diagrams. As an application, several…
A hypergraph is said to be $1$-Sperner if for every two hyperedges the smallest of their two set differences is of size one. We present several applications of $1$-Sperner hypergraphs and their structure to graphs. In particular, we…
The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of subtrees of a caterpillar are interval filament graphs. In…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
Generalising an example by Girondo and Wolfart, we use finite group theory to construct Riemann surfaces admitting two or more regular dessins (i.e. orientably regular hypermaps) with automorphism groups of the same order, and in many cases…
We prove by explicit calculation that Feynman graphs in noncommutative Yang-Mills theory made of repeated insertions into itself of arbitrarily many one-loop ghost propagator corrections are renormalizable by local counterterms. This…
Interpreting graph neural networks (GNNs) is difficult because message passing mixes signals and internal channels rarely align with human concepts. We study superposition, the sharing of directions by multiple features, directly in the…
A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…
In this thesis, we study two different graph problems. The first problem revolves around geometric spanners. Here, we have a set of points in the plane and we want to connect them with straight line segments, such that there is a path…
We state some remarks on `$n$-dimensional Feynman diagrams' ($n\in\N$). There are different features between in the case of $n$-dimensional Feynman diagrams($n\geqq3$) and in the 1-, 2-dimensional case.
We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and…
We develop novel methods for constructing nearly Hamilton cycles in sublinear expanders with good regularity properties, as well as new techniques for finding such expanders in general graphs. These methods are of independent interest due…
The non-planar Feynman diagram with seven massless, scalar propagators and four on-shell legs (the crossed double box) is calculated analytically in dimensional regularization. The non-planar diagram with six propagators is also discussed.
Work is reported on finite integral representations for 2-loop massive 2-, 3- and 4-point functions, using orthogonal and parallel space variables. It is shown that this can be utilized to cover particles with arbitrary spin (tensor…