Related papers: The Floyd-Warshall Algorithm, the AP and the TSP I…
Standard Ewald sums, which calculate e.g. the electrostatic energy or the force in periodically closed systems of charged particles, can be efficiently speeded up by the use of the Fast Fourier Transformation (FFT). In this article we…
We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of…
We here calculate the series expansion of the T-matrix for a spheroidal particle in the small-size/long-wavelength limit, up to third lowest order with respect to the size parameter, X, which we will define rigorously for a non-spherical…
We present recent analytic results for the 3-loop corrections to the massive operator matrix element $A_{Qg}^{(3)}$for further color factors. These results have been obtained using the method of arbitrarily large moments. We also give an…
We report on the three-loop unpolarized and polarized massive operator matrix elements, with single- and two-mass corrections, and the associated deep-inelastic massive Wilson coefficients in the region $Q^2 \gg m_Q^2$, the calculation of…
An extension to the P3M algorithm for electrostatic interactions is presented, that allows to efficiently compute dipolar interactions in periodic boundary conditions. Theoretical estimates for the root-mean square error of the forces,…
Denote by $T_n^d(A)$ an upper triangular operator matrix of dimension $n$ whose diagonal entries are given and the others are unknown. In this article we provide necessary and sufficient conditions for various types of Fredholm and Weyl…
We initiate explicit computations of Vafa-Witten invariants of 3-manifolds, analogous to Floer groups in the context of Donaldson theory. In particular, we explicitly compute the Vafa-Witten invariants of 3-manifolds in a family of concrete…
We consider worst case time bounds for NP-complete problems including 3-SAT, 3-coloring, 3-edge-coloring, and 3-list-coloring. Our algorithms are based on a constraint satisfaction (CSP) formulation of these problems; 3-SAT is equivalent to…
This version of the paper corrects an inaccuracy in the proof of Theorem 2.9 in the published version. The main results remain unchanged.
In this paper, we give an algorithm for detecting non-trivial 3-APs in multiplicative subgroups of $\mathbb{F}_p^\times$ that is substantially more efficient than the naive approach. It follows that certain Var der Waerden-like numbers can…
We lay the foundations of a new theory for algorithms and computational complexity by parameterizing the instances of a computational problem as a moduli scheme. Considering the geometry of the scheme associated to 3-SAT, we separate P and…
We discuss the calculation of two-point three-loop functions with an arbitrary number of massive propagators and one large external momentum. The relevant subdiagrams are generated automatically. The resulting massless two-point integrals…
This paper introduces a new method for constructing approximate solutions to a class of Wiener--Hopf equations. This is particularly useful since exact solutions of this class of Wiener--Hopf equations, at the moment, cannot be obtained.…
It is known that Goertzel's algorithm is much less numerically accurate than the Fast Fourier Transform (FFT)(Cf. \cite{gen:69}). In order to improve accuracy we propose modifications of both Goertzel's and Horner's algorithms based on the…
In this work we revisit the Hopfield-Tank algorithm for the traveling salesman problem (TSP) and report encouraging results, with a different dynamics, that makes the algorithm more efficient finding better solutions in much less…
3-loop diagrams of the ladder-type, which emerge for local quarkonic twist-2 operator matrix elements, are computed directly for general values of the Mellin variable $N$ using Appell-function representations and applying modern summation…
Monte Carlo simulations of systems with a complex action are known to be extremely difficult. A new approach to this problem based on a factorization property of distribution functions of observables has been proposed recently. The method…
Iterative phase retrieval algorithms are widely used in digital optics for their efficiency and simplicity. Conventionally, these algorithms do not consider aberrations as they assume an ideal, aberration-free optical system. Here, we…
We propose an arbitrarily higher (even) order implicit leapfrog scheme for time discretization of a three-field formulation of Maxwell's equations. We use this in conjunction with an arbitrarily higher-order and compatible discretization…