pith. sign in

arxiv: 1207.3838 · v2 · pith:WF24XGUDnew · submitted 2012-07-16 · 🧮 math.PR

A full proof of universal inequalities for the distribution function of the binomial law

classification 🧮 math.PR
keywords binomialbounddistributionestimatesfullfunctioninequalitiesproof
0
0 comments X
read the original abstract

We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for all binomial distribution and all values of argument) and exact (namely, the upper bound for F_{n,p}(k) is the lower bound for F_{n,p}(k+1)). By means of such estimates it is possible to bound any quantile of the binomial law by 2 subsequent integers.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Notes on constants for maxima of Rademacher averages

    math.PR 2026-06 unverdicted novelty 4.0

    Proves E[max_j | (1/n) sum_i ε_ij |] ≥ min{255/256, (1/sqrt(2 log 2)) sqrt(log(2p)/n)} with equality for (n,p)=(2,1) and (2,8).