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

A vertex colouring of a graph is \emph{nonrepetitive} if there is no path whose first half receives the same sequence of colours as the second half. A graph is nonrepetitively $k$-choosable if given lists of at least $k$ colours at each…

The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of…

We find that scattering amplitudes in massive scalar QCD can manifest the duality between color and kinematics at loop-level. Specifically we construct the one-loop integrands for four-point scattering between two distinct massive scalars,…

Graph-based retrieval-augmented generation (RAG) enriches large language models (LLMs) with external knowledge for long-context understanding and multi-hop reasoning, but existing methods face a granularity dilemma: fine-grained…

Recent progress in unitarity techniques for one-loop scattering amplitudes makes a numerical implementation of this method possible. We present a 4-dimensional unitarity method for calculating the cut-constructible part of amplitudes and…

Recent progress in the calculation of multi-loop, multi-scale diagrams is reviewed. Expansion techniques combined with new developments in Computer algebra allow to evaluate the R ratio for massive quarks up to order $\alpha_s^2$ and,…

Large Language Models (LLMs) struggle with knowledge-intensive tasks due to hallucinations and fragmented reasoning over dispersed information. While Retrieval-Augmented Generation (RAG) grounds generation in external sources, existing…

In this article, we show how to transform a colored de Bruijn graph (dBG) into a practical index for processing massive sets of sequencing reads. Similar to previous works, we encode an instance of a colored dBG of the set using BOSS and a…

We investigate the quantum chromodynamics (QCD) corrections to hadronic final states in electron-positron collisions at $\mathcal{O}(\alpha_s^3)$ in the strong coupling constant $\alpha_s$. Namely, we analytically compute the total cross…

This paper introduces GLINTS, a graphical tool for exploring variant narrowing computations in Maude. The most recent version of Maude, version 2.7.1, provides quite sophisticated unification features, including order-sorted equational…

In this paper, we propose a mathematical model for color image processing. It is a logarithmical one. We consider the cube (-1,1)x(-1,1)x(-1,1) as the set of values for the color space. We define two operations: addition <+> and real scalar…

We calculate the next-to-leading order(NLO) quantum chromodynamics(QCD) corrections to the inclusive process of $Z_0 \rightarrow B^*_c+\bar{c}+b$ under the non-relativistic QCD(NRQCD) factorization scheme. Technical details about…

We give an exponential improvement to the diagonal van der Waerden numbers for $r\ge 5$ colors.

The {\em acyclic chromatic number} of a graph is the least number of colors needed to properly color its vertices so that none of its cycles has only two colors. The {\em acyclic chromatic index} is the analogous graph parameter for edge…

Graph coloring is arguably the most exhaustively studied problem in the area of approximate counting. It is conjectured that there is a fully polynomial-time (randomized) approximation scheme (FPTAS/FPRAS) for counting the number of proper…

In this paper we discuss techniques, which lead to a significant improvement of the efficiency of the Monte Carlo integration, when one-loop QCD amplitudes are calculated numerically with the help of the subtraction method and contour…

Graph Coloring is probably one of the most studied and famous problem in graph algorithms. Exact methods fail to solve instances with more than few hundred vertices, therefore, a large number of heuristics have been proposed. Nested Monte…

The goal of this Random Walks project is to code and experiment the Markov Chain Monte Carlo (MCMC) method for the problem of graph coloring. In this report, we present the plots of cost function \(\mathbf{H}\) by varying the parameters…

Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…

We tackle three optimization problems in which a colored graph, where each node is assigned a color, must be partitioned into colorful connected components. A component is defined as colorful if each color appears at most once. The problems…