Related papers: Notes on color reductions and $\gamma$ traces
We study the number of factorizations of a positive integer, where the parts of the factorization are of l different colors (or kinds). Recursive or explicit formulas are derived for the case of unordered and ordered, distinct and…
Perturbative calculations at next-to-next-to-leading order for multi-particle final states require a method to cancel infrared singularities. I discuss the subtraction method at NNLO. As a concrete example I consider the leading-colour…
The computation of short paths in graphs with arc lengths is a pillar of graph algorithmics and network science. In a more diverse world, however, not every short path is equally valuable. For the setting where each vertex is assigned to a…
Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…
Cell formation is a critical step in the design of cellular manufacturing systems. Recently, it was tackled using a cut-based-graph-partitioning model. This model meets real-life production systems requirements as it uses the actual amount…
Statistics about n-grams (i.e., sequences of contiguous words or other tokens in text documents or other string data) are an important building block in information retrieval and natural language processing. In this work, we study how…
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
This paper presents a theorem which solves the problem of reduction of the determinant order by means of a transformation of it, into other determinant whose each element are a determinant of second order. This implies that, if the process…
Building on recent work in SU(N) Yang-Mills theory, we construct a manifestly gauge invariant exact renormalization group for QCD. A gauge invariant cutoff is constructed by embedding the physical gauge theory in a spontaneously broken…
In this paper, we will describe a new factorization algorithm based on the continuous representation of Gauss sums, generalizable to orders j>2. Such an algorithm allows one, for the first time, to find all the factors of a number N in a…
Although the P\'olya enumeration theorem has been used extensively for decades, an optimized, purely numerical algorithm for calculating its coefficients is not readily available. We present such an algorithm for finding the number of…
Typical fermion algorithms require the computation (or sampling) of the fermion determinant. We focus instead on cluster algorithms which do not involve the determinant and involve a more physically relevant sampling of the configuration…
We develop an efficient quantum implementation of an important signal processing algorithm for line spectral estimation: the matrix pencil method, which determines the frequencies and damping factors of signals consisting of finite sums of…
We adapt the rectangular splitting technique of Paterson and Stockmeyer to the problem of evaluating terms in holonomic sequences that depend on a parameter. This approach allows computing the $n$-th term in a recurrent sequence of suitable…
These notes provide an explanation of the type classification of von Neumann algebras, which has made many appearances in recent work on entanglement in quantum field theory and quantum gravity. The goal is to bridge a gap in the literature…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
A strategy for calculating the color structure needed for soft gluon resummation for processes with any number of colored partons is introduced using a N_c --> infinity inspired basis. In this basis a general formalism can be found at the…
We consider fairness in submodular maximization subject to a knapsack constraint, a fundamental problem with various applications in economics, machine learning, and data mining. In the model, we are given a set of ground elements, each…
The determination of renormalization factors is of crucial importance. They relate the observables obtained on finite, discrete lattices to their measured counterparts in the continuum in a suitable renormalization scheme. Therefore, they…