The maximum-step normal approximation bound for Rademacher sums

For a variance-one weighted sum of independent fair signs, the Kolmogorov distance from the standard normal law is at most Φ(m) − 1/2, where m is the largest coefficient magnitude. This preprint gives a direct proof of the inequality posed by Keller and Klein. Stopping short steps at their first exit yields the central concentration bound; paired characteristic-function estimates cover the remaining ranges. Odd equal-weight sums attain equality. The paper acknowledges Ivanisvili’s independent solution of the maximum-coefficient conjecture.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-19
DOI
https://doi.org/10.5281/zenodo.24356787
Primary Topic
Probability and Statistical Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The maximum-step normal approximation bound for Rademacher sums

Fomalhaut
Zenodo (CERN European Organization for Nuclear Research)
Probability and Statistical Research
preprint

The maximum-step normal approximation bound for Rademacher sums

Fomalhaut
preprint en

Abstract

For a variance-one weighted sum of independent fair signs, the Kolmogorov distance from the standard normal law is at most Φ(m) − 1/2, where m is the largest coefficient magnitude. This preprint gives a direct proof of the inequality posed by Keller and Klein. Stopping short steps at their first exit yields the central concentration bound; paired characteristic-function estimates cover the remaining ranges. Odd equal-weight sums attain equality. The paper acknowledges Ivanisvili’s independent solution of the maximum-coefficient conjecture.

Zenodo (CERN European Organization for Nuclear Research)
Probability and Statistical Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon