Related papers: Improving Colour Computations in MadGraph5_aMC@NLO…
We study predictions from perturbative Quantum Chromodynamics (QCD) for the process pp -> H -> gamma gamma + X. In particular, we compare fully differential calculations at next-to-leading (NLO) and next-to-next-to-leading order (NNLO) in…
We give an online algorithm that with high probability computes a $\left(\frac{e}{e-1} + o(1)\right)\Delta$ edge coloring on a graph $G$ with maximum degree $\Delta = \omega(\log n)$ under online edge arrivals against oblivious adversaries,…
In this work, we revisit unweighted event generation for multi-parton tree-level processes in massless QCD. We introduce a two-step approach, in which initially unweighted events are generated at leading-colour (LC) accuracy, followed by a…
We present new randomized algorithms that improve the complexity of the classic $(\Delta+1)$-coloring problem, and its generalization $(\Delta+1)$-list-coloring, in three well-studied models of distributed, parallel, and centralized…
In this article we present a number of developments within the scheme of Local Analytic Sector Subtraction for infrared divergences in QCD. First, we extend the scheme to deal with next-to-leading-order (NLO) singularities related to…
We suggest a new approach for the automatic and fully numerical evaluation of one-loop scattering amplitudes in perturbative quantum field theory. We use suitably formulated dispersion relations to perform the calculation as a convolution…
Recently we introduced the chirality-flow formalism, a method which builds on the spinor-helicity formalism and is inspired by the color-flow idea in QCD. With this formalism, Feynman rules and diagrams are simplified to the extent that it…
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…
For a graph $G$, we show that if $mad(G)<m$, then $\chi'_\ell(G)\leq \Delta+1$ where $m$ depends upon $\Delta$ and $\chi'_\ell(G)$ is the list-chromatic index of $G$. When $\Delta\leq 20$ the value of $m$ is close to $\frac{1}{2}\Delta$,…
A randomized algorithm for computing a data sparse representation of a given rank structured matrix $A$ (a.k.a. an $H$-matrix) is presented. The algorithm draws on the randomized singular value decomposition (RSVD), and operates under the…
The quest for colorful components (connected components where each color is associated with at most one vertex) inside a vertex-colored graph has been widely considered in the last ten years. Here we consider two variants, Minimum Colorful…
Estimating the trace of the inverse of a large matrix is an important problem in lattice quantum chromodynamics. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials for the levels. The…
We present a Monte Carlo approach to soft-gluon resummation at subleading color which can be used to improve existing parton shower algorithms. At the single-emission level, soft-collinear enhancements of the splitting functions are…
Many complex systems and datasets are characterized by multiway interactions of different categories, and can be modeled as edge-colored hypergraphs. We focus on clustering such datasets using the NP-hard edge-colored clustering problem,…
I report on an implementation of an algorithm for the automated numerical calculation of spin- and colour-correlated Born matrix elements in QCD. These spin- and colour-correlated matrix elements are needed for NLO calculations in…
We establish that every monadic second-order logic (MSO) formula on graphs with bounded treedepth is decidable in a constant number of rounds within the CONGEST model. To our knowledge, this marks the first meta-theorem regarding…
In this paper, we consider a weighted generalization of the chromatic number of a Binomial random graph~\(G.\) We equip each edge with a random weight and then colour the vertices in such a way that the absolute colour difference between…
Mathematical reasoning presents significant challenges for large language models (LLMs). To enhance their capabilities, we propose Monte Carlo Self-Refine Tree (MC-NEST), an extension of Monte Carlo Tree Search that integrates LLM-based…
We prove new bounds on the distributed fractional coloring problem in the LOCAL model. Fractional $c$-colorings can be understood as multicolorings as follows. For some natural numbers $p$ and $q$ such that $p/q\leq c$, each node $v$ is…
The quantum color coding scheme proposed by Korff and Kempe (quant-ph/0405086) is easily extended so that the color coding quantum system is allowed to be entangled with an extra auxiliary quantum system. It is shown that in the extended…