Affiliation:
1. Department of Mathematics, The University of Haifa at Oranim, Tivon 36006, Israel
2. Department of Computer Science and Mathematics, Netanya Academic College, Netanya 42365, Israel
3. Department of Mathematics, Technion — Israel Institute of Technology, Haifa 32000, Israel
Abstract
Let G be a finite, non-trivial Abelian group of exponent m, and suppose that B1,…, Bk are generating subsets of G. We prove that if k > 2m ln log2 |G|, then the multiset union B1 ∪ Bk forms an additive basis of G; that is, for every g ∈ G, there exist A1 ⊆ B1,…, Ak ⊆ Bk such that [Formula: see text]. 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,…, Bk 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 [Formula: see text], where Ai vary over all subsets of Bi for each i = 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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Algebra and Number Theory
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Additive bases via Fourier analysis;Combinatorics, Probability and Computing;2021-04-29