Related papers: Graph Reconstruction, Functorial Feynman Rules and…
We prove a deletion-contraction formula for motivic Feynman rules given by the classes of the affine graph hypersurface complement in the Grothendieck ring of varieties. We derive explicit recursions and generating series for these motivic…
We study the behavior of the Chern classes of graph hypersurfaces under the operation of deletion-contraction of an edge of the corresponding graph. We obtain an explicit formula when the edge satisfies two technical conditions, and prove…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
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…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
Feynman integrals that have been evaluated in dimensional regularization can be written in terms of generalized hypergeometric functions. It is well known that properties of these functions are revealed in the framework of intersection…
A noncommutative Feynman graph is a ribbon graph and can be drawn on a genus $g$ 2-surface with a boundary. We formulate a general convergence theorem for the noncommutative Feynman graphs in topological terms and prove it for some classes…
We investigate Feynman graphs and their Feynman rules from the viewpoint of graph complexes. We focus on graph homology and on the appearance of cubical complexes when either reducing internal edges or when removing them by putting them on…
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…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
It is well known that the mathematical structure underlying renormalization in perturbative quantum field theory is based on a Hopf algebra of Feynman diagrams. A precondition for this is locality of the field theory. Consequently, one…
We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be…
The Feynman rules assign to every graph an integral which can be written as a function of a scaling parameter L. Assuming L for the process under consideration is very small, so that contributions to the renormalizaton group are small, we…
In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…
A representation of the perturbation series of a general functional measure is given in terms of generalized Feynman graphs and -rules. The graphical calculus is applied to certain functional measures of L\'evy type. A graphical notion of…
We give a general procedure to construct algebro-geometric Feynman rules, that is, characters of the Connes-Kreimer Hopf algebra of Feynman graphs that factor through a Grothendieck ring of immersed conical varieties, via the class of the…
The free energy of a field theory can be considered as a functional of the free correlation function. As such it obeys a nonlinear functional differential equation which can be turned into a recursion relation. This is solved order by order…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…