Related papers: Factorization of Spanning Trees on Feynman Graphs
By identifying each standard flag with a trivalent Feynman diagram, the corresponding propagators can be read directly from the flag itself. Within the flag representation, the kinematic Jacobi identity (equivalently, the residue theorem on…
The Feynman Propagator of a charged particle confined to an anisotropic Harmonic Oscillator potential and moving in a crossed electromagnetic field is calculated in a conceptually new way. The calculation is based on the expansion of the…
Let $G$ be a graph and let $f$ be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S\subseteq V(G)$, $\omega(G\setminus S)<\sum_{v\in S}(f(v)-2)+2+\omega(G[S])$, then $G$ has a spanning tree $T$…
I give explicit fromulae for full propagators of vector and scalar fields in a generic spin-1 gauge model quantized in an arbitrary linear covariant gauge. The propagators, expressed in terms of all-order one-particle-irreducible…
Recently it has been shown that in gauge theories amplitudes to any perturbation order can be obtained by glueing together simple three-point on-shell amplitudes. These three-point amplitudes in turn are fixed by locality and Lorentz…
We present new recursion relations for tree amplitudes in gauge theory that give very compact formulas. Our relations give any tree amplitude as a sum over terms constructed from products of two amplitudes of fewer particles multiplied by a…
Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of…
A spanning tree $T$ of a connected graph $G$ is a subgraph of $G$ that is a tree covers all vertices of $G$. The leaf distance of $T$ is defined as the minimum of distances between any two leaves of $T$. A fractional matching of a graph $G$…
The tree spanner problem for a graph $G$ is as follows: For a given integer $k$, is there a spanning tree $T$ of $G$ (called a tree $k$-spanner) such that the distance in $T$ between every pair of vertices is at most $k$ times their…
In this paper, we study the graph classification problem from the graph homomorphism perspective. We consider the homomorphisms from $F$ to $G$, where $G$ is a graph of interest (e.g. molecules or social networks) and $F$ belongs to some…
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…
Any practical application of the Schwinger-Dyson equations to the study of $n$-point Green's functions of a field theory requires truncations, the best known being finite order perturbation theory. Strong coupling studies require a…
We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…
Very recently planar collections of Feynman diagrams were proposed by Borges and one of the authors as the natural generalization of Feynman diagrams for the computation of $k=3$ biadjoint amplitudes. Planar collections are one-dimensional…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
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 show a direct matching between individual Feynman diagrams and integration measures in the scattering equation formalism of Cachazo, He and Yuan. The connection is most easily explained in terms of triangular graphs associated with…
We prove by explicit calculation that Feynman graphs in noncommutative Yang-Mills theory made of repeated insertions into itself of arbitrarily many one-loop ghost propagator corrections are renormalizable by local counterterms. This…
(DRAFT VERSION) In this article we present a proof of the famous Kirchoff's Matrix-Tree theorem, which relates the number of spanning trees in a connected graph with the cofactors (and eigenvalues) of its combinatorial Laplacian matrix.…
We study the no gravity limit G_{N}-> 0 of the Ponzano-Regge amplitudes with massive particles and show that we recover in this limit Feynman graph amplitudes (with Hadamard propagator) expressed as an abelian spin foam model. We show how…