相关论文: 1-loop Color structures and sunny diagrams
We initiate a systematic study of one-loop integrals by investigating the connection between their singularity structures and geometric configurations in the projective space associated to their Feynman parametrization. We analyze these…
We study quasipolynomials enumerating proper colorings, nowhere-zero tensions, and nowhere-zero flows in an arbitrary CW-complex $X$, generalizing the chromatic, tension and flow polynomials of a graph. Our colorings, tensions and flows may…
In this article we present the worldsheet integrand for one-loop amplitudes in maximally supersymmetric superstring theory involving any number n of massless open string states. The polarization dependence is organized into the same BRST…
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative…
We present new relations for scattering amplitudes of color ordered gluons, massive quarks and scalars minimally coupled to gravity. Tree-level amplitudes of arbitrary matter and gluon multiplicities involving one graviton are reduced to…
Recently, by using the known structure of one-loop scattering amplitudes for gluons in Yang-Mills theory, a recursion relation for tree-level scattering amplitudes has been deduced. Here, we give a short and direct proof of this recursion…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
A Gallai coloring of the complete graph is an edge-coloring with no rainbow triangle. This concept first appeared in the study of comparability graphs and anti-Ramsey theory. We introduce a transitive analogue for acyclic directed graphs,…
QCD possesses a compact gauge group, and this implies a non-trivial topological structure of the vacuum. In this contribution to the Gribov-85 Memorial volume, we first discuss the origin of Gribov copies and their interpretation in terms…
We establish a connection between root multiplicities for Borcherds-Kac-Moody algebras and graph coloring. We show that the generalized chromatic polynomial of the graph associated to a given Borcherds algebra can be used to give a closed…
We review some recent developments in the understanding of field theories in the perturbative regime. In particular, we discuss the notions of analyticity, unitarity and locality, and therefore the singularity structure of scattering…
For integers $n\ge 0$, an iterated triangulation $Tr(n)$ is defined recursively as follows: $Tr(0)$ is the plane triangulation on three vertices and, for $n\ge 1$, $Tr(n)$ is the plane triangulation obtained from the plane triangulation…
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…
The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of $n$ lines in $\mathbb{R}^3$…
This note presents several results in graph theory inspired by the author's work in the proof theory of linear logic; these results are purely combinatorial and do not involve logic. We show that trails avoiding forbidden transitions,…
The ground ring structure of 1+1 dimensional string theory leads to an infinite set of non linear recursion relations among the `bulk' scattering amplitudes of open and closed tachyons on the disk, which fix them uniquely. The relations are…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
In this review, we discuss recent developments concerning efficient calculations of multi-loop multi-leg scattering amplitudes. Inspired by the remarkable properties of the Loop-Tree Duality (LTD), we explain how to reconstruct an integrand…
We review two novel techniques used to calculate tree-level scattering amplitudes efficiently: MHV diagrams, and on-shell recursion relations. For the MHV diagrams, we consider applications to tree-level amplitudes and focus in particular…
We propose a new ``universal expansion" for one-loop amplitudes with arbitrary number of gluons in $D$ dimensions, which holds for general gauge theories with gluons/fermions/scalars in the loop, including pure and supersymmetric Yang-Mills…