Related papers: Solving the quintic by iteration in three dimensio…
This is the first part of a threefold article, aimed at solving numerically the Poisson problem in three-dimensional prismatic or axisymmetric domains. In this first part, the Fourier Singular Complement Method is introduced and analysed,…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
In this paper we present a unified method for solving general polynomial equations of degree less than five.
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
Quantum signal processing (QSP) is a framework which was proven to unify and simplify a large number of known quantum algorithms, as well as discovering new ones. QSP allows one to transform a signal embedded in a given unitary using…
We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the $\rho$-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be…
In this paper, we classify the algebraic isomonodromic deformations that can be obtained through restriction to generic lines of logarithmic flat connections on the complex projective plane $\mathbb{P}^2_\mathbb{C}$ whose singular locus is…
In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…
A parallel algorithm for solving a series of matrix equations with a constant tridiagonal matrix and different right-hand sides is proposed and studied. The process of solving the problem is represented in two steps. The first preliminary…
A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
The computation of Feynman integrals often involves square roots. One way to obtain a solution in terms of multiple polylogarithms is to rationalize these square roots by a suitable variable change. We present a program that can be used to…
The signaling dimension of any given physical system represents its classical simulation cost, that is, the minimum dimension of a classical system capable of reproducing all the input/output correlations of the given system. The signaling…
The aim of this study is to show that harmonic geometric polynomials can be represented in terms of geometric polynomials. This problem was first considered by Keller [14]; however, the corresponding coefficients were not fully determined.…
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…
We give a new complexity bound for calculating the complex dimension of an algebraic set. Our algorithm is completely deterministic and approaches the best recent randomized complexity bounds. We also present some new, significantly sharper…
We present a new algorithm to decompose generic spinor polynomials into linear factors. Spinor polynomials are certain polynomials with coefficients in the geometric algebra of dimension three that parametrize rational conformal motions.…
We use a non-invertible symmetry to construct a three-zero texture for the down-type quark mass matrix, which can resolve the strong CP problem without invoking the axion, in four-dimensional spacetime with three quark families in QCD. We…
We evaluate the three-loop five-point pentagon-box-box massless integral family in the dimensional regularization scheme, via canonical differential equation. We use tools from computational algebraic geometry to enable the necessary…
We consider a single particle which is bound by a central potential and obeys the Dirac equation in d dimensions. We first apply the asymptotic iteration method to recover the known exact solutions for the pure Coulomb case. For a…