Abstract
Let F be a free group generated by a finite alphabet A. Let N1 (N2) be the normal closure of a finite non-empty symmetrized set R1 (respectively, R2) of elements in F. Earlier, one obtained the conditions sufficient for the solvability of the conjugacy problem in the group F/N1 ∩ N2. The present paper is a continuation of this research and is devoted to the solvability of the multiple conjugacy problem in F/N1 ∩ N2. In particular, we get that if R1 ∪ R2 satisfies the small cancellation condition C' (1/6), then the multiple conjugacy problem is solvable in F/N1 ∩ N2.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
