Generating abelian groups by addition only
Benjamin Klopsch, Vsevolod F. Lev

TL;DR
This paper investigates the maximum positive diameter of finite abelian groups with respect to their generating sets, classifies the sets achieving this maximum, and explores bounds related to the size of these sets.
Contribution
It determines the maximum positive diameter for finite abelian groups, classifies the extremal generating sets, and bounds the size of generating sets with large diameter.
Findings
Identified the maximum positive diameter for finite abelian groups.
Classified all generating sets that attain this maximum.
Bounded the size of generating sets with large positive diameter.
Abstract
We define the positive diameter of a finite group with respect to a generating set to be the smallest non-negative integer such that every element of can be written as a product of at most elements of . This invariant, which we denote by , can be interpreted as the diameter of the Cayley digraph induced by on . In this paper we study the positive diameters of a finite abelian group with respect to its various generating sets . 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 subject to the condition that is "not too small". Conceptually, the problems studied are closely related to our earlier work and the results obtained shed a new light on the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · graph theory and CDMA systems · Microtubule and mitosis dynamics
