Conjugacy Separability and Free Products of Groups with Cyclic Amalgamation

1998 ◽  
Vol 57 (3) ◽  
pp. 609-628 ◽  
Author(s):  
L. Ribes ◽  
D. Segal ◽  
P. A. Zalesskii
Keyword(s):  
Free Products ◽  
Products Of Groups ◽  
Conjugacy Separability

scholarly journals Free product decompositions in images of certain free products of groups

2007 ◽  
Vol 310 (1) ◽  
pp. 57-69
Author(s):  
N.S. Romanovskii ◽  
John S. Wilson
Keyword(s):  
Free Product ◽  
Free Products ◽  
Products Of Groups

scholarly journals Quasiperiodic and mixed commutator factorizations in free products of groups

2018 ◽  
Vol 50 (5) ◽  
pp. 832-844 ◽  
Author(s):  
Sergei V. Ivanov ◽  
Anton A. Klyachko
Keyword(s):  
Free Products ◽  
Products Of Groups

scholarly journals A five lemma for free products of groups with amalgamations

1970 ◽  
Vol 3 (1) ◽  
pp. 85-96 ◽  
Author(s):  
J. L. Dyer
Keyword(s):  
Free Product ◽  
Free Products ◽  
Products Of Groups ◽  
Five Lemma

This paper explores a five-lemma situation in the context of a free product of a family of groups with amalgamated subgroups (that is, a colimit of an appropriate diagram in the category of groups). In particular, for two families {Aα}, {Bα} of groups with amalgamated subgroups {Aαβ}, {Bαβ} and free products A, B we assume the existence of homomorphisms Aα → Bα whose restrictions Aαβ → Bαβ are isomorphisms and which induce an isomorphism A → B between the products. We show that the usual five-lemma conclusion is false, in that the morphisms Aα → Bα are in general neither monic nor epic. However, if all Bα → B are monic, Aα → Bα is always epic; and if Aα → A is monic, for all α, then Aα → Bα is an isomorphism.

A remark about the description of free products of groups

1966 ◽  
Vol 62 (2) ◽  
pp. 129-134 ◽  
Author(s):  
John Stallengs
Keyword(s):  
Free Product ◽  
Binary Operation ◽  
Free Products ◽  
Products Of Groups ◽  
Reduced Words

The free product A* B of groups A and B can be described in two ways.We can construct the set of reduced words in A and B. Define a binary operation on by concatenating two words and performing as many reductions as possible. Prove that is a group; the difficult step is the proof of associativity. Define A * B = .

Sign in / Sign up

Export Citation Format

Share Document