Related papers: Square-root cancellation for sums of factorization…

This paper focuses on regularisation methods using models up to the third order to search for up to second-order critical points of a finite-sum minimisation problem. The variant presented belongs to the framework of [3]: it employs random…

The Fast Reciprocal Square Root Algorithm is a well-established approximation technique consisting of two stages: first, a coarse approximation is obtained by manipulating the bit pattern of the floating point argument using integer…

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more…

We introduce and develop the root locus method in mathematics. And we study the distribution of zeros of meromorphic functions by root locus method.

We represent the Riemann zeta function in the half-plane $\Re s >1$ via series whose terms admit geometrically decreasing bounds. Due to an underlying recurrence relation, which is used to compute coefficients entering into the terms, the…

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

Several root-ratio multipoint methods for finding multiple zeros of univariate functions were recently presented. The characteristic of these methods is that they deal with $m$-th root of ratio of two functions (hence the name root-ratio…

Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…

Maximizing a monotone submodular function is a fundamental task in machine learning. In this paper, we study the deletion robust version of the problem under the classic matroids constraint. Here the goal is to extract a small size summary…

The decompositions of an element of a finite von Neumann algebra into the sum of a normal operator plus an s.o.t.-quasinilpotent operator, obtained using the Haagerup--Schultz hyperinvariant projections, behave well with respect to…

The location of zeros of the basic double sum over the square lattice is studied. This sum can be represented in terms of the product of the Riemann zeta function and the Dirichlet beta function, so that the assertion that all its…

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

A new deterministic algorithm for finding square divisors, and finding $r$-power divisors in general, is presented. This algorithm is based on Lehman's method for integer factorization and is straightforward to implement. While the…

We develope the $L$-functions ratios conjecture with one shift in the numerator and denominator in certain ranges for the family of quadratic Hecke $L$-functions in the Gaussian field using multiple Dirichlet series under the generalized…

Let $L(s,\chi)$ be the Dirichlet $L$-function associated to a non-principal primitive Dirichlet character $\chi$ defined modulo $q$, where $q\ge 3$. We prove, under the assumption of the Generalised Riemann Hypothesis, the validity of…

Using methods of effective field theory, factorized expressions for arbitrary B -> X_u l nu decay distributions in the shape-function region of large hadronic energy and moderate hadronic invariant mass are derived. Large logarithms are…

A promising theory of quaternion-valued functions of one quaternionic variable, now called slice regular functions, has been introduced in 2006. The basic examples of slice regular functions are power series centered at 0 on their balls of…

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The…

We investigate the approximation of quadratic Dirichlet $L$-functions over function fields by truncations of their Euler products. We first establish representations for such $L$-functions as products over prime polynomials times products…

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…