Related papers: Notes on color reductions and $\gamma$ traces
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
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…
We propose a continuous real space renormalization group transformation based on gradient flow, allowing for a numerical study of renormalization without the need for costly ensemble matching. We apply our technique in a pilot study of…
I formulate in a colour-friendly way the FKS method for the computation of QCD cross sections at the next-to-leading order accuracy. This is achieved through the definition of subtraction terms for squared matrix elements, constructed with…
For subspace estimation with an unknown colored noise, Factor Analysis (FA) is a good candidate for replacing the popular eigenvalue decomposition (EVD). Finding the unknowns in factor analysis can be done by solving a non-linear least…
Submodular function optimization has numerous applications in machine learning and data analysis, including data summarization which aims to identify a concise and diverse set of data points from a large dataset. It is important to…
High order calculation at semi-hard scale is very important, but a satisfactory calculation framework is still missing. We propose a systematic method to regularize rapidity divergences in the CGC factorization, which makes higher order…
A new algorithm for exactly sampling from the set of proper colorings of a graph is presented. This is the first such algorithm that has an expected running time that is guaranteed to be linear in the size of a graph with maximum degree \(…
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a…
Identifying the sets of operations that can be executed simultaneously is an important problem appearing in many parallel applications. By modeling the operations and their interactions as a graph, one can identify the independent…
A numerical approach to compute tensor integrals in one-loop calculations is presented. The algorithm is based on a recursion relation which allows to express high rank tensor integrals as a function of lower rank ones. At each level of…
Group Theory techniques can aid greatly the determination of magnetic structures. The integration of their calculations into new and existing refinement programs is an ongoing development that will simplify and make more rigorous the…
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO)…
We give a new, simple distributed algorithm for graph colouring in paths and cycles. Our algorithm is fast and self-contained, it does not need any globally consistent orientation, and it reduces the number of colours from $10^{100}$ to $3$…
A Mathematica package for color summed calculations in QCD (SU(Nc)) is presented. Color contractions of any color amplitude appearing in QCD may be performed, and the package uses a syntax which is very similar to how color structure is…
Color names based image representation is successfully used in person re-identification, due to the advantages of being compact, intuitively understandable as well as being robust to photometric variance. However, there exists the diversity…
Chromatic polynomials have been studied extensively, giving us results such as the Fundamental Reduction Theorem and closed formulas for the chromatic polynomials of common classes of graphs. Though, none of those extend to the context of…
We derive formulas which connect cumulants of particle numbers observed with efficiency losses with the original ones based on the binomial model. These formulas can describe the case with multiple efficiencies in a compact form. Compared…
Our previously-developed calculational method (the partial wave cutoff method) is employed to evaluate explicitly scalar one-loop effective actions in a class of radially symmetric background gauge fields. Our method proves to be…
We describe an efficient Monte Carlo algorithm for a restricted class of scattering problems in radiation transfer. This class includes many astrophysically interesting problems, including the scattering of ultraviolet and visible light by…