Related papers: On the error term of a lattice counting problem, I…

We outline an approach recently used to prove formulae for the multiplicative constants in the asymptotics for the sine-kernel and Airy-kernel determinants appearing in random matrix theory and related areas.

For $\Gamma$ a cocompact or cofinite Fuchsian group, we study the lattice point problem on the Riemann surface $\Gamma\backslash\mathbb{H}$. The main asymptotic for the counting of the orbit $\Gamma z$ inside a circle of radius $r$ centered…

We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The…

We derive sharp estimates comparing asymptotic Riemannian or sub-Riemannian metrics in 2-step nilpotent Lie groups. For each metric, we construct a Carnot metric whose square remains at bounded distance from the square of the original…

In this short note, we employ well-known results to improve the lower bound for the constant associated with the linear term in the asymptotic expansion of the minimal logarithmic energy on the sphere.

We prove asymptotics for the average error term in Bateman-Horn's conjecture in the exponential range.

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

Asymptotic expansions are derived for Gegenbauer (ultraspherical) polynomials for large order $n$ that are uniformly valid for unbounded complex values of the argument $z$, including the real interval $0 \leq z \leq 1$ in which the zeros in…

We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…

We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran et al,…

We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds for the error term of a counting formula given by Li and Wan,…

Current performance bounds for randomized iterative methods are often considered tight under per-iteration analyses, yet they are notoriously loose in practice. We derive asymptotic performance bounds that narrow this theory-practice gap,…

Using a recent method developed by Mahatab, we obtain an improved $\Omega$-bound for the error term arising in lattice counting problem of bodies of revolution in $\mathbb R^3$ around a coordinate axis and having smooth boundary with…

This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda(x,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi(x,y)$, is asymptotic to…

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

We very slightly improve the leading constant of the (currently best) proven asymptotic zero-free region of the Riemann zeta-function, by using an easy improvement to a trigonometric polynomial.

Recent work by M. Afifurrahman established the first asymptotic estimates with error terms for the number of $2\times 2$ matrices with fixed non-zero determinant $n\in\mathbb{N}$, and with coefficients bounded in absolute value by $X$. In…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Let $d(n)$ be the number of divisors of $n$, let $$ \Delta(x) := \sum_{n\le x}d(n) - x(\log x + 2\gamma -1) $$ denote the error term in the classical Dirichlet divisor problem, and let $\zeta(s)$ denote the Riemann zeta-function. Several…

In \cite{colin}, Y. Colin de Verdi\`ere proved that the remainder term in the two-term Weyl formula for the eigenvalue counting function for the Dirichlet Laplacian associated with the planar disk is of order $O(\lambda^{2/3})$. In this…