Please use this identifier to cite or link to this item:
http://localhost:80/xmlui/handle/123456789/12190
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | A. majeed | - |
dc.date.accessioned | 2020-09-11T10:01:59Z | - |
dc.date.available | 2020-09-11T10:01:59Z | - |
dc.date.issued | 1983-07-30 | - |
dc.identifier.uri | http://142.54.178.187:9060/xmlui/handle/123456789/12190 | - |
dc.description.abstract | fly a theorem of Ilanna Neumann, an a a (la M f an arbitrary collection of arouns is emberfdable if and only if the reduced amalgam of such groups is embeddable. So, in order to discuss the embedHabtlitu of an amalgam of finite groups in a finito First consider the embeddahility of the rer'!;co,f amalgam in a finite aroup. The general problem has avoided solution for the last thirty years. In this report we have investigated the embeddability of an amalgam of three finite dihedral arouns in finite .group. The groups are given in the form A = sa,b - a 2 = b 2 = (ab), 13 = - h' = c 2 = (hc) m= 1> 0 = <c,a : c' = a' = (ca)= I> 'e amalaam A formed by these groups is their reduced amalgam. IF any two of the k,m,n, sag 9. 0 17? are equal to 2 then C =rxsh: h2 =1> embeds the amalaam and is finite. !sere we rxaminr the problem in more generality.e | en_US |
dc.description.sponsorship | PSF | en_US |
dc.language.iso | en_US | en_US |
dc.publisher | PSF | en_US |
dc.relation.ispartofseries | P-P1/MATHS(13); | - |
dc.title | Existance and properation of generalise free projects of certain group maxigam | en_US |
dc.type | Technical Report | en_US |
Appears in Collections: | PSF Funded Projects |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Existance and properation of generalise free projects of certain group maxigam.pdf | 6.52 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.