2022/11/16 by Azizollah Azad, Azad, Azizollah, Nasim Karimi +1
Engineering · Mathematics · #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Group Theory (math.GR) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2211.08699
openalex publication_date 2022/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we mean the maximum of (symmetric) diameter over all generating sets of G. Let n greater than or equal to 1, by G power n we mean the n-th direct power of G. For n greater than or equal to 1 and finite non-abelian solvable group G we find an upper bound, growing polynomially with respect to n, for the symmetric diameter and the diameter of G power n.