Abstract
Let Σ denote the class of allnon-abelian finite simple groups. We are concerned with enumerating poly-Σ groups, that is finite groups without abelian composition factors. For any natural numbern let gΣ(n) denote the number of (isomorphism classes of) poly-Σ groups of order at mostn. We determine the growth rate of the sequence gΣ(n),n ε ℵ.
Similarly, for anyS ε Σ we give estimates for the numbers ĝS(k) of poly-S groups of composition length at mostk, ask tends to infinity. This initiates an investigation somewhat complementary to the “classical” enumeration of finitep-groups by Higman [6] and Sims [15].
Our ancillary results include upper bounds for the minimal number of generators and for the number of (equivalence classes of) permutation actions of any given poly-Σ group.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
R. Bercov,On groups without abelian composition factors, Journal of Algebra5 (1967), 106–109.
H. U. Besche, B. Eick and E. A. O’Brien,A millennium project: constructing small groups, International Journal of Algebra and Computation12 (2000), 623–644.
A. V. Borovik, L. Pyber and A. Shalev,Maximal subgroups in finite and profinite groups, Transactions of the American Mathematical Society348 (1996), 3745–3761.
A. R. Camina, G. R. Everest and T. M. Gagen,Enumerating non-soluble groups — a conjecture of John G. Thompson, The Bulletin of the London Mathematical Society18 (1986), 265–268.
W. Gaschütz,Zu einem von B. H. und H. Neumann gestellten Problem, Mathematische Nachrichten14 (1956), 249–252.
G. Higman,Enumerating p-groups. I: Inequalities, Proceedings of the London Mathematical Society10 (1960), 24–30.
D. F. Holt,Enumerating perfect groups, Journal of the London Mathematical Society39 (1989), 67–78.
O. Hölder,Die Gruppen mit quadratfreier Ordungszahl, Nachrichten von der Königlichen Gesellschaft der Wissenschaften in Göttingen. Mathematisch-Physikalische Klasse aus dem Jahre 1895, 211–229.
A. McIver and P. M. Neumann,Enumerating finite groups, The Quarterly Journal of Mathematics. Oxford38 (1987), 473–488.
D. Meier and J. Wiegold,Growth sequences of finite groups V, Journal of the Australian Mathematical Society31 (1981), 374–375.
P. M. Neumann,Enumeration theorem for finite groups, The Quarterly Journal of Mathematics. Oxford20 (1969), 395–401.
L. Pyber,Enumerating finite groups of given order, Annals of Mathematics137 (1993), 203–220.
L. Pyber,Group enumeration and where it leads us, inEuropean Congress of Mathematics, Budapest, Hungary, July 22–26, 1996. Volume II (A. Balog et al., eds.), PsaProgress in Mathematics 169, Birkhäuser, Basel, 1998, pp. 187–199.
D. J. S. Robinson,A Course in the Theory of Groups, Graduate Texts in Mathematics 80, Springer-Verlag, New York-Heidelberg-Berlin, 1982.
C. C. Sims,Enumerating p-groups, Proceedings of the London Mathematical Society15 (1965), 151–166.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klopsch, B. Enumerating finite groups without abelian composition factors. Isr. J. Math. 137, 265–284 (2003). https://doi.org/10.1007/BF02785965
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02785965