Related papers: Summing One-Loop Graphs at Multi-Particle Threshol…
In this note we study on-shell tree-level gravity amplitudes in the infinite momentum limit. In the case of the two-line BCFW shift, we have a famous improved behavior at infinity that allows for the amplitude to be reconstructed from the…
We prove a metric space scaling limit for a critical random graph with independent and identically distributed degrees having power-law tail behaviour with exponent $\alpha+1$, where $\alpha \in (1,2)$. The limiting components are…
Loop measures and their associated loop soups are generally viewed as arising from finite state Markov chains. We generalize several results to loop measures arising from potentially complex edge weights. We discuss two applications:…
One-loop amplitudes are to a large extent determined by their unitarity cuts in four dimensions. We show that the remaining rational terms can be obtained from the ultraviolet behaviour of the amplitude, and determine universal form factors…
The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in…
We solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs.…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
We present a technique which utilizes unitarity and collinear limits to construct ansatze for one-loop amplitudes in gauge theory. As an example, we obtain the one-loop contribution to amplitudes for $n$ gluon scattering in $N=4$…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
Effective potential for scalar $\lambda\phi^4$ theory is obtained using the exact renormalization group method which includes both the usual one-loop contribution as well as the dominant higher loop effects. Our numerical calculation…
Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…
One-loop amplitudes of gluons in N=4 gauge theory can be written as linear combinations of known scalar box integrals with coefficients that are rational functions. In this paper we show how to use generalized unitarity to basically read…
We present a set of algebraic functions for evaluating the coefficients of the scalar integral basis of a general one-loop amplitude. The functions are derived from unitarity cuts, but the complete cut-integral procedure has been carried…
We consider a uniform spanning tree in a $\delta$-square grid approximation of a planar domain $\Omega$. For given integer $n\ge 2$, we condition the tree on the following $n$-arm event: we pick $n$ branches, emanating from $n$ points…
We present an example of a result in graph theory that is used to obtain a result in another branch of mathematics. More precisely, we show that the isomorphism of certain directed graphs implies that some trinomials over finite fields have…
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…
We have looked for evidence of large cross sections at large multiplicities in weakly coupled scalar field theory in three dimensions. We use spectral function sum rules to derive bounds on total cross sections where the sum can be expresed…
We formulate new integration rules for one-loop scattering equations analogous to those at tree-level, and test them in a number of non-trivial cases for amplitudes in scalar $\phi^3$-theory. This formalism greatly facilitates the…
We emphasize that scattering amplitudes of a wide class of models to any order in the coupling are constructible by on-shell tree subamplitudes. This follows from the Feynman-tree theorem combined with BCFW on-shell recursion relations. In…
Measuring the complexity of tree structures can be beneficial in areas that use tree data structures for storage, communication, and processing purposes. This complexity can then be used to compress tree data structures to their…