An interesting result due to Nash-Williams (1959) can be used to construct enumerations of countably infinite abelian groups using sets of generators. In addition to providing a more accessible proof of this classical result, we compute, for any such group and any collection of generators, the cardinality of the set of such enumerations. These results can also be interpreted in terms of Cayley graphs for groups.
No takes yet. Share an insight, caveat, or question.
Corwin et al. (2024) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: