Related papers: The Floyd-Warshall Algorithm, the AP and the TSP I…
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification…
Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting…
Our main contributions can be divided in three parts: (1) Fixpoint extensions of first-order logic: we give a precise syntactic and semantic characterization of the relationship between $\mathrm{FO(TC^1)}$ and $\mathrm{FO(LFP)}$; (2)…
We study the structure of the phase diagram for systems consisting of 2- and 3- level particles dipolarly interacting with a 1-mode electromagnetic field, inside a cavity, paying particular attention to the case of a finite number of…
We classify a sharp phase transition threshold for Friedman's finite adjacent Ramsey theorem. We extend the method for showing this result to two previously known classifications involving Ramsey theorem variants: the Paris--Harrington…
The full-potential linearized augmented-plane wave (FP-LAPW) method is well known to enable most accurate calculations of the electronic structure and magnetic properties of crystals and surfaces. The implementation of atomic forces has…
In this paper we study the calculation of multiloop Feynman integrals that cannot be expressed in terms of multiple polylogarithms. We show in detail how certain types of two- and three-point functions at two loops, which appear in the…
In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level,…
We present new results on the summation of nonpower-series expansions in QCD Analytic Perturbation Theory (APT) in the one-loop approximation. We show how to generalize the approach suggested by one of us earlier to the cases of APT and…
Fast matrix multiplication algorithms may be useful, provided that their running time is good in practice. Particularly, the leading coefficient of their arithmetic complexity needs to be small. Many sub-cubic algorithms have large leading…
By introducing a chiral term into the Hamiltonian of the 3-state Potts model on a triangular lattice additional symmetries are achieved between the clockwise and anticlockwise states and the ferromagnetic state. This model is investigated…
This paper introduces the $3^{rd}$-order Spectral Representation Method for simulation of non-stationary and non-Gaussian stochastic processes. The proposed method extends the classical $2^{nd}$-order Spectral Representation Method to…
The implicit compact finite-difference scheme was developed for evolutionary partial differential parabolic and Schr\"odinger-type equations and systems with a weak nonlinearity. To make a temporal step of the compact implicit scheme we…
A large class of non-smooth practical optimization problems can be written as minimization of a sum of smooth and partly smooth functions. We examine such structured problems which also depend on a parameter vector and study the problem of…
The (1,2)-TSP is a special case of the TSP where each edge has cost either 1 or 2. In this paper we give a lower bound of $\frac{3}{2}$ for the approximation ratio of the 2-Opt algorithm for the (1,2)-TSP. Moreover, we show that the 3-Opt…
The non-first-order-factorizable contributions (The terms 'first-order-factorizable contributions' and 'non-first-order-factorizable contributions' have been introduced and discussed in Refs. \cite{Behring:2023rlq,Ablinger:2023ahe}. They…
The goal of this note is to fill a gap in the proof of the first two items of Theorem 5.1 in [4], which relies on Polya type inequalities and the characterization of the equality cases for monotone rearrangements given in Propositions 4.1…
We connect learning algorithms and algorithms automating proof search in propositional proof systems: for every sufficiently strong, well-behaved propositional proof system $P$, we prove that the following statements are equivalent, 1.…
In this proceeding, we highlight the computation of leading fermionic three-loop corrections to electroweak precision observables (EWPOs) accomplished recently. We summarize the numerical analysis and provide an outlook.
We introduce a semi-explicit time-stepping scheme of second order for linear poroelasticity satisfying a weak coupling condition. Here, semi-explicit means that the system, which needs to be solved in each step, decouples and hence improves…