Related papers: Factorization of Spanning Trees on Feynman Graphs
We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a…
We show how the $S$-matrix of an extended theory of gravity defined by its three-point amplitudes can be constructed by demanding factorisation. The resultant $S$-matrix has tree amplitudes obeying the same soft singularity theorems as…
Starting from the Mellin-Barnes integral representation of a Feynman integral depending on set of kinematic variables $z_i$, we derive a system of partial differential equations w.r.t.\ new variables $x_j$, which parameterize the…
In this paper, we propose new understandings for recently discovered hidden zeros and novel splittings, by utilizing Feynman diagrams. The study focus on ordered tree level amplitudes of three theories, which are ${\rm Tr}(\phi^3)$,…
Several recent works have revealed a simplicity in equal-time correlators that is absent in their wavefunction counterparts. In this letter, we show that this arises from the simple fact that the correlator is obtained by integrating…
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
We give an expression for the solution to propagator-type Dyson-Schwinger equations with one primitive at 1 loop as an expansion over rooted connected chord diagrams. Along the way we give a refinement of a classical recurrence of rooted…
Green functions in a quantum field theory can be expanded as bivariate series in the coupling and a scale parameter. The leading logs are given by the main diagonal of this expansion, i.e. the subseries where the coupling and the scale…
Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…
The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…
Following Feynman's treatment of the non-relativistic polaron problem, similar techniques are used to study relativistic field theories: after integrating out the bosonic degrees of freedom the resulting effective action is formulated in…
We re-examine a closed-string model defined by altering the boundary conditions for one handedness of two-dimensional propagators in otherwise-standard string theory. We evaluate the amplitudes using Kawai-Lewellen-Tye factorization into…
I work on a set of Feynman rules that were derived in order to incorporate the constraint of Gauss's law in the perturbation expansion of gauge field theories and calculate the interaction energy of two static sources. The constraint is…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
In an attempt to prove the Graceful Tree Conjecture, we present two propagation of graphs. The first is to propagate graceful graphs, and the second is to propagate trees from a gracefully labeled tree. The motivation in propagating such…
Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an increasing sequence. Hallam and Sagan showed that the generating…
We derive a variant of the loop-tree duality for Feynman integrals in the Schwinger parametric representation. This is achieved by decomposing the integration domain into a disjoint union of cells, one for each spanning tree of the graph…
Graph-based semantic representations are valuable in natural language processing, where it is often simple and effective to represent linguistic concepts as nodes, and relations as edges between them. Several attempts has been made to find…
We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the DGM net. The recursions allow for many large-scale properties…
In this article we present new results about the expressivity of Graph Neural Networks (GNNs). We prove that for any GNN with piecewise polynomial activations, whose architecture size does not grow with the graph input sizes, there exists a…