Boosting an analogue of Jordan's theorem for finite groups

preprint2014arXivOpen access

Abstract

Let C\mathcal C be a set of finite groups which is closed under taking subgroups and let dd and MM be positive integers. Suppose that for any G∈CG\in\mathcal C whose order is divisible by at most two distinct primes there exists an abelian subgroup A⊆GA\subseteq G such that AA is generated by at most dd elements and [G:A]≤M[G : A] \le M. We prove that there exists a positive constant C0C_0 such that any G∈CG \in \mathcal C has an abelian subgroup AA satisfying [G:A]≤C0[G : A] \le C_0, and AA can be generated by at most dd elements. We also prove some related results. Our proofs use the Classification of Finite Simple Groups.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.