Related papers: A sharp estimate of the discrepancy of a certain n…
Dispersive order is a type of variability order for comparing the variability in probability distributions. Star order compares the skewness of probability distributions. This work considers dispersive and star orders of extreme order…
We present two main contributions to the expected star discrepancy theory. First, we derive a sharper expected upper bound for jittered sampling, improving the leading constants and logarithmic terms compared to the state-of-the-art [Doerr,…
A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…
We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
We find the nodes that minimise divided differences and use them to find the sharp constant in a sublevel set estimate. We also find the sharp constant in the first instance of the van der Corput Lemma using a complex mean value theorem for…
We establish sharp large-deviation asymptotic estimates for the maximum order statistic of i.i.d.\ standard normal random variables on all Borel subsets of the positive real line. This result yields more accurate tail approximations than…
We compare expected star discrepancy under jittered sampling with simple random sampling, and the strong partition principle for the star discrepancy is proved.
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
We give explicit estimates for the Stirling numbers of the second kind $S(n,m)$. With a few exceptions, such estimates are asymptotically sharp. The form of these estimates varies according to $m$ lying in the central or non-central regions…
We consider the geometry relaxation of an isolated point defect embedded in a homogeneous crystalline solid, within an atomistic description. We prove a sharp convergence rate for a periodic supercell approximation with respect to uniform…
In this paper, we consider the upper bound of the probabilistic star discrepancy based on Hilbert space filling curve sampling. This problem originates from the multivariate integral approximation, but the main result removes the strict…
We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028--2042] it is based on the optimization…
The aim of this paper is to improve the large deviation principle for the number of descents in a random permutation by establishing a sharp large deviation principle of any order. We shall also prove a sharp large deviation principle of…
We discuss the problem of defining an estimate for the error in quasi-Monte Carlo integration. The key issue is the definition of an ensemble of quasi-random point sets that, on the one hand, includes a sufficiency of equivalent point sets,…
Convergence rate estimates in limit theorems for sums of independent random variables are considered.
We introduce a class of convex equivolume partitions. Expected star discrepancy results are compared for stratified samples under these partitions, including simple random samples. There are four main parts of our results. First, among…
We study the gaps between consecutive prime numbers directly through Eratosthenes sieve. Using elementary methods, we identify a recursive relation for these gaps and for specific sequences of consecutive gaps, known as constellations.…
In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…
We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.