Related papers: The Floyd-Warshall Algorithm, the AP and the TSP I…
First-order fully implicit as well as implicit--explicit schemes for coupled elliptic-parabolic systems are discussed in [Ern and Meunier, ESAIM: M2AN, 2009] and [Altmann et al., Math.\ Comp., 2021], respectively. The extension of the…
The 2-opt heuristic is a simple local search heuristic for the Travelling Salesperson Problem (TSP). Although it usually performs well in practice, its worst-case running time is poor. Attempts to reconcile this difference have used…
Starting at 3-loop order, the massive Wilson coefficients for deep-inelastic scattering and the massive operator matrix elements describing the variable flavor number scheme receive contributions of Feynman diagrams carrying quark lines…
Using quantum Monte Carlo simulations, we map out the phase diagram of Hamiltonians interpolating between trivial and non-trivial bosonic symmetry-protected topological phases, protected by $\mathbb{Z}_2$ and $\mathbb{Z}_2^3$ symmetries, in…
As experimental particle physics becomes more and more precise, it is becoming increasingly important for Monte Carlo simulations to improve the precision of their predictions. In terms of the hard matrix element, this means calculating to…
We compute the electroweak ${\cal O}(\alpha^3\alpha_s)$ corrections to three-jet production and related event-shape observables at electron-positron colliders. We properly account for the experimental photon isolation criteria and for the…
We describe a $\frac{4}{3}$-approximation algorithm for the traveling salesman problem in which the distances between points are induced by graph-theoretical distances in an unweighted graph. The algorithm is based on finding a minimum cost…
We consider Whitehead's integral formula and propose an algorithm for computing the Hopf invariant for simplicial mappings.
We present two new quantum algorithms. Our first algorithm is a generalization of amplitude amplification to the case when parts of the quantum algorithm that is being amplified stop at different times. Our second algorithm uses the first…
The particle swarm optimization (PSO) algorithm has been recently introduced in the non--linear programming, becoming widely studied and used in a variety of applications. Starting from its original formulation, many variants for…
This is the revised version of the second paper in a series introducing a generalized Fredholm theory in a new class of smooth spaces called polyfolds. The theory will be illustrated in upcoming papers by applications to Floer Theory,…
In this paper, we study different properties of the motion equations of interacting fields. In the second section, we prove that "Wightman's" fields (we use only a subset of Wightman's axioms) are unitarily equivalent to some operators on…
This paper focuses on changing Fock matrix elements of two-mode squeezed vacuum state (TMSVS) by employing three quantum operations in one-sided lossy channel. These three quantum operations include one-photon replacement (OPR), one-photon…
For any near-threshold asymptotic regime and for any Feynman diagram (involving loop and/or phase space integrals), a systematic prescription for explicitly constructing all-logs, all-powers (all-twists) expansions in perfectly factorized…
Linear approximation commonly used in solving alternating-current optimal power flow (AC-OPF) simplifies the system models but incurs accumulated voltage errors in large power networks. Such errors will make the primal-dual type gradient…
In this paper, we introduce the type-2 and the type-3 Positional Adapted Frame(PAF) of spacelike curve and timelike curve in Minkowski 3-space. From these PAFs, we study the evolutions of the electric field vectors of the type-2 and type-3…
The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse). Here, we study whether two…
The paper presents a generalization of Arnold-Falk-Winther elements for three dimensional linear elasticity, to meshes with elements of variable order. The generalization is straightforward but the stability analysis involves a non-trivial…
Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour of evolutionary algorithms for complex optimization problems…
This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Linear Programming (FSLP) methods are discussed along with…