Related papers: Improving Colour Computations in MadGraph5_aMC@NLO…

We use one-flavour QCD ($N_c=3$) as a proxy to understand $\mathcal{N}=1$ SYM. For our simulations, we use tree-level improved Wilson fermions and Symanzik improved gauge action. The hadron spectrum is obtained by using LapH smearing for…

The present calculations in perturbative QCD reach the order $\alpha_s^4$ for several correlators calculated to five loops, and the huge computational difficulties make unlikely the full six-loop calculation in the near future. This…

We present an index structure, called the color-index, to boost the evaluation of acyclic conjunctive queries (ACQs) over binary schemas. The color-index is based on the color refinement algorithm, a widely used subroutine for graph…

In this talk we discuss the color decomposition of tree-level and one-loop QCD amplitudes with arbitrary numbers of quarks and gluons. We present a method for the decomposition of partial amplitudes into primitive amplitudes, which is based…

We present a diagrammatic analysis of baryons in the $1/N$ expansion, where $N$ is the number of QCD colors. We use this method to show that there are an infinite number of degenerate baryon states in the large-$N$ limit. We also show that…

Different methods for the calculation of cross sections with many QCD particles are compared. To this end, CSW vertex rules, Berends-Giele recursion and Feynman-diagram based techniques are implemented as well as various methods for the…

Any loop QCD amplitude at full colour is constructed from kinematic and gauge-group building blocks. In a unitarity-based on-shell framework, both objects can be reconstructed from their respective counterparts in tree-level amplitudes.…

In this talk I report on the results of a recent calculation of the \alpha_s corrections to a three-point correlation function at the three-loop level in QCD perturbation theory, which allows one to extract the matrix element of B^0 -\bar…

Perturbative cross-sections in QCD are beset by logarithms of kinematic invariants, whose arguments vanish when heavy particles are produced near threshold. Contributions of this type often need to be summed to all orders in the coupling,…

The MadGraph5 aMC@NLO framework aims to automate all types of leading- and next-to-leading-order-accurate simulations for any user-defined model that stems from a renormalisable Lagrangian. In this paper, we present all of the key…

Inspired by the latest developments in multilevel Monte Carlo (MLMC) methods and randomised sketching for linear algebra problems we propose a MLMC estimator for real-time processing of matrix structured random data. Our algorithm is…

Coloring is a notoriously hard problem, and even more so in the online setting, where each arriving vertex has to be colored immediately and irrevocably. Already on trees, which are trivially two-colorable, it is impossible to achieve…

For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…

We propose a new proof technique that aims to be applied to the same problems as the Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve…

We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\Delta+1)$-coloring of an $n$-node graph with maximum degree $\Delta$ in…

ChatGPT said: Text-attributed graphs, where nodes and edges contain rich textual information, are widely used across diverse domains. A central challenge in this setting is question answering, which requires jointly leveraging unstructured…

We find that unitarity cuts and the duality between color and kinematics are sufficient constraints to bootstrap $D$-dimensional QCD scattering amplitudes starting from three-particle tree-level. Specifically, we calculate tree level…

Some coloring algorithms gives an upper bound for the locating chromatic number of trees with all the vertices not in an end-path colored by only two colors. That means, a better coloring algorithm could be achieved by optimizing the number…

We study next-to-leading-power (NLP) threshold corrections in colour-singlet production processes, with particular emphasis on Drell-Yan (DY) and single-Higgs production. We assess the quality of the partonic and hadronic threshold…

In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifically, we introduce a graph neural network called Colored…