Related papers: Bananas: multi-edge graphs and their Feynman integ…
The linear induced matching width (LMIM-width) of a graph is a width parameter defined by using the notion of branch-decompositions of a set function on ternary trees. In this paper we study output-polynomial enumeration algorithms on…
Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…
We present a method for a recursive graphical construction of Feynman diagrams with their correct multiplicities in quantum electrodynamics. The method is first applied to find all diagrams contributing to the vacuum energy from which all…
Given an unbalanced open quantum graph, we derive a formula relating sums over its scattering resonances with integrals outside a strip. We deduce lower bounds on the number of resonances (in bounded regions of the complex plane),that are…
In this paper, we study random instances of the classical marginal problem. We encode the problem in a graph, where the vertices have assigned fixed binary probability distributions, and edges have assigned random bivariate distributions…
We investigate the following generalisation of the 'multiplication table problem' of Erd\H{o}s: given a bipartite graph with $m$ edges, how large is the set of sizes of its induced subgraphs? Erd\H{o}s's problem of estimating the number of…
This article introduces moduli spaces of coloured graphs on which Feynman amplitudes can be viewed as 'discrete' volume densities. The basic idea behind this construction is that these moduli spaces decompose into disjoint unions of open…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
We revisit the idea of numerically integrating the differential form of Feynman integrals. With a novel approach for the treatment of branch cuts, we develop an integrator capable of evaluating a basis of master integrals in double and…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
Given an undirected graph $G(V, E)$, it is well known that partitioning a graph $G$ into $q$ connected subgraphs of equal or specificed sizes is in general NP-hard problem. On the other hand, it has been shown that the q-partition problem…
We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These…
A modular application of the integration by fractional expansion (IBFE) method for evaluating Feynman diagrams is extended to diagrams that contain loop triangle subdiagrams in their geometry. The technique is based in the replacement of…
A one-to-one correspondence is proved between the N-rooted ribbon graphs, or maps, with e edges and the (e-N+1)-loop Feynman diagrams of a certain quantum field theory. This result is used to obtain explicit expressions and relations for…
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…
In theories like SM or MSSM with a complex gauge group structure the complete set of Feynman diagrams contributed to a particular physics process can be splited to exact gauge invariant subsets. Arguments and examples given in the review…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…
We introduce a class of iterated integrals that generalize multiple polylogarithms to elliptic curves. These elliptic multiple polylogarithms are closely related to similar functions defined in pure math- ematics and string theory. We then…