Related papers: On overlapping Feynman (sub)graphs
The diagrammatic coaction maps any given Feynman graph into pairs of graphs and cut graphs such that, conjecturally, when these graphs are replaced by the corresponding Feynman integrals one obtains a coaction on the respective functions.…
We introduce the graph parameter readability and study it as a function of the number of vertices in a graph. Given a digraph D, an injective overlap labeling assigns a unique string to each vertex such that there is an arc from x to y if…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
We review the hypergeometric function approach to Feynman diagrams. Special consideration is given to the construction of the Laurent expansion. As an illustration, we describe a collection of physically important one-loop vertex diagrams…
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…
We study the dual graph polynomials and the case when a Feynman graph has no triangles but has a 4-face. This leads to the proof of the duality-admissibility of all graphs up to 18 loops. As a consequence, the $c_2$ invariant is the same…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
We introduce the cycle intersection graph of a graph, an adaptation of the cycle graph of a graph, and use the structure of these graphs to prove an upper bound for the decycling number of all even graphs. This bound is shown to be…
A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance…
The CHY construction naturally associates a vector in $\mathbb{R}^{(n-3)!}$ to every 2-regular graph with $n$ vertices. Partial amplitudes in the biadjoint scalar theory are given by the inner product of vectors associated with a pair of…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
A network can be analyzed at different topological scales, ranging from single nodes to motifs, communities, up to the complete structure. We propose a novel intermediate-level topological analysis that considers non-overlapping subgraphs…
We introduce a novel structure for Feynman integrals, reformulating them as integrals over a small set of parameters with a fully controllable integrand. The integrand closely resembles one-loop Feynman integrals, and they are very easy to…
A connection between one-loop $N$-point Feynman diagrams and certain geometrical quantities in non-Euclidean geometry is discussed. A geometrical way to calculate the corresponding Feynman integrals is considered. (This paper contains a…
A comprehensive study is performed of general massive, tensor, two-loop Feynman diagrams with two and three external legs. Reduction to generalized scalar functions is discussed. Integral representations, supporting the same class of…
We investigate combinatorial and algebraic aspects of the interplay between renormalization and monodromies for Feynman amplitudes. We clarify how extraction of subgraphs from a Feynman graph interacts with putting edges onshell or with…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…