Universal completions of the cyclic amalgams of the same type

Abstract

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 = pn^n for some prime p. Then Aut(G) is isomorphic to the set of m×m matrices with determinant coprime to p, GLm_m (eq_q) Also Aut(G)=p(n1)^{(n-1)} (m2)^{(m2)} GLm_m (Zq_q). If α\alphais an automorphism of Sn_nand t is a transposition of Sn_nfor n ̸\not 6, then α\alpha(t)is a transposition. If α\alpha maps transposition to a transposition, then α\alpha is an inner automorphism. Then AUT (Sn)_n) \simeq S n_n ̸\not 6. Furthermore, there exists an outer automorphism of S6_6and OUT (S6_6) \simeq zzz\frac{z}{zz}. Thus OUT (Sg_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=(Sn_nSn_nS_(n-1), ϕ\phi1_1, ϕ\phi2_2) where ϕ\phi is an identity map from S_(n-1) to (Sn_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

Similar works

Full text

thumbnail-image

University of Birmingham Research Archive, E-theses Repository

redirect
Last time updated on 05/07/2012

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.