Related papers: Minimizing storage in implementations of the overl…
A hypergraph ${\cal F}$ is a set family defined on vertex set $V$. The dual of ${\cal F}$ is the set of minimal subsets $H$ of $V$ such that $F\cap H \ne \emptyset$ for any $F\in {\cal F}$. The computation of the dual is equivalent to many…
In 1981 Hong and Kung proved a lower bound on the amount of communication needed to perform dense, matrix-multiplication using the conventional $O(n^3)$ algorithm, where the input matrices were too large to fit in the small, fast memory. In…
It has been shown that the parallel Lattice Linear Predicate (LLP) algorithm solves many combinatorial optimization problems such as the shortest path problem, the stable marriage problem and the market clearing price problem. In this…
A certain U(1) model in 2 dimensions, describing four right handed unit charged Weyl fermions interacting with one doubly charged left handed Weyl fermion, is exactly soluble and has massless Majorana-Weyl composites. Instanton induced…
This paper firstly introduces our shared Matlab source code that simulates the two optimal-ordered SIC detectors proposed in [1] and [2]. Based on our shared Matlab code, we compare the computational complexities between the two detectors…
The computational cost of many signal processing and machine learning techniques is often dominated by the cost of applying certain linear operators to high-dimensional vectors. This paper introduces an algorithm aimed at reducing the…
We present first, exploratory results of a hybrid Monte-Carlo algorithm for dynamical, n_f=2, four-dimensional QCD with overlap fermions. As expected, the computational requirements are typically two orders of magnitude larger for the…
This paper introduces a combinatorial optimization approach to register allocation and instruction scheduling, two central compiler problems. Combinatorial optimization has the potential to solve these problems optimally and to exploit…
A number of old and new methods for computing $K\to\pi\pi$ amplitudes on the lattice are reevaluated. They all involve a non-perturbative determination of matching coefficients. I will show how problems related to operator mixing can be…
This paper presents an efficient algorithm for finding the dominant trapping sets of a low-density parity-check (LDPC) code. The algorithm can be used to estimate the error floor of LDPC codes or to be part of the apparatus to design LDPC…
We present a comparison of a number of iterative solvers of linear systems of equations for obtaining the fermion propagator in lattice QCD. In particular, we consider chirally invariant overlap and chirally improved Wilson (maximally)…
On a lattice, we construct an overlap Dirac operator which describes the propagation of a Dirac fermion in external gravity. The local Lorentz symmetry is manifestly realized as a lattice gauge symmetry, while the general coordinate…
We propose to stabilise HMC simulations of lattice QCD with very light Wilson quarks by splitting the quark determinant into two factors and by treating the factor that includes the contribution of the low modes of the Dirac operator as a…
All approaches currently used to study finite baryon density lattice QCD suffer from uncontrolled systematic uncertainties in addition to the well-known sign problem. We formulate and test an algorithm, sign reweighting, that works directly…
Packing problems are an important class of optimization problems. The probably most well-known problem if this type is knapsack and many generalizations of it have been studied in the literature like Two-dimensional Geometric Knapsack…
We show how the integrators used for the molecular dynamics step of the Hybrid Monte Carlo algorithm can be further improved. These integrators not only approximately conserve some Hamiltonian $H$ but conserve exactly a nearby shadow…
Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such…
We provide a comprehensive lattice formulation of various types of the Dirac operator indices, employing $K$-theory to classify the Wilson Dirac operator via its spectral flow. In contrast to the index of the overlap Dirac operator defined…
A two-dimensional, fully numerical approach to the solution of four-component Dirac-Fock equation using the moderately long Hermitian basis of B-splines is applied to H, H2+ and H2 in a strong magnetic field. The geometric parameters,…
Consider a formally self-adjoint first order linear differential operator acting on pairs (2-columns) of complex-valued scalar fields over a 4-manifold without boundary. We examine the geometric content of such an operator and show that it…