English

Additive Bases in Abelian Groups

Number Theory 2008-12-16 v1 Combinatorics

Abstract

Let GG be a finite, non-trivial abelian group of exponent mm, and suppose that B1,...,BkB_1, ..., B_k are generating subsets of GG. We prove that if k>2mlnlog2Gk>2m \ln \log_2 |G|, then the multiset union B1...BkB_1\cup...\cup B_k forms an additive basis of GG; that is, for every gGg\in G there exist A1B1,...,AkBkA_1\subset B_1, ..., A_k\subset B_k such that g=i=1kaAiag=\sum_{i=1}^k\sum_{a\in A_i} a. This generalizes a result of Alon, Linial, and Meshulam on the additive bases conjecture. As another step towards proving the conjecture, in the case where B1,...,BkB_1, ..., B_k are finite subsets of a vector space we obtain lower-bound estimates for the number of distinct values, attained by the sums of the form i=1kaAia\sum_{i=1}^k \sum_{a\in A_i} a, where AiA_i vary over all subsets of BiB_i for each i=1,>...,ki=1, >..., k. Finally, we establish a surprising relation between the additive bases conjecture and the problem of covering the vertices of a unit cube by translates of a lattice, and present a reformulation of (the strong form of) the conjecture in terms of coverings.

Keywords

Cite

@article{arxiv.0812.2613,
  title  = {Additive Bases in Abelian Groups},
  author = {Vsevolod F. Lev and Mikhail E. Muzychuk and Rom Pinchasi},
  journal= {arXiv preprint arXiv:0812.2613},
  year   = {2008}
}
R2 v1 2026-06-21T11:51:49.086Z