Universal completions of the cyclic amalgams of the same type

Automorphisms of Z/nZ is isomorphic to (Z/Z)×. If G is a finite abelian group, which is isomorphic to direct product of m cyclic groups of order q where q = pⁿ for some prime p. Then Aut(G) is isomorphic to the set of m×m matrices with determinant coprime to p, GL_m (e_q) Also Aut(G)=p^{(n-1) (m2)} GL_m (Z_q). If αis an automorphism of S_nand t is a transposition of S_nfor n \(\not\) 6, then α(t)is a transposition. If α maps transposition to a transposition, then α is an inner automorphism. Then AUT (S_n) \(\simeq\) S _n \(\not\) 6. Furthermore, there exists an outer automorphism of S₆and OUT (S₆) \(\simeq\) \(\frac{z}{zz}\). Thus OUT (S_g)=2. Coset enumeration is one of the basic methods for investigating finitely generated subgroups in finitely presented.. Information are gradually added to a coset, a relation, a subgroup tables and once they are filled in, all cosets have been enumerated, the algorithm terminates. Goldschmidt’s Lemma on the number of isomorphism classes of amalgams having fixed type, verify that there is one isomorphism class of amalgam of type A=(S_nS_nS_(n-1), \(\phi\)₁, \(\phi\)₂) where \(\phi\) is an identity map from S_(n-1) to (S_nfor i=1, 2 and n\(\not\) 2,3,6,7. When n=2,7 we have two isomorphic class of amalgam of type A. Finally, i A and A’ are cyclic amalgams of the same type then there universal completions are isospectral.

Name dc:type.qualificationname

m_ph

Level dc:type.qualificationlevel

m_ph

Grantor dc:publisher.institution

University of Birmingham

Year dc:date.issued

2010

Author dc:creator

• Atapattu Arachchille, Kanchana Chamila

• QA Mathematics