Related papers: A link between error terms when counting smooth an…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

In certain applications involving the solution of a Bayesian inverse problem, it may not be possible or desirable to evaluate the full posterior, e.g. due to the high computational cost of doing so. This problem motivates the use of…

We provide very effective methods to convert both asymptotic and explicit numeric bounds on the prime counting function $\psi(x)$ to bounds of the same type on both $\theta(x)$ and $\pi(x)$. This follows up our previous work on $\psi(x)$ in…

In this paper, we explore statistical versus computational trade-off to address a basic question in the application of a distributed algorithm: what is the minimal computational cost in obtaining statistical optimality? In smoothing spline…

We study a finite form of the classical interval discrepancy problem. Starting from the unit interval, one repeatedly splits an existing interval into two until $n$ intervals have been produced. The discrepancy of such a process is the…

Evaluating the log-sum-exp function or the softmax function is a key step in many modern data science algorithms, notably in inference and classification. Because of the exponentials that these functions contain, the evaluation is prone to…

We make two contributions to the problem of estimating the $L_1$ calibration error of a binary classifier from a finite dataset. First, we provide an upper bound for any classifier where the calibration function has bounded variation.…

We explore the covariance of error terms coming from Weyl's conjecture regarding the number of Dirichlet eigenvalues up to size $X$. We also consider this problem in short intervals, i.e. the error term of the number of eigenvalues in the…

Due to their importance in both data analysis and numerical algorithms, low rank approximations have recently been widely studied. They enable the handling of very large matrices. Tight error bounds for the computationally efficient…

We consider the summatory function of the totient function after applications of a suitable smoothing operator and study the limiting behavior of the associated error term. Under several conditional assumptions, we show that the smoothed…

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

The non-linear sewing lemma constructs flows of rough differential equations from a braod class of approximations called almost flows. We consider a class of almost flows that could be approximated by solutions of ordinary differential…

$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…

In regression analysis one wants to estimate the regression function from a data. In this paper we consider the rate of convergence for the nearest neighbor estimator in case that the regression function is $(p,C)$-smooth. It is an open…

We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity…

We obtain non-symmetric upper and lower bounds on the rate of convergence of general monotone approximation/numerical schemes for parabolic Hamilton Jacobi Bellman Equations by introducing a new notion of consistency. We apply our general…

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,…

We improve upon the traditional error term in the truncated Perron formula for the logarithm of an $L$-function. All our constants are explicit.

There is a large literature on the asymptotic distribution of numbers free of large prime factors, so-called $\textit{smooth}$ or $\textit{friable}$ numbers. But there is very little known about this distribution that is numerically…

For Gaussian random fields with values in $\mathbb{R}^d$, sharp upper and lower bounds on the probability of hitting a fixed set have been available for many years. These apply in particular to the solutions of systems of linear SPDEs. For…