We prove that the analog of the Grushko-Neumann theorem does not hold for profinite free products of profinite groups. To do that we bound the number of generators of a finite group generated by a family of subgroups of pairwise coprime orders.
On the Number of Generators and Composition Length of Finite Linear Groups
β Scribed by A Lucchini; F Menegazzo; M Morigi
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 151 KB
- Volume
- 243
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
β¦ Synopsis
In 1991 Dixon and Kovacs 8 showed that for each field K which has finite degree over its prime subfield there is a number d such that every K finite nilpotent irreducible linear group of degree n G 2 over K can be w x wx ' generated by d nr log n elements. Afterwards Bryant et al. 3 proved K ' d G F q d nr log n for some absolute constants and . 1 2 1 2
Ε½ . We recall that an irreducible subgroup G of GL V is called quasi-K primitive if every normal subgroup of G is homogeneous on V. The study of the particular case of quasi-primitive linear groups plays a crucial role 1 Research partially supported by M.U.R.S.T. of Italy.
π SIMILAR VOLUMES
We study the number of homomorphisms from a finite group to a general linear group over a finite field. In particular, we give a generating function of such numbers. Then the Rogers-Ramanujan identities are applicable.
The largest possible number of representations of an integer in the k-fold sumset kA=A+ } } } +A is maximal for A being an arithmetic progression. More generally, consider the number of solutions of the linear equation where c i {0 and \* are fixed integer coefficients, and where the variables a i
A formation is a class 3 of groups which is closed under homomorphic images and is such that each group G has a unique smallest normal subgroup H with factor group in 5. This uniquely determined normal subgroup of G is called the 8-residual subgroup of G and will be denoted here by G,. The formatio