Given a finite group G and a set A of generators, the diameter diam((G, A)) of the Cayley graph (G, A) is the smallest such that every element of G can be expressed as a word of length at most in A A -1 . We are concerned with bounding diam(G) := maxAdiam((G, A)).
No takes yet. Share an insight, caveat, or question.
Helfgott et al. (2014) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: