Related papers: Effective estimates for the smallest parts functio…

We construct an asymptotic approximation to the solution of a transmission problem for a body containing a region occupied by many small inclusions. The cluster of inclusions is characterised by two small parameters that determine the…

Asymptotic study on the partition function $p(n)$ began with the work of Hardy and Ramanujan. Later Rademacher obtained a convergent series for $p(n)$ and an error bound was given by Lehmer. Despite having this, a full asymptotic expansion…

This paper, we first consider the pair of complex-valued arithmetical functions (a(n),b(n)) satisfying. We prove that the solution of the Volterra integral equation of second type for the error term in the asymptotic formula for b(n) can be…

We develop a new method for studying sums of Kloosterman sums related to the spectral exponential sum. As a corollary, we obtain a new proof of the estimate of Soundararajan and Young for the error term in the prime geodesic theorem.

We establish power-saving estimates for general bilinear forms with Kloosterman sums modulo arbitrary q, including when both variables are shorter than the Polya-Vinogradov range. As an application, we obtain power-saving asymptotics for…

This paper deals with subspace estimation in the small sample size regime, where the number of samples is comparable in magnitude with the observation dimension. The traditional estimators, mostly based on the sample correlation matrix, are…

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…

Let $p(n)$ denote the partition function. In this paper our main goal is to derive an asymptotic expansion up to order $N$ (for any fixed positive integer $N$) along with estimates for error bounds for the shifted quotient of the partition…

We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced…

Recently, there has been renewed interest in studying the asymptotic properties of the integer partition function $p(n)$. Hardy, Ramanujan, and Rademacher provided detailed asymptotic analysis for $p(n)$. Presently, attention has shifted…

The main objective of this article is to study the asymptotic behavior of Salie sums over arithmetic progressions. We deduce from our asymptotic formula that Salie sums possess a bias of being positive. The method we use is based on…

We study the arithmetic (real) function, with f 'essentially bounded'. In particular, we obtain non-trivial bounds, through f 'correlations', for the 'Selberg integral' and the 'symmetry integral' of f in almost all short intervals…

In this short note, we obtain error estimates for Riemann sums of some singular functions.

Let $\spt(n)$ be the number of smallest parts in the partitions of $n$. In this paper, we give some generalized Euler-like recursive formulas for the $\spt$ function in terms of Hecke trace of values of special twisted quadratic Dirichlet…

For $m,n>0$ and $mn<0$ we estimate the sums \begin{equation*} \sum_{c \leq x} \frac{S(m,n,c,\chi)}{c}, \end{equation*} where the $S(m,n,c,\chi)$ are Kloosterman sums attached to a multiplier $\chi$ of weight $1/2$ on the full modular group.…

Bernstein's theorem (also called Hausdorff--Bernstein--Widder theorem) enables the integral representation of a completely monotonic function. We introduce a finite completely monotonic function, which is a completely monotonic function…

We obtain several estimates for bilinear form with Kloosterman sums. Such results can be interpreted as a measure of cancellations amongst with parameters from short intervals. In particular, for certain ranges of parameters we improve some…

We improve the error term in the van der Corput transform for exponential sums \sum_{a \le n \le b} g(n) exp(2\pi i f(n)). For many functions g and f, we can extract the next term in the asymptotic, showing that previous results, such as…

Probability estimation is essential for every statistical data compression algorithm. In practice probability estimation should be adaptive, recent observations should receive a higher weight than older observations. We present a…

Let $f(q)=1+\sum_{n=1}^{\infty} \alpha(n)q^n$ be the well-known third order mock theta of Ramanujan. In 1964, George Andrews proved an asymptotic formula of the form $$\alpha(n)= \sum_{c\leq\sqrt{n}}…