Enumerating finite groups without abelian composition factors

被引:0
作者
Benjamin Klopsch
机构
[1] Heinrich-Heine-Universität,Mathematisches Institut
来源
Israel Journal of Mathematics | 2003年 / 137卷
关键词
Normal Subgroup; Finite Group; Isomorphism Class; Wreath Product; Minimal Normal Subgroup;
D O I
暂无
中图分类号
学科分类号
摘要
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 ε ℵ.
引用
收藏
页码:265 / 284
页数:19
相关论文
共 20 条
  • [1] Bercov R.(1967)On groups without abelian composition factors Journal of Algebra 5 106-109
  • [2] Besche H. U.(2000)A millennium project: constructing small groups International Journal of Algebra and Computation 12 623-644
  • [3] Eick B.(1996)Maximal subgroups in finite and profinite groups Transactions of the American Mathematical Society 348 3745-3761
  • [4] O’Brien E. A.(1986)Enumerating non-soluble groups — a conjecture of John G. Thompson The Bulletin of the London Mathematical Society 18 265-268
  • [5] Borovik A. V.(1956)Zu einem von B. H. und H. Neumann gestellten Problem Mathematische Nachrichten 14 249-252
  • [6] Pyber L.(1960)Enumerating p-groups. I: Inequalities Proceedings of the London Mathematical Society 10 24-30
  • [7] Shalev A.(1989)Enumerating perfect groups Journal of the London Mathematical Society 39 67-78
  • [8] Camina A. R.(1987)Enumerating finite groups The Quarterly Journal of Mathematics 38 473-488
  • [9] Everest G. R.(1981)Growth sequences of finite groups V Journal of the Australian Mathematical Society 31 374-375
  • [10] Gagen T. M.(1969)Enumeration theorem for finite groups The Quarterly Journal of Mathematics 20 395-401