相关论文: Improving Colour Computations in MadGraph5_aMC@NLO…

At very high energies scattering amplitudes in a spontaneously broken gauge theory into multi-particle final states are known to grow factorially with the number of particles produced. Using simple scalar field theory models with and…

In nonrelativistic Quantum Chromodynamics (NRQCD), we study the next-to-leading order (NLO) QCD radiative correction to the color-octet $J/\psi$ inclusive production at B Factories. Compared with the leading-order (LO) result, the NLO QCD…

We explore the on-shell recursion for tree-level scattering amplitudes with massive spinning particles. Based on the factorization structure encoded in the same way by two different recursion relations, we conjecture an all-multiplicity…

We present a method for performing a full graph expansion for light-matter systems, utilizing the linked-cluster theorem. This method enables us to explore $1/N$ corrections to the thermodynamic limit $N\to \infty$ in the number of…

We present a joint likelihood analysis of the real-space power spectrum and bispectrum measured from a variety of halo and galaxy mock catalogs. A novel aspect of this work is the inclusion of nonlinear triangle configurations for the…

In the Coloured Clustering problem, we wish to colour vertices of an edge coloured graph to produce as many stable edges as possible, i.e., edges with the same colour as their ends. In this paper, we reveal that the problem is in fact a…

The CUDACPP plugin for MadGraph5_aMC@NLO aims to accelerate leading order tree-level event generation by providing the MadEvent event generator with data-parallel helicity amplitudes. These amplitudes are written in templated C++ and CUDA,…

Mixed-precision computing has the potential to significantly reduce the cost of exascale computations, but determining when and how to implement it in programs can be challenging. In this article, we propose a methodology for enabling…

Guessing Random Additive Noise Decoding (GRAND) and its variants, known for their near-maximum likelihood performance, have been introduced in recent years. One such variant, Segmented GRAND, reduces decoding complexity by generating only…

In the large N_c(number of colors) limit, quenched QCD and QCD are identical. This implies that, in the effective field theory framework, some of the low energy constants in (N_c=3) quenched QCD and QCD are the same up to higher-order…

Cell imaging and analysis are fundamental to biomedical research because cells are the basic functional units of life. Among different cell-related analysis, cell counting and detection are widely used. In this paper, we focus on one common…

We introduce graphical error-correcting codes, a new notion of error-correcting codes on $[q]^n$, where a code is a set of proper $q$-colorings of some fixed $n$-vertex graph $G$. We then say that a set of $M$ proper $q$-colorings of $G$…

Consider the following game. We are given a tree $T$ and two players (say) Alice and Bob who alternately colour an edge of a tree (using one of $k$ colours). If all edges of the tree get coloured, then Alice wins else Bob wins. Game…

We consider the decoding of LDPC codes over GF(q) with the low-complexity majority algorithm from [1]. A modification of this algorithm with multiple thresholds is suggested. A lower estimate on the decoding radius realized by the new…

We study weighted edge coloring of graphs, where we are given an undirected edge-weighted general multi-graph $G := (V, E)$ with weights $w : E \rightarrow [0, 1]$. The goal is to find a proper weighted coloring of the edges with as few…

We consider sparse superposition codes (SPARCs) over complex AWGN channels. Such codes can be efficiently decoded by an approximate message passing (AMP) decoder, whose performance can be predicted via so-called state evolution in the…

We discuss precision Monte Carlo (MC) calculations for solving the QCD evolution equations up to the next-to-leading-order (NLO) level. They employ forward Markovian Monte Carlo algorithms, which provide rigorous solutions of the above…

This work presents the first study of using the popular Monte Carlo Tree Search (MCTS) method combined with dedicated heuristics for solving the Weighted Vertex Coloring Problem. Starting with the basic MCTS algorithm, we gradually…

This paper discusses reformulations of the problem of coloring plane maps with four colors. We give a number of alternate ways to formulate the coloring problem including a tautological expansion similar to the Penrose Bracket, and an…

We present an interface between PineAPPL and Matrix, which allows fully differential cross sections to be calculated in the form of interpolation grids, accurate at next-to-next-to-leading order (NNLO) in QCD and next-to-leading order in…