相关论文: General properties of multiparton webs: proofs fro…
This work focuses on the combinatorial properties of glued semigroups and provides its combinatorial characterization. Some classical results for affine glued semigroups are generalized and some methods to obtain glued semigroups are…
An interval in a combinatorial structure S is a set I of points which relate to every point from S I in the same way. A structure is simple if it has no proper intervals. Every combinatorial structure can be expressed as an inflation of a…
In this work we employ the MHV technique to show that scattering amplitudes with any number of consecutive soft particles behave universally in the multi-soft limit in which all particles go soft simultaneously. After identifying the…
The non-vanishing of gluonic pole matrix elements can explain the appearance of single spin asymmetries in high-energy scattering processes. We use a spectator framework approach to investigate the spectral properties of quark-quark-gluon…
Homogeneous power counting in Non-Relativistic QCD (NRQCD) implies the simultaneous existence of both soft and ultrasoft gluons. In the velocity renormalization group (vNRQCD) formalism we show that operators involving soft fields…
A strong interaction is known to exist between edge-colored graphs (which encode PL pseudo-manifolds of arbitrary dimension) and random tensor models (as a possible approach to the study of Quantum Gravity). The key tool is the {\it…
Matrix elements of Wilson-line dressed operators play a central role in the factorization of soft and collinear modes in gauge theories. When expressed using spinor helicity variables, these so-called form factors admit a classification…
Soft theorems in gauge theory and gravity encode the universal properties of scattering amplitudes as the zero frequency limit of one or more external states is approached. When the participating particles are treated in the massless limit,…
In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…
We study the combinatorial and algebraic properties of Nonnegative Matrices. Our results are divided into three different categories. 1. We show a quantitative generalization of the 100 year-old Perron-Frobenius theorem, a fundamental…
Open Wilson line operators and generalized star product have been studied extensively in noncommutative gauge theories. We show that they also show up in noncommutative scalar field theories as universal structures. We first point out that…
Absence of (complex) zeros property is at the heart of the interpolation method developed by Barvinok \cite{barvinok2017combinatorics} for designing deterministic approximation algorithms for various graph counting and computing partition…
Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…
We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete…
The contributions of scalars and fermions to the null polygonal bosonic Wilson loops/gluon MHV scattering amplitudes in $\mathcal{N} = 4$ SYM are considered. We first examine the re-summation of scalars at strong coupling. Then, we…
We prove that a planar graph is generically rigid in the plane if and only if it can be embedded as a pseudo-triangulation. This generalizes the main result of math.CO/0307347 which treats the minimally generically rigid case. The proof…
We present results for Wilson loops in strongly coupled gauge theories. The loops may be taken around an arbitrarily shaped contour and in any field theory with a dual IIB geometry of the form M x S^5. No assumptions about supersymmetry are…
A graph can be regarded as an electrical network in which each edge is a resistor. This point of view relates combinatorial quantities, such as the number of spanning trees, to electrical ones such as effective resistance. The second and…
We study entanglement properties of mixed density matrices obtained from combinatorial Laplacians. This is done by introducing the notion of the density matrix of a graph. We characterize the graphs with pure density matrices and show that…
We give a direct combinatorial proof that the product of two descent classes in a symmetric group is a sum of descent classes. The proof is based on the fact that the group product gives a covering map when descent classes are endowed with…