Related papers: Notes on color reductions and $\gamma$ traces
Motivated by the need for efficient isomorphism tests for finite groups, we present a polynomial-time method for deciding isomorphism within a class of groups that is well-suited to studying local properties of general finite groups. We…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We reconsider the lattice measurement of Green functions in Coulomb gauge, both in 2+1 and 3+1 dimensions, using an improved gauge fixing scheme. The influence of Gribov copies is examined and we find clear indications that Green functions…
Distributed algorithms are often beset by the straggler effect, where the slowest compute nodes in the system dictate the overall running time. Coding-theoretic techniques have been recently proposed to mitigate stragglers via algorithmic…
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…
Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with $\Delta+1$ colors, where $\Delta$ denotes the maximum degree. Using $\Delta+1$ colors may be…
We extend Zirnbauer's color-flavor transformation in the fermionic sector to the case of the special unitary group. The transformation allows a certain integral over SU(N_c) color matrices to be transformed into an integral over flavor…
Parton shower algorithms are key components of theoretical predictions for high-energy collider physics. Work towards more accurate parton shower algorithms is thus pursued along many different avenues. The systematic treatment of…
We deduce a simple representation and the invariant factor decompositions of the subgroups of the group $\Bbb{Z}_m \times \Bbb{Z}_n$, where $m$ and $n$ are arbitrary positive integers. We obtain formulas for the total number of subgroups…
We report on numerical studies of RG decimations in SU(2) gauge theory. We study in particular a class of plaquette actions involving sums of group representations. We measure a number of observables representative of different length…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
A class of algorithms for the Landau gauge fixing is proposed, which makes the steepest ascent (SA) method be more efficient by concepts of genetic algorithm. Main concern is how to incorporate random gauge transformation (RGT) %, mutation…
The Green's function method is recognized to be a very powerful tool for modelling quantum transport in nanoscale electronic devices. As atomistic calculations are generally expensive, numerical methods and related algorithms have been…
(First-order) transductions are a basic notion capturing graph modifications that can be described in first-order logic. In this work, we propose an efficient algorithmic method to approximately reverse the application of a transduction,…
Quantum simulations of lattice gauge theories offer the potential to directly study the non-perturbative dynamics of quantum chromodynamics, but naive analyses suggest that they require large computational resources. Large $N_c$ expansions…
There are many variations on partition functions for graph homomorphisms or colorings. The case considered here is a counting or hard constraint problem in which the range or color graph carries a free and vertex transitive Abelian group…
The randomized technique of color coding is behind state-of-the-art algorithms for estimating graph motif counts. Those algorithms, however, are not yet capable of scaling well to very large graphs with billions of edges. In this paper we…
Variational algorithms are a promising paradigm for utilizing near-term quantum devices for modeling electronic states of molecular systems. However, previous bounds on the measurement time required have suggested that the application of…
We present an algorithm to enumerate isometry classes of integral quadratic lattices of a given rank and determinant, and analyze its running time by giving bounds on the number of genus symbols for a fixed rank and determinant. We build on…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…