Skip to main content

Group Enumeration and Where It Leads Us

  • Conference paper
European Congress of Mathematics

Part of the book series: Progress in Mathematics ((PM,volume 169))

Abstract

Let g(n) be the number of (isomorphism classes of) groups of order n. One of the most intriguing problems of asymptotic group theory is to obtain sharp estimates for g(n) (see section 2 for the history of the problem).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Aschbacher and R. M. Guralnick, Solvable generation of groups and Sylow subgroups of the lower central series, J. Algebra, 77 (1982), 189–201.

    Article  MathSciNet  MATH  Google Scholar 

  2. L. Babai, The probability of generating the symmetric group, J. Comb. Theory (A), 52 (1989), 148–153.

    Article  MathSciNet  MATH  Google Scholar 

  3. L. Babai, P. J. Cameron and P. P. Pálfy, On the orders of primitive groups with restricted nonabelian composition factors, J. Algebra, 79 (1982), 161–168.

    Article  MathSciNet  MATH  Google Scholar 

  4. J. Buhler, R. Gupta and J. Harris, Isotropie sub spaces for skewforms and maximal abelian subgroups of p-groups, J. Algebra, 108 (1987), 269–279.

    Article  MathSciNet  MATH  Google Scholar 

  5. L. Babai, A. J. Goodman and L. Pyber, On faithful permutation representations of small degree, Comm. in Algebra, 21 (1993), 1587–1602.

    Article  MathSciNet  MATH  Google Scholar 

  6. M. Bhattacharjee, The probability of generating certain profinite groups by two elements, Israel J. Math., 86 (1994), 311–330.

    Article  MathSciNet  MATH  Google Scholar 

  7. M. Bhattacharjee, Free subgroups in certain profinite groups, in preparation.

    Google Scholar 

  8. S. R. Blackburn, Group enumeration, D. Phil. thesis, Oxford, 1992.

    Google Scholar 

  9. A. V. Borovik and L. Pyber, On the number of maximal solvable subgroups of a finite group, in preparation.

    Google Scholar 

  10. A. V. Borovik, L. Pyber and A. Shalev, Maximal subgroups in finite and profinite groups Trans. Amer. Math. Soc, 348 (1996), 3745–3761.

    Article  MathSciNet  MATH  Google Scholar 

  11. J. D. Dixon, The probability of generating the symmetric group, Math. Z. 110 (1969), 199–205.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. D. Dixon, L. Pyber, Á. Seress and A. Shalev, Residual properties of free groups and probabilistic methods, in preparation.

    Google Scholar 

  13. M. D. Fried and M. Jarden, Field Arithmetic, Springer, Berlin, 1986.

    MATH  Google Scholar 

  14. R. M. Guralnick and W. M. Kantor, Probabilistic generation of finite simple groups, in preparation.

    Google Scholar 

  15. A. J. Goodman, The edge-orbit conjecture of Babai, J. Comb. Theory (B), 57 (1993), 26–35.

    Article  Google Scholar 

  16. R. M. Guralnick, On the number of generators of a finite group, Arch. Math., 53 (1989), 521–523.

    Article  MathSciNet  MATH  Google Scholar 

  17. G. Higman, Enumerating p-groups, I: Inequalities, Proc. London Math. Soc. (3),10 (1960), 24–30.

    Article  MathSciNet  Google Scholar 

  18. G. Higman, Enumerating p-groups, II: Problems whose solution is PORC, Proc. London Math. Soc. (3), 10 (1960), 562–582.

    Google Scholar 

  19. D. F. Holt, Enumerating perfect groups, J. London Math. Soc, 39 (1989), 67–78.

    Article  MathSciNet  MATH  Google Scholar 

  20. O. Hölder, Die Gruppen mit quadratfreier Ordnungszahl, Nachr. König. Ges. Wiss. Göttingen Math.-Phys. Kl. (1895), 211–229.

    Google Scholar 

  21. H. W. Henn and S. Priddy, p-Nilpotence, classifying space indecomposability, and other properties of almost all finite groups, Comment. Math. Helv., 69 (1994), 335–350.

    Article  MathSciNet  MATH  Google Scholar 

  22. E. Hrushovski and L. Pyber, unpublished.

    Google Scholar 

  23. W. M. Kantor and A. Lubotzky, The probability of generating a finite classical group, Geom. Dedicata, 36 (1990), 67–87.

    Article  MathSciNet  MATH  Google Scholar 

  24. W. M. Kantor and E. M. Luks, Computing in quotient groups, Proc. 22nd ACM STOC (1990), 524–534.

    Google Scholar 

  25. R. L. Kruse and D. T. Price, Enumerating finite rings, J. London Math. Soc, (2),2 (1970), 149–159.

    Article  MathSciNet  MATH  Google Scholar 

  26. V. A. Liskovets, Towards the enumeration of subgroups of the free group, Dokl. AN BSSR, 15 (1971), 6–9, (in Russian).

    Google Scholar 

  27. H.-Q. Liu, On the number of abelian groups of a given order, Acta Arith. 59 (1991), 261–277.

    MathSciNet  MATH  Google Scholar 

  28. L. Levai and L. Pyber, Dense free subgroups in profinite groups, in preparation.

    Google Scholar 

  29. A. Lubotzky, L. Pyber and A. Shalev, Discrete groups of slow subgroup growth, Israel J. Math. (Amitsur Volume), 96 (1996), 399–418.

    Article  MathSciNet  MATH  Google Scholar 

  30. M. W. Liebeck and A. Shalev, The probability of generating a finite simple group, Geom. Dedicata, 56 (1995), 103–113.

    Article  MathSciNet  MATH  Google Scholar 

  31. M. W. Liebeck and A. Shalev, Classical groups, probabilistic methods, and the (2,3)-generation problem, Annals of Math., 144 (1996), 77–125.

    Article  MathSciNet  MATH  Google Scholar 

  32. A. Lubotzky, Subgroup growth and congruence subgroups, Invent. Math., 119 (1995), 267–195.

    Article  MathSciNet  MATH  Google Scholar 

  33. A. Lubotzky, Subgroup growth, in Proc. ICM Zürich’ 94, Vol.1, Birkhäuser, Basel, 1995, pp. 309–317.

    Google Scholar 

  34. A. Lucchini,A bound for the number of generators of a finite group, Arch. Math., 53 (1989), 313–317.

    Google Scholar 

  35. A. Lucchini, Some profinite groups containing a dense free subgroup, in preparation.

    Google Scholar 

  36. E. M. Luks, What is a typical nilpotent Lie algebra? in Computers in nonassociative rings and algebras, (eds. R. E. Beck and B. Kolman) Acad. Press, 1977, pp. 189–207.

    Google Scholar 

  37. A. Mann, Positively finitely generated groups, Forum Math., 8 (1996), 429–459.

    Article  MathSciNet  MATH  Google Scholar 

  38. G. Zh. Mantashyan, The number of generators of finite p-groups and nilpo-tent groups without torsion and dimensions of associative rings and Lie algebras, Matematika, 6 (1988), 178–186, (in Russian), Zbl. Math., 744 20034.

    MATH  Google Scholar 

  39. U. Martin, Almost all p-groups have automorphism group a p-group, Bull. Amer. Math. Soc, 15 (1986), 78–82.

    Article  MathSciNet  MATH  Google Scholar 

  40. M. R. Murty and V. K. Murty, On groups of squarefree order, Math. Annalen, 267 (1989), 299–304.

    Article  Google Scholar 

  41. A. McIver and P. M. Neumann, Enumerating finite groups, Quart. J. Math. Oxford, 38 (1987), 473–488.

    Article  MathSciNet  MATH  Google Scholar 

  42. T. Müller and L. Pyber, unpublished.

    Google Scholar 

  43. A. Mann and D. Segal, Subgroup growth: some current developments, in Infinite groups 94 (eds. de Giovanni and Nevell) Walter de Gruyter, Berlin-New York, 1995, pp. 179–197.

    Google Scholar 

  44. M. R. Murty and S. Srinivasan, On the number of groups of squarefree order, Can. Math. Bull, 30 (1987), 87–92.

    Article  Google Scholar 

  45. A. Mann and A. Shalev, Simple groups, maximal subgroups and probabilistic aspects of profinite groups, Israel J. Math. (Amitsur Volume), 96 (1996), 449–468.

    Article  MathSciNet  MATH  Google Scholar 

  46. T. Müller, Subgroup growth of free products, Invent. Math., to appear.

    Google Scholar 

  47. Yu. A. Neretin, An estimate of the number of parameters defining an n-dimensional algebra, Math. USSR Izvestiya, 30 (1988), 283–294.

    Article  MathSciNet  MATH  Google Scholar 

  48. P. M. Neumann, An enumeration theorem for finite groups, Quart. J. Math. Oxford, 20 (1969), 395–401.

    Article  MATH  Google Scholar 

  49. P. M. Neumann, Proof of a conjecture by Garrett Birkhoff and Philip Hall on the automorphisms of a finite group, Bull. London. Soc, 27 (1995), 222–224.

    Article  MATH  Google Scholar 

  50. M. F. Newman and C. Seeley, Modality for nilpotent Lie algebras, in preparation.

    Google Scholar 

  51. P. M. Neumann and M. R. Vaughan-Lee, An essay on BFC groups, Proc. London Math. Soc. (3), 35 (1977), 213–237.

    Article  MathSciNet  MATH  Google Scholar 

  52. A. Yu. Olshanskii, The number of generators and orders of abelian subgroups of finite p-groups, Math. Notes 23 (1978), 183–185.

    Article  Google Scholar 

  53. L. Pyber and A. Shalev, Groups with super-exponential subgroup growth, Com-binatorica, 16 (1996), 527–533.

    MathSciNet  MATH  Google Scholar 

  54. L. Pyber and A. Shalev, Asymptotic results for primitive permutation groups, J. Algebra, 188 (1997), 103–124.

    Article  MathSciNet  MATH  Google Scholar 

  55. L. Pyber, Enumerating finite groups of given order, Annals of Math., 137 (1993), 203–220.

    Article  MathSciNet  MATH  Google Scholar 

  56. L. Pyber, Asymptotic results for permutation groups, in Groups and Computation, Proc. Workshop New Brunswick 1991, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol.11 (eds. L. Finkelstein and W. M. Kantor) 1993, pp. 197–219.

    Google Scholar 

  57. L. Pyber, Asymptotic results for simple groups and some applications, in Groups and Computation, Proc. Workshop New Brunswick 1995, DIMACS Series in Discrete Mathematics and Theoretical Computer Science Vol. 128, (eds. L. Finkelstein and W. M. Kantor), 1997, 309–327.

    Google Scholar 

  58. C. C. Sims, Enumerating p-groups, Proc London Math. Soc, 15 (1965), 151–166.

    Article  MathSciNet  MATH  Google Scholar 

  59. T. S. Weigel, Residual properties of free groups, J. Algebra, 160 (1993), 16–41.

    Article  MathSciNet  MATH  Google Scholar 

  60. T. S. Weigel, Residual properties of free groups, II., Comm. Algebra, 20 (1992) 1395–1425.

    Article  MathSciNet  MATH  Google Scholar 

  61. T. S. Weigel, Residual properties of free groups, III., Israel J. Math., 77 (1992) 65–81.

    Article  MathSciNet  MATH  Google Scholar 

  62. J. S. Wilson and E. Zelmanov, Identities for Lie algebras of pro-p groups, J. of Pure and Applied Algebra, 81 (1992), 103–109.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Basel AG

About this paper

Cite this paper

Pyber, L. (1998). Group Enumeration and Where It Leads Us. In: Balog, A., Katona, G.O.H., Recski, A., Sza’sz, D. (eds) European Congress of Mathematics. Progress in Mathematics, vol 169. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8898-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8898-1_11

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9819-5

  • Online ISBN: 978-3-0348-8898-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics