Related papers: Generating function for web diagrams
We provide a recursive diagrammatic prescription for the exponentiation of gauge theory amplitudes involving products of Wilson lines and loops. This construction generalizes the concept of webs, originally developed for eikonal form…
We present the generating function approach to the perturbative exponentiation of correlators of a product of Wilson lines and loops. The exponentiated expression is presented in closed form as an algebraic function of correlators of known…
Soft gluon exponentiation in non-abelian gauge theories can be described in terms of webs. So far this description has been restricted to amplitudes with two hard partons, where webs were defined as the colour-connected subset of diagrams.…
I review the recent progress in studying long-distance singularities in gauge-theory scattering amplitudes in terms of Wilson lines. The non-Abelian exponentiation theorem, which has been recently generalised to the case of multi-leg…
Recently, the diagrammatic description of soft-gluon exponentiation in scattering amplitudes has been generalized to the multiparton case. It was shown that the exponent of Wilson-line correlators is a sum of webs, where each web is formed…
The non-Abelian exponentiation theorem has recently been generalised to correlators of multiple Wilson line operators. The perturbative expansions of these correlators exponentiate in terms of sets of diagrams called webs, which together…
We discuss the divergence structure of Wilson line operators with partially overlapping segments on the basis of the cyclic Wilson loop as an explicit example. The generalized exponentiation theorem is used to show the exponentiation and…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
We completely generalize previous results related to the counting of connected Feynman diagrams. We use a generating function approach, which encodes the Wick contraction combinatorics of the respective connected diagrams. Exact solutions…
We introduce a new combinatorial object called a web world that consists of a set of web diagrams. The diagrams of a web world are generalizations of graphs, and each is built on the same underlying graph. Instead of ordinary vertices the…
Generated networks are widely used in network-based research as a convenient simulation environment. Generating universal networks that more accurately reflect real-world patterns is a cornerstone task. This study proposes a vari-linear…
Gauge theories with and without matter are formulated in the derivative expansion. Amplitudues are derived as a power series in the energy scales; there are simplifications as compared with the usual loop expansion. The incorporation and…
In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of…
We analyze the perturbative cusp and closed polygons of Wilson lines for massless gauge theories in coordinate space, and express them as exponentials of two-dimensional integrals. These integrals have geometric interpretations, which link…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
The correlators of Wilson-line operators in non-abelian gauge theories are known to exponentiate, and their logarithms can be organised in terms of the collections of Feynman diagrams called Cwebs. The colour factors that appear in the…
Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…
We give a generating function for the number of graphs with given numerical properties and prescribed weighted number of connected components. As an application, we give a generating function for the number of bipartite graphs of given…
The understanding of complex quantum many-body systems has been vastly boosted by tensor network (TN) methods. Among others, excitation spectrum and long-range interacting systems can be studied using TNs, where one however confronts the…