Related papers: Effective estimates for the smallest parts functio…
By application of the theory for second-order linear differential equations with two turning points developed in [Olver F.W.J., Philos. Trans. Roy. Soc. London Ser. A 278 (1975), 137-174], uniform asymptotic approximations are obtained in…
A new derivation of the classic asymptotic expansion of the n-th prime is presented. A fast algorithm for the computation of its terms is also given, which will be an improvement of that by Salvy (1994). Realistic bounds for the error with…
We consider random multiplicative functions taking the values $\pm 1$. Using Stein's method for normal approximation, we prove a central limit theorem for the sum of such multiplicative functions in appropriate short intervals.
In this paper we provide improved running times and oracle complexities for approximately minimizing a submodular function. Our main result is a randomized algorithm, which given any submodular function defined on $n$-elements with range…
In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…
We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice $\Lambda \subseteq \mathbb{R}^d$ inside the $d$-sphere of radius $R$. In contrast to…
We remove logarithmic factors in error term estimates in asymptotic formulas for the number of solutions of a class of additive congruences modulo a prime number.
In this paper, we reconsider the large-$a$ asymptotic expansion of the Hurwitz zeta function $\zeta(s,a)$. New representations for the remainder term of the asymptotic expansion are found and used to obtain sharp and realistic error bounds.…
For large enough (but fixed) prime powers $q$, and trace functions to squarefree moduli in $\mathbb{F}_q[u]$ with slopes at most $1$ at infinity, and no Artin--Schreier factors in their geometric global monodromy, we come close to…
We revisit a recent bound of I. Shparlinski and T. P. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to…
We give lower bounds for the small moments of the sum of a random multiplicative function, which improve on some results of Bondarenko and Seip and constitute further progress towards (dis)proving a conjecture of Helson. We also prove…
We study the problem of parameter estimation for reflected stochastic processes driven by a standard Brownian motion. The estimator is obtained using nonlinear least squares method based on discretely observed processes. Under some certain…
We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…
Recently, the present authors derived new asymptotic expansions for linear differential equations having a simple turning point. These involve Airy functions and slowly varying coefficient functions, and were simpler than previous…
We present an asymptotic evaluation unitary formula for large argument values existing for defined class of functions. The asymptotic evaluation is obtained using only power series expansion coefficients of a function, what is a new result…
Unitary estimation is the task to estimate an unknown unitary operator $U\in\mathrm{SU}(d)$ with $n$ queries to the corresponding unitary operation, and its accuracy is evaluated by an estimation fidelity. We show that the optimal…
We prove upper bounds for sums of Kloosterman sums against general arithmetic weight functions. In particular, we obtain power cancellation in sums of Kloosterman sums over arithmetic progressions, which is of square-root strength in any…
In various applications, computers are required to compute approximations to univariate elementary and special functions such as $\exp$ and $\arctan$ to modest accuracy. This paper proposes a new heuristic for automating the design of such…
A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…
Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…