Skip to main content
SpringerLink
Log in

Walks on generating sets of groups

  • Article
  • Published:
Inventiones mathematicae Aims and scope

Abstract.

We study a Markov chain on generating n-tuples of a fixed group which arises in algorithms for manipulating finite groups. The main tools are comparison of two Markov chains on different but related state spaces and combinatorics of random paths. The results involve group theoretical parameters such as the size of minimal generating sets, the number of distinct generating k-tuples for different k's and the maximal diameter of the group.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Cornell University, Department of Mathematics, ORIE, Ithaca, NY, 14853, USA, , , , , , US

    P. Diaconis

  2.  CNRS, Université Paul Sabatier, Statistique et Probabilités, F-31062 Toulouse cedex, France, , , , , , FR

    L. Saloff-Coste

Authors
  1. P. Diaconis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Saloff-Coste
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Oblatum 6-VIII-1996 & 6-XI-97

Rights and permissions

Reprints and permissions

About this article

Cite this article

Diaconis, P., Saloff-Coste, L. Walks on generating sets of groups. Invent math 134, 251–299 (1998). https://doi.org/10.1007/s002220050265

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002220050265

Keywords

Search

Navigation