Related papers: Factorization of Spanning Trees on Feynman Graphs
A computer program has been developed which generates Feynman graphs automatically for scattering and decay processes in non-Abelian gauge theory of high-energy physics. A new acceleration method is presented for both generating and…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a…
A natural extension of the Dijkgraaf-Vafa proposal is to include fields in the fundamental representation of the gauge group. In this paper we use field theory techniques to analyze gauge theories whose tree level superpotential is a…
Pfaffian diagrams are formulated to represent gluon amplitudes computed from the Cachazo-He-Yuan (CHY) formula. They may be regarded as a systematic regrouping of Feynman diagrams after internal momenta are expanded and products of vertex…
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
Factorization of string amplitudes is one way of constructing string interaction vertices. We show that correlation functions in string theory can be conveniently factorized using loop variables representing delta functionals. We illustrate…
Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and…
We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…
We address some computational issues that may hinder the use of AMP chain graphs in practice. Specifically, we show how a discrete probability distribution that satisfies all the independencies represented by an AMP chain graph factorizes…
The parametric representation has been used since a long time for the evaluation of Feynman diagrams. As a dimension independent intermediate representation, it allows a clear description of singularities. Recently, it has become a choice…
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…
The Rooted Maps Theory, a branch of the Theory of Homology, is shown to be a powerful tool for investigating the topological properties of Feynman diagrams, related to the single particle propagator in the quantum many-body systems. The…
In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are…
We show that Feynman diagrams in AdS$_2$ space can be decomposed into infinite series of matrix elements of Wilson line network operators. The case of the 3-point scalar Feynman diagram with endpoints in the bulk is studied in detail. The…
We apply the matrix-tree theorem to establish a link between various diagrammatic and determinant expressions, which naturally appear in scattering amplitudes of gravity theories. Using this link we are able to give a general…
We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial…
The Feynman-Schwinger representation provides a convenient framework for the cal culation of nonperturbative propagators. In this paper we first investigate an analytically solvable case, namely the scalar QED in 0+1 dimension. With this…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…