Two-level Littlewood-Offord bound (source code)

= Two-level Littlewood-Offord bound
{title2=$\binom n{\lfloor n/2\rfloor}+\binom n{\lfloor(n-1)/2\rfloor}$}

For real coefficients of absolute value at least one, an open interval of length four contains at most the sum of the two largest binomial coefficients of signed sums. The corresponding subset family has no three-element inclusion chain. Its <Lubell mass> is therefore at most two, giving the bound by allocating mass to the two largest levels. Unit coefficients attain it at a center midway between the two chosen sum levels.