Three Standard Deviations Suffice While One Does Not

arXiv

Spencer’s 1985 “six standard deviations suffice”theorem shows that every A∈[–1,1]n×n has a sign vector x in {-1,1}^nx in {-1,1}^n with |Ax|_infty le 6sqrt{n}|Ax|_infty le 6sqrt{n}. We show the upper bound 3arsinh(10)n+41.0000002n for every choice of signs x in {-1,1}^nx in {-1,1}^n. The construction simply replaces a 2–22 fraction of the columns of a Hadamard matrix with independent random sign vectors. This is the first improvement over the n lower bound of Olson and Spencer (1978), which uses a Hadamard matrix.