相关论文: General properties of multiparton webs: proofs fro…

We present first results of resumming soft gluon effects in a simulation of high energy collisions beyond the leading-colour approximation. We work to all orders in QCD perturbation theory using a new parton branching algorithm. This…

In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…

We study planar gluon scattering amplitudes and Wilson loops in non-commutative gauge theory. Our main results are: 1. We find the map between observables in non-commutative gauge theory and their holographic dual. In that map, the region…

We propose a combinatorial and graph-theoretic theory of dropout by modeling training as a random walk over a high-dimensional graph of binary subnetworks. Each node represents a masked version of the network, and dropout induces stochastic…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

The average of two Wilson loops is expressed in terms of gauge invariant field strength correlators. Assuming the existence of finite correlation length $T_g$ and taking into account the absence of a fixed direction in colour space, we…

Webs and Springer fibers are separately important objects in representation theory: webs give a diagrammatic calculus for tensor invariants of $\mathfrak{sl}_k$, and the cohomology group of Springer fibers can be used to construct the…

We consider the (multi) Splitting function of Wilson loops and MHV gluon scattering S matrix elements in N=4 SYM. At strong coupling, one can utilize the methods of Alday and Maldacena and at weak coupling (one loop) the correspondence to…

The worldline formalism shares with string theory the property that it allows one to write down master integrals that effectively combine the contributions of many Feynman diagrams. While at the one-loop level these diagrams differ only by…

In an earlier paper, the authors considered three types of graphs, and three equivalence relations, defined on a group, viz.\ the power graph, enhanced power graph, and commuting graph, and the relations of equality, conjugacy, and same…

In this paper, we use the idempotent decomposition to give an explicit isomorphism from an arbitrary semisimple Artinian ring to an external direct sum of finitely many full matrix rings over division rings.

There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…

We present new soft theorems for photon, gluon, and graviton correlators at tree level in (Anti)-de Sitter space. The results are derived by applying conformal Ward identities to constrain the structure of Witten diagrams.

In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…

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 undertake a detailed investigation into the structure of permutations in monotone grid classes whose row-column graphs do not contain components with more than one cycle. Central to this investigation is a new decomposition, called the…

We develop a general approach to finding combinatorial models for cluster algebras. The approach is to construct a labeled graph called a framework. When a framework is constructed with certain properties, the result is a model…

Following Britz, Johnsen, Mayhew and Shiromoto, we consider demi\-ma\-troids as a(nother) natural generalization of matroids. As they have shown, demi\-ma\-troids are the appropriate combinatorial objects for studying Wei's duality. Our…

In various application fields, such as fluid-, cell-, or crowd-simulations, spatial data structures are very important. They answer nearest neighbor queries which are instrumental in performing necessary computations for, e.g., taking the…

We use string-net models to accomplish a direct, purely two-dimensional, approach to correlators of two-dimensional rational conformal field theories. We obtain concise geometric expressions for the objects describing bulk and boundary…