Subset sums in binary spaces

DOI10.1016/0195-6698(92)90028-XzbMath0772.11004MaRDI QIDQ1193559

Gilles Zémor

Publication date: 27 September 1992

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

zbMATH Keywords

lower boundabelian groupcardinalityKneser's theoremsum setssets of binary vectors of given length

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01) Density, gaps, topology (11B05)

Related Items (5)

Generating binary spaces. ⋮ On Sums of Generating Sets in ℤ₂ⁿ ⋮ Freiman–Ruzsa-type theory for small doubling constant ⋮ How long does it take to generate a group? ⋮ On the subgroup generated by a small doubling binary set

Cites Work

• Unnamed Item
• Unnamed Item
• Sur la séparation dans les graphes de Cayley abéliens
• Subset sums
• A problem of Erdős on Abelian groups
• An addition theorem for finite abelian groups
• Abschätzung der asymptotischen Dichte von Summenmengen
• Racine Minimum D'un Groupe Elementaire Abelien
• Optimal numberings and isoperimetric problems on graphs
• Sums of sets in the elementary abelian group of type (p, p)
• An addition theorem modulo p
• Two combinatorial problems in group theory
• On Kneser's Addition Theorem in Groups

This page was built for publication: Subset sums in binary spaces