Abstract. The starting point for this work was the question whether every finite group G contains a two-generated subgroup H such that pi(H)=pi(G) where pi(G) denotes the set of primes dividing the order of G. We answer the question in the affirmative and address the following more general problem. Let G be a finite group and let i(G) be a property of G. What is the minimum number t such that G contains a t-generated subgroup H satisfying the condition that i.H/ D i.G/? In particular, we consider the situation where i(G) is the set of composition factors (up to isomorphism), the exponent, the prime graph, or the spectrum of the group G. We give a complete answer in the cases where i(G) is the prime graph or the spectrum (obtaining that t D 3 in the former case and t can be arbitrarily large in the latter case). We also prove that if i.G/ is the exponent of G, then t is at most four.
A. Lucchini, M. Morigi, P. Shumyatsky (2012). Boundedly generated subgroups of finite groups. FORUM MATHEMATICUM, 24, 875-887 [10.1515/FORM.2011.092].
Boundedly generated subgroups of finite groups
MORIGI, MARTA;
2012
Abstract
Abstract. The starting point for this work was the question whether every finite group G contains a two-generated subgroup H such that pi(H)=pi(G) where pi(G) denotes the set of primes dividing the order of G. We answer the question in the affirmative and address the following more general problem. Let G be a finite group and let i(G) be a property of G. What is the minimum number t such that G contains a t-generated subgroup H satisfying the condition that i.H/ D i.G/? In particular, we consider the situation where i(G) is the set of composition factors (up to isomorphism), the exponent, the prime graph, or the spectrum of the group G. We give a complete answer in the cases where i(G) is the prime graph or the spectrum (obtaining that t D 3 in the former case and t can be arbitrarily large in the latter case). We also prove that if i.G/ is the exponent of G, then t is at most four.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.