Related papers: Improving Colour Computations in MadGraph5_aMC@NLO…
We present the interface between MadGraph5_aMC@NLO, a self-contained program that calculates cross sections up to next-to-leading order accuracy in an automated manner, and APPLgrid, a code that parametrises such cross sections in the form…
In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…
The matrix element (ME) calculation in any Monte Carlo physics event generator is an ideal fit for implementing data parallelism with lockstep processing on GPUs and vector CPUs. For complex physics processes where the ME calculation is the…
We propose an implementation of ZZ, ZZj and ZZjj productions in MadGraph5_aMC@NLO framework at $\sqrt{s}$ = 14 TeV. We calculate these processes at leading order and next-to-leading order with QCD corrections and we present a theoretical…
We present the key features relevant to the automated computation of all the leading- and next-to-leading order contributions to short-distance cross sections in a mixed-coupling expansion, with special emphasis on the first subleading NLO…
I formulate in a colour-friendly way the FKS method for the computation of QCD cross sections at the next-to-leading order accuracy. This is achieved through the definition of subtraction terms for squared matrix elements, constructed with…
We propose a Multi-level Monte Carlo technique to accelerate Monte Carlo sampling for approximation of properties of materials with random defects. The computational efficiency is investigated on test problems given by tight-binding models…
We present an algorithm to evaluate the exact, tree-level matrix elements for multi-parton processes in QCD. We tested this technique, based on the recursive evaluation of the S-matrix, on processes such as gg -> n gluons and q qbar -> n…
The problem of counting occurrences of query graphs in a large data graph, known as subgraph counting, is fundamental to several domains such as genomics and social network analysis. Many important special cases (e.g. triangle counting)…
The first production release of the CUDACPP plugin for the Madgraph5_aMC@NLO generator, which speeds up matrix element (ME) calculations for leading-order (LO) processes using a data parallel approach on vector CPUs and GPUs, was delivered…
We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
MadGraph5_aMC@NLO is a software package that allows one to simulate processes of arbitrary complexity, at both the leading and the next-to-leading order perturbative accuracy, with or without matching and multi-jet merging to parton…
We study the maintenance of a $(\Delta+C)$-edge-coloring ($C\ge 1$) in a fully dynamic graph $G$ with maximum degree $\Delta$. We focus on minimizing \emph{recourse} which equals the number of recolored edges per edge updates. We present a…
Quantum chromodynamics (QCD) with a general number of colors, $\Nc$, provides a powerful theoretical laboratory to explore the dynamics of non-Abelian gauge theories. Although $\Nc =3$ does not look a large number, the $1/\Nc$ expansion…
We review techniques for more efficient computation of perturbative scattering amplitudes in gauge theory, in particular tree and one-loop multi-parton amplitudes in QCD. We emphasize the advantages of (1) using color and helicity…
As the quality of experimental measurements increases, so does the need for Monte Carlo-generated simulated events - both with respect to the total amount and to their precision. In perturbative methods, this involves the evaluation of…
We present a new Monte Carlo tool that computes full tree-level matrix elements in high-energy physics. The program accepts user-defined models and has no restrictions on the process multiplicity. To achieve acceptable performance, CAMORRA…
Large language models often fail on multi-step reasoning due to fixed reasoning strategies that ignore problem specific difficulty. We introduce CARD (Complexity Agnostic Recursive Decomposition), a framework that predicts problem…
We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the chromatic index of (multi)graphs in terms of their maximum…