On the diameter of permutation groups

@article{Babai1992OnTD,
  title={On the diameter of permutation groups},
  author={L. Babai and {\'A}kos Seress},
  journal={Eur. J. Comb.},
  year={1992},
  volume={13},
  pages={231-243}
}
  • L. Babai, Ákos Seress
  • Published 1992
  • Mathematics, Computer Science
  • Eur. J. Comb.
  • For a set S of generators of the finite group G, let diam(G, S) denote the maximum over g ∈ G of the minimal word length expressing g in terms of S ∪ S−1. We define the diameter of G as diam(G) = maxs diam(G, S) (‘worst case’ generators). For permutation groups G of degree n, we prove that diam(G) ≤ exp((n ln n)½(1 + o(1))). (This bound is asymptotically best possible.) For transitive permutation groups G of degree n, we obtain the bound diam(G) ≤ exp(c log3 n)diam(Ak), where Ak is the largest… CONTINUE READING

    Topics from this paper.

    On the diameter of finite groups
    48
    Diameters of groups generated by transposition trees
    Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles
    Diameters of Cayley graphs generated by transposition trees
    7
    Diameter of a direct power of a finite group
    WIDTH QUESTIONS FOR FINITE SIMPLE GROUPS
    On the diameter of the symmetric group: polynomial bounds
    26
    Girth, words and diameter
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 47 REFERENCES
    On the diameter of cayley graphs of the symmetric group
    49
    On the diameter of finite groups
    48
    On the diameter of permutation groups
    54
    Permutation groups in NC
    86
    On the degree of transitivity of permutation groups: A short proof
    21
    Permutation Groups
    785