Generating abelian groups by addition only

Abstract We define the positive diameter of a finite group G with respect to a generating set A ⊆ G to be the smallest non-negative integer n such that every element of G can be written as a product of at most n elements of A. This invariant, which we denote by , can be interpreted as the diameter of the Cayley digraph induced by A on G. In this paper we study the positive diameters of a finite abelian group G with respect to its various generating sets A. More specifically, we determine the maximum possible value of and classify all generating sets for which this maximum value is attained. Also, we determine the maximum possible cardinality of A subject to the condition that is “not too small”. Conceptually, the problems studied are closely related to our earlier work [Klopsch and Lev, J. Algebra 261: 145–171, 2003] and the results obtained shed a new light on the subject. Our original motivation came from connections with caps, sum-free sets, and quasi-perfect codes.

[1]  M. Kneser,et al.  Abschätzung der asymptotischen Dichte von Summenmengen , 1953 .

[2]  Henry B. Mann,et al.  Addition Theorems: The Addition Theorems of Group Theory and Number Theory , 1976 .

[3]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[4]  M. Kneser,et al.  Ein Satz über abelsche Gruppen mit Anwendungen auf die Geometrie der Zahlen , 1954 .

[5]  Vsevolod F. Lev,et al.  Generating binary spaces , 2003, J. Comb. Theory, Ser. A.

[6]  Gábor Hetyei,et al.  On the diameter of finite groups , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Claudine Peyrat,et al.  Large Cayley Graphs on an Abelian Group , 1997, Discret. Appl. Math..

[8]  Fred S. Annexstein,et al.  On the diameter and bisector size of Cayley graphs , 1993, Mathematical systems theory.

[9]  V. Lev,et al.  How long does it take to generate a group , 2003, 0911.2908.

[10]  Fernanda Pambianco,et al.  On the spectrum of the valuesk for which a completek- cap in PG(n, q) exists , 1998 .