Related papers: Explicit and Effective Estimates for the error ter…
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…
We consider the a posteriori error analysis of approximations of parabolic problems based on arbitrarily high-order conforming Galerkin spatial discretizations and arbitrarily high-order discontinuous Galerkin temporal discretizations.…
In this article, we provide a comprehensive analysis of the asymptotic behavior of Bell numbers, enhancing and unifying various results previously dispersed in the literature. We establish several explicit lower and upper bounds. The main…
Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…
Causal inference problems often involve continuous treatments, such as dose, duration, or frequency. However, identifying and estimating standard dose-response estimands requires that everyone has some chance of receiving any level of the…
We present a hybrid a-priori/a-posteriori goal oriented error estimator for a combination of dynamic iteration-based solution of ordinary differential equations discretized by finite elements. Our novel error estimator combines estimates…
This paper studies hypothesis testing and parameter estimation in the context of the divide and conquer algorithm. In a unified likelihood based framework, we propose new test statistics and point estimators obtained by aggregating various…
New expansions for some functions related to the Zeta function in terms of the Pochhammer's polynomials are given (coefficients b(k), d(k), d_(k) and d__(k). In some formal limit our expansion b(k) obtained via the alternating series gives…
We find an explicit upper bound for general $L$-functions on the critical line, assuming the Generalized Riemann Hypothesis, and give as illustrative examples its application to some families of $L$-functions and Dedekind zeta functions.…
Quantum phase estimation is one of the key algorithms in the field of quantum computing, but up until now, only approximate expressions have been derived for the probability of error. We revisit these derivations, and find that by ensuring…
Consider the divisor sum $\sum_{n\leq N}\tau(n^2+2bn+c)$ for integers $b$ and $c$. We extract an asymptotic formula for the average divisor sum in a convenient form, and provide an explicit upper bound for this sum with the correct main…
It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
We improve using elementary means an explicit bound on the divisor function due to Friedlander and Iwaniec. Consequently we modestly improve a result regarding a sieving inequality for Gaussian sequences.
The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let $e_k(n)$ denote the average edit distance between random, independent strings of $n$…
For $k \ge 2$ even, and $ \alpha \ge -(2k+1)/4 $, we provide a uniform approximation of the ultraspherical polynomials $ P_k^{(\alpha,\, \alpha)}(x) $ in the oscillatory region with a very explicit error term. In fact, our result covers all…
In this paper we study the problem of the first moment of the Dedekind zeta function of a number field $K$ and improve the error term. As a ready generalization of our proof, we improve the error term in the Piltz divisor problem.
Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable…
We prove that \[ \sum_{k,{\ell}=1}^N\frac{(n_k,n_{\ell})^{2\alpha}}{(n_k n_{\ell})^{\alpha}} \ll N^{2-2\alpha} (\log N)^{b(\alpha)} \] holds for arbitrary integers $1\le n_1<\cdots < n_N$ and $0<\alpha<1/2$ and show by an example that this…
The distributed hypothesis testing problem with full side-information is studied. The trade-off (reliability function) between the two types of error exponents under limited rate is studied in the following way. First, the problem is…