Related papers: Tools for calculations in color space
Graph colorings is a fundamental topic in graph theory that require an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring…
With the tremendous accomplishments of RHIC and the LHC experiments and the advent of the future Electron-Ion Collider on the horizon, the quest for compelling evidence of the color glass condensate (CGC) has become one of the most aspiring…
We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…
We review on-shell and unitarity methods and discuss their application to precision predictions for LHC physics. Being universal and numerically robust, these methods are straight-forward to automate for next-to-leading-order computations…
We derive an improved prescription for the merging of matrix elements with parton showers, extending the CKKW approach. A flavour-dependent phase space separation criterion is proposed. We show that this new method preserves the logarithmic…
Color representation is essential in computer vision and human-computer interaction. There are multiple color models available. The choice of a suitable color model is critical for various applications. This paper presents a review of color…
Precision tuning or customized precision number representations is emerging, in these recent years, as one of the most promising techniques that has a positive impact on the footprint of programs concerning energy consumption, bandwidth…
Generalized Polynomial Chaos (gPC) expansions are well established for forward uncertainty propagation in many application areas. Although the associated computational effort may be reduced in comparison to Monte Carlo techniques, for…
This paper investigates methods for calculating the chromatic symmetric function (CSF) of a graph in chromatic-bases and the $m_\lambda$-basis. Our key contributions include a novel approach for calculating the CSF in chromatic-bases…
pySecDec is a program that numerically calculates dimensionally regularized integrals. We use pySecDec to compute QCD Laplace sum-rules for pseudoscalar (i.e., $J^{PC}=0^{-+}$) charmonium hybrids, and compare the results to sum-rules…
Monte Carlo simulations applied to the lattice formulation of quantum chromodynamics (QCD) enable a study of the theory from first principles, in a nonperturbative way. After over two decades of developments in the methodology for this…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
Calculations for processes involving a high multiplicity of coloured particles often employ a leading colour approximation, where only the leading terms in the expansion of the number of colours $N_c$ and the number of flavours $n_f$ are…
We consider the selective graph coloring problem, which is a generalization of the classical graph coloring problem. Given a graph together with a partition of its vertex set into clusters, we want to choose exactly one vertex per cluster…
We address the problem of finding harmonic colors, this problem has many applications, from fashion to industrial design. In order to solve this problem we consider that colors follow normal distributions in tone (chroma and lightness) and…
Surface and color codes are two forms of topological quantum error correction in two spatial dimensions with complementary properties. Surface codes have lower-depth error detection circuits and well-developed decoders to interpret and…
Standard dipole parton showers are known to yield incorrect subleading-colour contributions to the leading (double) logarithmic terms for a variety of observables. In this work, concentrating on final-state showers, we present two simple,…
Easy and effective usage of computational resources is crucial for scientific calculations. Following our recent work of machine-learning (ML) assisted scheduling optimization [Ref: J. Comput. Chem. 2023, 44, 1174], we further propose 1)…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
We demonstrate that lattice QCD calculations can be made $10^3$--$10^6$ times faster by using very coarse lattices. To obtain accurate results, we replace the standard lattice actions by perturbatively-improved actions with tadpole-improved…