On the number of generators for certain finite groups
โ Scribed by Richard M Thomas
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 246 KB
- Volume
- 71
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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.
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
Let R denote a commutative (and associative) ring with 1 and let A denote a finitely generated commutative R-algebra. Let G denote a finite group of R-algebra automorphisms of A. In the case that R is a field of characteristic 0, Noether constructed a finite set of R-algebra generators of the invari
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.
In his paper on the crossing numbers of generalized Petersen graphs, Fiorini proves that P(8, 3) has crossing number 4 and claims at the end that P(10, 3) also has crossing number 4. In this article, we give a short proof of the first claim and show that the second claim is false. The techniques are