Linear combinations of Rademacher random variables

arXiv1703.07251MaRDI QIDQ6284630FDOQ6284630

Authors: Harrie Hendriks, Martien C. A. van Zuijlen

Publication date: 21 March 2017

Abstract: For a fixed unit vector

a = (a_{1}, a_{2}, l d o t s, a_{n}) i n S^{n - 1}

, we consider the

2^{n}

sign vectors

v a r e p s i l o n = (v a r e p s i l o n^{1}, v a r e p s i l o n^{2}, l d o t s, v a r e p s i l o n^{n}) i n {+ 1, - 1}^{n}

and the corresponding scalar products

v a r e p s i l o n c d o t a = s u m_{i = 1}^{n} v a r e p s i l o n^{i} a_{i}

. In this paper we will solve for

n = 1, 2, l d o t s, 9

an old conjecture stating that of the

2^{n}

sums of the form

s u m p m a_{i}

it is impossible that there are more with

| s u m_{i = 1}^{n} p m a_{i} | > 1

than there are with

| s u m_{i = 1}^{n} p m a_{i} | l e q 1

. Although the problem has been solved completely in case the

a_{i}

's are equal, the more general problem with possible non-equal

a_{i}

's remains open for values of

n g e q 10

. The present method can also be used for

n g e q 10

, but unfortunately the technical difficulties seem to grow exponentially with

n

and no "induction type of argument" has been found. The conjecture has an appealing reformulation in probability theory and in geometry. In probability theory the results lead to upper bounds which are much better than for instance Chebyshevnequalities.

Mathematics Subject Classification ID

Combinatorial probability (60C05) Combinatorial inequalities (05A20)

This page was built for publication: Linear combinations of Rademacher random variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6284630)