Related papers: Simple bounds with best possible accuracy for rati…

The well-known von Bahr--Esseen bound on the absolute $p$th moments of martingales with $p\in(1,2]$ is extended to a large class of moment functions, and now with a best possible constant factor (which depends on the moment function). This…

We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form S_pi(N) := sum_{j_1, ..., j_2m = 1}^N t^1_{j_1 j_2} t^2_{j_3 j_4} ... t^m_{j_2m-1 j_2m} where some of the summation indices…

We introduce a numerical method for the approximation of functions which are analytic on compact intervals, except at the endpoints. This method is based on variable transforms using particular parametrized exponential and…

We consider the problem of minimizing a sum of non-convex functions over a compact domain, subject to linear inequality and equality constraints. Approximate solutions can be found by solving a convexified version of the problem, in which…

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…

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

The Laplace approximation is a popular method for constructing a Gaussian approximation to the Bayesian posterior and thereby approximating the posterior mean and variance. But approximation quality is a concern. One might consider using…

The focus of this article is the approximation of functions which are analytic on a compact interval except at the endpoints. Typical numerical methods for approximating such functions depend upon the use of particular conformal maps from…

Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…

Consider a geometric range space $(X,\c{A})$ where each data point $x \in X$ has two or more values (say $r(x)$ and $b(x)$). Also consider a function $\Phi(A)$ defined on any subset $A \in (X,\c{A})$ on the sum of values in that range e.g.,…

Simulations of motion by mean curvature in bounded domains, with applications to bubble motion and grain growth, rely upon boundary conditions that are only approximately compatible with the equation of motion. Three closed form solutions…

The essentials of fractional calculus according to different approaches that can be useful for our applications in the theory of probability and stochastic processes are established. In addition to this, from this fractional integral one…

Recent results concerning asymptotic Bayes-optimality under sparsity (ABOS) of multiple testing procedures are extended to fairly generally distributed effect sizes under the alternative. An asymptotic framework is considered where both the…

Let $u$ be a positive harmonic function in the unit ball $B_1 \subset \mathbb{R}^n$ and let $\mu$ be the boundary measure of $u$. Consider a point $x\in \partial B_1$ and let $n(x)$ denote the unit normal vector at $x$. Let $\alpha$ be a…

A classic result of Williamson, Goemans, Mihail, and Vazirani [STOC 1993: 708-717] states that the problem of covering an uncrossable set family by a min-cost edge set admits approximation ratio $2$, by a primal-dual algorithm with a…

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching polynomial of complete bipartite graphs with bounded weights…

In this paper, we consider the Clenshaw-Curtis-Filon method for the highly oscillatory Bessel transform $\int_0^1x^\alpha (1-x)^\beta f(x) J_{\nu}(\omega x)dx$, where $f$ is a smooth function on $[0, 1]$, and $\nu\geq0.$ The method is based…