The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem

DOI10.1016/S0195-6698(80)80006-0zbMath0462.05023MaRDI QIDQ1153155

Jerrold R. Griggs

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Sperner's theoremextremal configurationtightest packing

Mathematics Subject Classification ID

Partial orders, general (06A06) Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40)

Related Items (10)

k-color Sperner theorems ⋮ Non-abelian Littlewood-Offord inequalities ⋮ On the tightest packing of sums of vectors ⋮ A tour of \(M\)-part \(L\)-Sperner families ⋮ On the distribution of sums of residues ⋮ Ramsey-Sperner theory ⋮ Stronger form of an M-part Sperner theorem ⋮ Networks and chain coverings in partial orders and their products ⋮ A Sperner-type theorem ⋮ A Ramsey-Sperner theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new results on the Littlewood-Offord problem
• On a lemma of Littlewood and Offord on the distribution of certain sums
• How many sums of vectors can lie in a circle of diameter \(\sqrt 2?\)
• On a lemma of Littlewood and Offord

This page was built for publication: The Littlewood-Offord problem: Tightest packing and an M-part Sperner theorem