Related papers: Algebraic Interplay between Renormalization and Mo…
With the aid of simple examples we show how to make simple estimates of the sizes of higher-order Feynman graphs. Our methods enable appropriate values of renormalization and factorization scales to be made. They allow the diagnosis of the…
We describe various combinatorial aspects of the Birkhoff-Connes-Kreimer factorization in perturbative renormalisation. The analog of Bogoliubov's preparation map on the Lie algebra of Feynman graphs is identified with the pre-Lie Magnus…
Unlabeled multigraphs have diverse applications across scientific fields, from transportation and social networks to polymer physics. In particular, multigraphs are essential for studying the relationship between the spatial organization…
Using an infinitesimal approach, this work addresses the renormalization problem to deal with the ultraviolet divergences arising in quantum field theory. Under the assumption that the action has already been renormalized to yield an…
Correlation functions in quantum field theory are calculated using Feynman amplitudes, which are finite dimensional integrals associated to graphs. The integrand is the exponential of the ratio of the first and second Symanzik polynomials…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
Diagrammatic techniques are well-known in the calculation of dispersion interactions between atoms or molecules. The multipolar coupling scheme combined with Feynman ordered diagrams significantly reduces the number of graphs compared to…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
A recently proposed scheme for numerical evaluation of Feynman diagrams is extended to cover all two-loop two-point functions with arbitrary internal and external masses. The adopted algorithm is a modification of the one proposed by F. V.…
We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs.…
First, we give a functorial construction of a group associated to a symmetric operad. Applied to the endomorphism operad it gives the group of formal diffeomorphisms. Second, we associate a symmetric operad to any family of decorated graphs…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
The non-renormalization theorems of chiral vertex functions are derived on the basis of an algebraic analysis. The property, that the interaction vertex is a second supersymmetry variation of a lower dimensional field monomial, is used to…
We construct an explicit minimal model for an algebra over the cobar-construction of a differential graded operad. The structure maps of this minimal model are expressed in terms of sums over decorated trees. We introduce the appropriate…
Renormalization of massless Feynman amplitudes in $x$-space is reexamined here, using almost exclusively real-variable methods. We compute a wealth of concrete examples by means of recursive extension of distributions. This allows us to…
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.…
In close analogy to the Bloch-Feshbach formalism known from the theory of nuclear dynamics, I develop a mathematical framework that allows one to understand renormalization in terms of purely algebraic operations (projections, dilatations)…
It has long been known that the combinatorial properties of a graph $\Gamma$ are closely related to the group theoretic properties of its right angled artin group (raag). It's natural to ask if the graph homomorphisms are similarly related…
The representation of the bare parameters of Lagrangian in terms of total vertex Green's functions is used to obtain the general form of renormalization conditions. In the framework of this approach renormalizations can be carried out…
The idiosyncratic polynomial of a graph $G$ with adjacency matrix $A$ is the characteristic polynomial of the matrix $ A + y(J-A-I)$, where $I$ is the identity matrix and $J$ is the all-ones matrix. It follows from a theorem of Hagos (2000)…