Skip to main content
SpringerLink
Log in

Minimal generating sets of maximal size in finite monolithic groups

  • Published:
Archiv der Mathematik Aims and scope Submit manuscript

Abstract

Denote by m(G) the largest size of a minimal generating set of a finite group G. We want to estimate the difference m(G) − m(G/N) in the case when N is the unique minimal normal subgroup of G.

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

References

  1. P. Apisa and B. Klopsch, Groups with a base property analogous to that of vector spaces, arXiv:1211.6137v1, Nov 2012.

  2. Cameron P., Cara P.: Independent generating sets and geometries for symmetric groups. J. Algebra 258, 641–650 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Diaconis P., Saloff-Coste L.: Walks on generating sets of groups. Invent. Math. 134, 251–299 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  4. Detomi E., Lucchini A.: Crowns and factorization of the probabilistic zeta function of a finite group. J. Algebra 265, 651–668 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  5. A. Ballester-Bolinches and L. M. Ezquerro, Classes of finite groups, Mathematics and Its Applications (Springer), vol. 584, Springer, Dordrecht, 2006.

  6. A. Lucchini, The largest size of a minimal generating set of a finite group, Arch. Math, 101 (1) (2013), 18.

    Google Scholar 

  7. Lucchini A.: Generators and minimal normal subgroups. Arch. Math. 64, 273–276 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lucchini A.: Generating wreath products. Arch. Math. 62, 481–490 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lucchini A.: Generating wreath products and their augmentation ideals. Rend. Sem. Mat. Univ. Padova 98, 67–87 (1997)

    MathSciNet  MATH  Google Scholar 

  10. I. Pak, What do we know about the product replacement algorithm?, in: Groups and computation, III, de Gruyter, Berlin (2001), 301–347.

  11. Saxl J., Whiston J.: On the maximal size of independent generating sets of PSL 2(q). J. Algebra 258, 651–657 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Whiston J.: Maximal independent generating sets of the symmetric group. J. Algebra 232, 255–268 (2000)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Università degli Studi di Padova, Via Trieste 63, 35121, Padua, Italy

    Andrea Lucchini

Authors
  1. Andrea Lucchini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrea Lucchini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lucchini, A. Minimal generating sets of maximal size in finite monolithic groups. Arch. Math. 101, 401–410 (2013). https://doi.org/10.1007/s00013-013-0583-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00013-013-0583-3

Mathematics Subject Classification (2000)

Keywords

Search

Navigation