Related papers: On an approximate functional equation involving th…

Asymptotic properties of certain arithmetic functions involving exponential divisors are investigated.

Improving and extending recent results of the author, we conditionally estimate exponential sums with Dirichlet coefficients of L-functions, both over all integers and over all primes in an interval. In particular, we establish new…

For the pure biharmonic equation and a biharmonic singular perturbation problem, a residual-based error estimator is introduced which applies to many existing nonconforming finite elements. The error estimator involves the local…

In [arXiv:2212.04969], the authors stated some conjectures on the variance of certain sums of the divisor function $d_k(n)$ over number fields, which were inspired by analogous results over function fields proven in [arXiv:2107.01437].…

We compute the variances of sums in arithmetic progressions of generalised k-divisor functions related to certain L-functions in $\mathbb{F}_q(t)$, in the limit as $q\to\infty$. This is achieved by making use of recently established…

There has recently been some interest in optimizing the error term in the asymptotic for the fourth moment of Dirichlet L-functions and a closely related mixed moment of L-functions involving automorphic L-functions twisted by Dirichlet…

We introduce the error-sum function of Pierce expansions. Some basic properties of the error-sum function are analyzed. We also examine the fractal property of the graph of it by calculating the Hausdorff dimension, the box-counting…

In this paper, several modifications are introduced to the functional approximation method iterLap to reduce the approximation error, including stopping rule adjustment, proposal of new residual function, starting point selection for…

Here we introduce a generalization of the exponential sampling series of optical physics and establish pointwise and uniform convergence theorem, also in a quantitative form. Moreover we compare the error of approximation for Mellin…

The method of self-similar factor approximants is shown to be very convenient for solving different evolution equations and boundary-value problems typical of physical applications. The method is general and simple, being a straightforward…

Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…

In applied probability, the normal approximation is often used for the distribution of data with assumed additive structure. This tradition is based on the central limit theorem for sums of (independent) random variables. However, it is…

In the paper we consider the problem of multivariate function approximation in polynomial basis. In order to solve this problem, we adjust the least squares method (LSM) by adding information about derivatives of the function. This…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

In this paper we study the mean values of some multiplicative functions connected with the divisor function on the short interval of summation. The asymptocic values for such mean values are proved.

We prove a new equidistribution estimate for the divisor function in arithmetic progression to moduli that have two small factors. We give two applications. First, we show an asymptotic formula for the divisor function over arithmetic…

In this paper we shall consider some famous means such as arithmetic, harmonic, geometric, root square mean, etc. Considering the difference of these means, we can establish. some inequalities among them. Interestingly, the difference of…

An NP-hard combinatorial optimization problem $\Pi$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $\Pi$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard…

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

An adjustable algorithm of exclusion of conditional equations with excessive residuals is proposed. The criteria applied in the algorithm use variable exclusion limits which decrease as the number of equations goes down. The algorithm is…