Related papers: Explicit bounds for Bell numbers and their ratios
We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…
Wald-type tests are convenient because they allow one to test a wide array of linear and nonlinear restrictions from a single unrestricted estimator; we focus on the problem of implementing Wald-type tests for nonlinear restrictions. We…
Based on the Bell theorem, it has been believed that a theoretical computation of the Bell correlation requires explicit use of an entangled state. Such a physical superposition of light waves occurs in the downconverter sources used in…
In Liu and Lin (Statist. Probab. Letters, 2006), they introduced a kind of complete moment convergence which includes complete convergence as a special case. Inspired by the study of complete convergence, in this paper, we study the…
Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given…
Two types of errors can occur when discriminating pairs of quantum states. Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other. We give explicit expressions bounding…
The goal of this paper is to develop methodology for the systematic analysis of asymptotic statistical properties of data driven DRO formulations based on their corresponding non-DRO counterparts. We illustrate our approach in various…
We present an analytical formula for the asymptotic relative entropy of entanglement for Werner states of arbitrary dimension. We then demonstrate its validity using methods from convex optimization. To our knowledge, this is the first case…
There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
Solutions to network optimization problems have greatly benefited from developments in nonlinear analysis, and, in particular, from developments in convex optimization. A key concept that has made convex and nonconvex analysis an important…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. The model considered in the paper is very general as we do not impose any…
The Bell's basis is composed of four maximally entangled states of two qubits, named Bell states. They are usual tools in many theoretical studies and experiments. The aim of this paper is to find out the symmetries that determine a Bell…
We give an asymptotic development of the maximum likelihood estimator (MLE), or any other estimator defined implicitly, in a way which involves the limiting behavior of the score and its higher-order derivatives. This development, which is…
For a random walk on the integer lattice $\mathbb{Z}$ that is attracted to a strictly stable process with index $\alpha\in (1, 2)$ we obtain the asymptotic form of the transition probability for the walk killed when it hits a finite set.…
An asymptotic formula is given for the number of y-smooth numbers up to x in a Beatty sequence corresponding to an irrational number of finite type.
We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…
Using a variational approach, two new series representations for the incomplete Gamma function are derived: the first is an asymptotic series, which contains and improves over the standard asymptotic expansion; the second is a uniformly…
In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…
In statistical inference, confidence set procedures are typically evaluated based on their validity and width properties. Even when procedures achieve rate-optimal widths, confidence sets can still be excessively wide in practice due to…