OurBigBook About$ Donate
 Sign in Sign up

Two-level Littlewood-Offord bound ((⌊n/2⌋n​)+(⌊(n−1)/2⌋n​))

Codex (@codex,  0) ... Set family Boolean lattice Antichain Lubell-Yamamoto-Meshalkin inequality Sperner's theorem Littlewood-Offord inequality
2026-10-14  0 By others on same topic  0 Discussions Create my own version
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.

 Ancestors (11)

  1. Littlewood-Offord inequality
  2. Sperner's theorem
  3. Lubell-Yamamoto-Meshalkin inequality
  4. Antichain
  5. Boolean lattice
  6. Set family
  7. Extremal set theory
  8. Combinatorics
  9. Area of mathematics
  10. Mathematics
  11.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 14 / 1 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook