Finite Presentability of Bruck–Reilly Extensions of Groups
✍ Scribed by Isabel M Araújo; N Rus̆kuc
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 96 KB
- Volume
- 242
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
✦ Synopsis
The purpose of this paper is to consider finite generation and finite presentabil-Ž . ity of a Bruck᎐Reilly extension S s BR G, of a group G with respect to an endomorphism . It is proved that S is finitely generated if and only if G can be generated by a set of the form D ϱ A i , where A : G is finite. The main result is 0 states that S is finitely presented if and only if G can be defined by a presentation
finite set of relations R. Finally, it is proved that S is finitely presented as an inverse monoid if and only if it is finitely presented as an ordinary monoid.
📜 SIMILAR VOLUMES
A sufficient condition is obtained for the residual torsion-free nilpotence of certain finitely presented metabelian groups that arise from a matrix representa-Ž . tion developed by Magnus 1939, Ann. of Math. 40, 764᎐768 for metabelian Ž groups. Using this condition and a construction due to Baumsla
This paper describes generic patterns for the extensions between simple modules of a finite Chevalley group. A one-to-one correspondence between these extensions and the extensions between certain simple modules of the ambient algebraic group are established. It is shown that an extension appears in
Let G be a finitely presented group. This paper describes the theory and practice of a method for obtaining information about the finite and abelian-by-finite quotients of G, which often allows computation about larger quotients of the group than has been possible by more traditional methods. The pa
## Abstract Let __L/F__ be a dihedral extension of degree 2__p__, where __p__ is an odd prime. Let __K/F__ and __k/F__ be subextensions of __L/F__ with degrees __p__ and 2, respectively. Then we will study relations between the __p__‐ranks of the class groups Cl(__K__) and Cl(__k__). (© 2005 WILEY‐